/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:03:52,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:03:52,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:03:52,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:03:52,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:03:52,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:03:52,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:03:52,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:03:52,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:03:52,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:03:52,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:03:52,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:03:52,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:03:52,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:03:52,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:03:52,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:03:52,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:03:52,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:03:52,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:03:52,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:03:52,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:03:52,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:03:52,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:03:52,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:03:52,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:03:52,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:03:52,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:03:52,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:03:52,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:03:52,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:03:52,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:03:52,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:03:52,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:03:52,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:03:52,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:03:52,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:03:52,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:03:52,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:03:52,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:03:52,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:03:52,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:03:52,058 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:03:52,072 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:03:52,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:03:52,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:03:52,073 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:03:52,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:03:52,074 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:52,074 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:03:52,074 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:03:52,074 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:03:52,074 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:03:52,075 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:03:52,075 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:03:52,075 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:03:52,075 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:03:52,075 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:03:52,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:03:52,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:03:52,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:03:52,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:03:52,076 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:03:52,076 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:03:52,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:03:52,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:03:52,077 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:03:52,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:52,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:03:52,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:03:52,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:03:52,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:03:52,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:03:52,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:03:52,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:03:52,267 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:03:52,267 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:03:52,268 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:03:52,336 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_MeAlhJ/tmp/bd0a4bce578d4a3b8385b96126d1418e/FLAG80d644499 [2020-07-01 13:03:52,663 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:03:52,664 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:03:52,665 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:03:52,671 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_MeAlhJ/tmp/bd0a4bce578d4a3b8385b96126d1418e/FLAG80d644499 [2020-07-01 13:03:53,066 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_MeAlhJ/tmp/bd0a4bce578d4a3b8385b96126d1418e [2020-07-01 13:03:53,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:03:53,079 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:03:53,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:53,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:03:53,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:03:53,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae418eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:03:53,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:03:53,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:53,354 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:03:53,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:53,387 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:03:53,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53 WrapperNode [2020-07-01 13:03:53,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:53,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:53,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:03:53,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:03:53,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:53,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:03:53,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:03:53,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:03:53,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:03:53,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:03:53,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:03:53,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:03:53,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:03:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:03:53,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:03:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:03:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:03:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:03:53,833 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:03:53,833 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:03:53,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53 BoogieIcfgContainer [2020-07-01 13:03:53,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:03:53,839 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:03:53,839 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:03:53,842 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:03:53,842 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,862 INFO L313 BlockEncoder]: Initial Icfg 56 locations, 58 edges [2020-07-01 13:03:53,863 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:03:53,864 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:03:53,865 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:03:53,865 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:53,867 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:03:53,868 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:03:53,868 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:03:53,897 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:03:53,940 INFO L200 BlockEncoder]: SBE split 32 edges [2020-07-01 13:03:53,945 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:03:53,947 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:53,983 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:03:53,987 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:03:53,988 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:03:53,989 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:53,989 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:03:53,989 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:03:53,990 INFO L313 BlockEncoder]: Encoded RCFG 48 locations, 91 edges [2020-07-01 13:03:53,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53 BasicIcfg [2020-07-01 13:03:53,991 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:03:53,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:03:53,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:03:53,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:03:53,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:03:53" (1/4) ... [2020-07-01 13:03:53,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e73cb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (2/4) ... [2020-07-01 13:03:53,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e73cb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (3/4) ... [2020-07-01 13:03:53,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e73cb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53" (4/4) ... [2020-07-01 13:03:53,999 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:03:54,010 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:03:54,018 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 13:03:54,032 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 13:03:54,055 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:03:54,055 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:03:54,056 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:03:54,056 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:03:54,056 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:03:54,056 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:03:54,056 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:03:54,056 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:03:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-01 13:03:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:54,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:54,079 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash 130221, now seen corresponding path program 1 times [2020-07-01 13:03:54,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723549887] [2020-07-01 13:03:54,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723549887] [2020-07-01 13:03:54,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105115258] [2020-07-01 13:03:54,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,314 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-01 13:03:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,540 INFO L93 Difference]: Finished difference Result 79 states and 158 transitions. [2020-07-01 13:03:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:54,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,556 INFO L225 Difference]: With dead ends: 79 [2020-07-01 13:03:54,556 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:03:54,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:03:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:03:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:03:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-07-01 13:03:54,600 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 3 [2020-07-01 13:03:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,601 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-07-01 13:03:54,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-07-01 13:03:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:54,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:54,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:03:54,605 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 130218, now seen corresponding path program 1 times [2020-07-01 13:03:54,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194546264] [2020-07-01 13:03:54,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194546264] [2020-07-01 13:03:54,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438028128] [2020-07-01 13:03:54,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,643 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 3 states. [2020-07-01 13:03:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,782 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2020-07-01 13:03:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:54,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,784 INFO L225 Difference]: With dead ends: 41 [2020-07-01 13:03:54,785 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:03:54,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:03:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:03:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:03:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2020-07-01 13:03:54,791 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 3 [2020-07-01 13:03:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,792 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2020-07-01 13:03:54,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2020-07-01 13:03:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:54,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:54,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:03:54,793 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 4035013, now seen corresponding path program 1 times [2020-07-01 13:03:54,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992596433] [2020-07-01 13:03:54,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992596433] [2020-07-01 13:03:54,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291990279] [2020-07-01 13:03:54,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,831 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2020-07-01 13:03:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,933 INFO L93 Difference]: Finished difference Result 34 states and 61 transitions. [2020-07-01 13:03:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:54,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,935 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:03:54,935 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:03:54,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:03:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:03:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:03:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2020-07-01 13:03:54,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 4 [2020-07-01 13:03:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,941 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 55 transitions. [2020-07-01 13:03:54,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-07-01 13:03:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:54,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:54,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:03:54,942 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash 4035015, now seen corresponding path program 1 times [2020-07-01 13:03:54,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819892050] [2020-07-01 13:03:54,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819892050] [2020-07-01 13:03:54,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693687298] [2020-07-01 13:03:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,978 INFO L87 Difference]: Start difference. First operand 31 states and 55 transitions. Second operand 3 states. [2020-07-01 13:03:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,078 INFO L93 Difference]: Finished difference Result 34 states and 55 transitions. [2020-07-01 13:03:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,079 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:03:55,079 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:03:55,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:03:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:03:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:03:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2020-07-01 13:03:55,084 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 4 [2020-07-01 13:03:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,084 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2020-07-01 13:03:55,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2020-07-01 13:03:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:55,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:55,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:55,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:03:55,086 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash 4035016, now seen corresponding path program 1 times [2020-07-01 13:03:55,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410041937] [2020-07-01 13:03:55,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410041937] [2020-07-01 13:03:55,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:55,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265795178] [2020-07-01 13:03:55,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:55,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,128 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 3 states. [2020-07-01 13:03:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,243 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2020-07-01 13:03:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,245 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:03:55,245 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:03:55,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:03:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:03:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:03:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-07-01 13:03:55,249 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 [2020-07-01 13:03:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,250 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-07-01 13:03:55,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-07-01 13:03:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:55,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:55,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:55,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:03:55,251 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 125083445, now seen corresponding path program 1 times [2020-07-01 13:03:55,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763453437] [2020-07-01 13:03:55,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763453437] [2020-07-01 13:03:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:55,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114910973] [2020-07-01 13:03:55,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:55,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,294 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-07-01 13:03:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,375 INFO L93 Difference]: Finished difference Result 28 states and 49 transitions. [2020-07-01 13:03:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,377 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:03:55,377 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:03:55,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:03:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:03:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:03:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2020-07-01 13:03:55,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 5 [2020-07-01 13:03:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,382 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2020-07-01 13:03:55,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-07-01 13:03:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:55,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:55,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:55,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:03:55,383 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash 125083447, now seen corresponding path program 1 times [2020-07-01 13:03:55,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723130295] [2020-07-01 13:03:55,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723130295] [2020-07-01 13:03:55,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:55,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221614506] [2020-07-01 13:03:55,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:55,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:55,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,412 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 3 states. [2020-07-01 13:03:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,464 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-07-01 13:03:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,465 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:03:55,465 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:03:55,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:03:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:03:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:03:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2020-07-01 13:03:55,469 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 5 [2020-07-01 13:03:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,469 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-07-01 13:03:55,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2020-07-01 13:03:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:55,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:55,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:55,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:03:55,471 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash 125083448, now seen corresponding path program 1 times [2020-07-01 13:03:55,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475229964] [2020-07-01 13:03:55,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475229964] [2020-07-01 13:03:55,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:55,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769841535] [2020-07-01 13:03:55,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:55,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,506 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. [2020-07-01 13:03:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,568 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-07-01 13:03:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,571 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:03:55,571 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:03:55,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:03:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:03:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:03:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:03:55,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:03:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,573 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:03:55,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:03:55,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:03:55,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:03:55,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:03:55,606 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:55,607 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:03:55,608 INFO L268 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-07-01 13:03:55,609 INFO L264 CegarLoopResult]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_f_~count~0.offset) (= 0 ULTIMATE.start_f_~a_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~tmp~0.base)) (= 0 ULTIMATE.start_f_~tmp~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~count~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~a_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~a_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~count~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~tmp~0.base))) [2020-07-01 13:03:55,609 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:03:55,609 INFO L268 CegarLoopResult]: For program point L12-3(lines 12 17) no Hoare annotation was computed. [2020-07-01 13:03:55,609 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:03:55,609 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:03:55,609 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:55,610 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:55,611 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,611 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:55,611 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,611 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,611 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 15) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:03:55,612 INFO L268 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-07-01 13:03:55,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:03:55,613 INFO L268 CegarLoopResult]: For program point L14-6(lines 14 15) no Hoare annotation was computed. [2020-07-01 13:03:55,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:03:55,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:03:55,616 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:03:55,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:55 BasicIcfg [2020-07-01 13:03:55,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:03:55,636 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:03:55,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:03:55,639 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:03:55,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:55,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:03:53" (1/5) ... [2020-07-01 13:03:55,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:03:55, skipping insertion in model container [2020-07-01 13:03:55,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:55,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (2/5) ... [2020-07-01 13:03:55,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:03:55, skipping insertion in model container [2020-07-01 13:03:55,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:55,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (3/5) ... [2020-07-01 13:03:55,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:03:55, skipping insertion in model container [2020-07-01 13:03:55,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:55,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53" (4/5) ... [2020-07-01 13:03:55,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:03:55, skipping insertion in model container [2020-07-01 13:03:55,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:55,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:55" (5/5) ... [2020-07-01 13:03:55,644 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:03:55,666 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:03:55,666 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:03:55,666 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:03:55,667 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:03:55,667 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:03:55,667 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:03:55,667 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:03:55,667 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:03:55,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-07-01 13:03:55,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 13:03:55,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:03:55,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:03:55,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:55,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:55,682 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:03:55,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-07-01 13:03:55,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 13:03:55,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:03:55,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:03:55,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:55,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:55,691 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue [99] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 16#L-1true [172] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~tmp~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~a_1 |v_ULTIMATE.start_f_#in~a_1|) (= |v_ULTIMATE.start_f_#in~a_1| v_ULTIMATE.start_main_~x~0_1) (< 0 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~count~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet11_14|) (= v_ULTIMATE.start_f_~tmp~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~count~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~a_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_f_~a_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1) |v_#valid_3|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_f_#in~a=|v_ULTIMATE.start_f_#in~a_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#t~post9=|v_ULTIMATE.start_f_#t~post9_1|, ULTIMATE.start_f_~a=v_ULTIMATE.start_f_~a_1, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_1, ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_1, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem3=|v_ULTIMATE.start_f_#t~mem3_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_1, ULTIMATE.start_main_~count~1=v_ULTIMATE.start_main_~count~1_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_1, #length=|v_#length_1|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet11_14|] AssignedVars[ULTIMATE.start_f_#in~a, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#t~post9, ULTIMATE.start_f_~a, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_~a_ref~0.offset, ULTIMATE.start_f_~count~0.offset, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem3, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~a_ref~0.base, ULTIMATE.start_main_~count~1, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_~count~0.base, #length, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 13#L9true [111] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~a_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_f_~a_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~a_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_f_~a_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~a_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~a_ref~0.base_3) v_ULTIMATE.start_f_~a_ref~0.offset_3 v_ULTIMATE.start_f_~a_3)))) InVars {ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_3, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_f_~a=v_ULTIMATE.start_f_~a_3, #length=|v_#length_5|} OutVars{ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_3, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_f_~a=v_ULTIMATE.start_f_~a_3, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 11#L9-1true [108] L9-1-->L10: Formula: (and (<= (+ v_ULTIMATE.start_f_~tmp~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~tmp~0.base_3)) (<= 0 v_ULTIMATE.start_f_~tmp~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~tmp~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~tmp~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~tmp~0.base_3) v_ULTIMATE.start_f_~tmp~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_3, ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_3, ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 18#L10true [77] L10-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~count~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~count~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~count~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~count~0.base_3) v_ULTIMATE.start_f_~count~0.offset_3 0))) (<= 0 v_ULTIMATE.start_f_~count~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_f_~count~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_3, ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_3, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_3, ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_3, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 19#L12-2true [2020-07-01 13:03:55,692 INFO L796 eck$LassoCheckResult]: Loop: 19#L12-2true [115] L12-2-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~a_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_f_~a_ref~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_f_~a_ref~0.base_6) v_ULTIMATE.start_f_~a_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~a_ref~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~a_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_5, ULTIMATE.start_f_#t~mem3=|v_ULTIMATE.start_f_#t~mem3_2|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem3] 24#L12true [119] L12-->L13: Formula: (< 1 |v_ULTIMATE.start_f_#t~mem3_6|) InVars {ULTIMATE.start_f_#t~mem3=|v_ULTIMATE.start_f_#t~mem3_6|} OutVars{ULTIMATE.start_f_#t~mem3=|v_ULTIMATE.start_f_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem3] 47#L13true [128] L13-->L13-1: Formula: (and (= (select |v_#valid_15| v_ULTIMATE.start_f_~a_ref~0.base_9) 1) (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_f_~a_ref~0.base_9) v_ULTIMATE.start_f_~a_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_f_~a_ref~0.offset_7) (<= (+ v_ULTIMATE.start_f_~a_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_f_~a_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_7, #length=|v_#length_13|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_9, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_7, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_9, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 45#L13-1true [197] L13-1-->L13-2: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem4_3| 2))) (and (<= (+ v_ULTIMATE.start_f_~tmp~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_f_~tmp~0.base_6)) (= 0 .cse0) (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~tmp~0.base_6 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~tmp~0.base_6) v_ULTIMATE.start_f_~tmp~0.offset_5 .cse0))) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_f_~tmp~0.offset_5))) InVars {ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_5, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, #valid=|v_#valid_17|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_6, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|} OutVars{ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_5, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, #valid=|v_#valid_17|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[#memory_int] 43#L13-2true [124] L13-2-->L14: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 31#L14true [90] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~tmp~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_f_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_f_~tmp~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_f_~tmp~0.base_9)) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_f_~tmp~0.base_9) v_ULTIMATE.start_f_~tmp~0.offset_7))) InVars {ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_9, #memory_int=|v_#memory_int_11|, ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_7, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_f_~tmp~0.offset=v_ULTIMATE.start_f_~tmp~0.offset_7, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, #valid=|v_#valid_19|, ULTIMATE.start_f_~tmp~0.base=v_ULTIMATE.start_f_~tmp~0.base_9, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 28#L14-1true [209] L14-1-->L15: Formula: (> |v_ULTIMATE.start_f_#t~mem5_6| 0) InVars {ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 32#L15true [93] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_f_~a_ref~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~a_ref~0.base_18) v_ULTIMATE.start_f_~a_ref~0.offset_13)) (<= (+ v_ULTIMATE.start_f_~a_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_f_~a_ref~0.base_18)) (<= 0 v_ULTIMATE.start_f_~a_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_18, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_13, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_18, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 49#L15-1true [243] L15-1-->L14-6: Formula: (and (<= (+ v_ULTIMATE.start_f_~a_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_f_~a_ref~0.base_24)) (<= 0 v_ULTIMATE.start_f_~a_ref~0.offset_17) (= 1 (select |v_#valid_47| v_ULTIMATE.start_f_~a_ref~0.base_24)) (= (store |v_#memory_int_27| v_ULTIMATE.start_f_~a_ref~0.base_24 (store (select |v_#memory_int_27| v_ULTIMATE.start_f_~a_ref~0.base_24) v_ULTIMATE.start_f_~a_ref~0.offset_17 (+ |v_ULTIMATE.start_f_#t~mem7_6| (- 1)))) |v_#memory_int_26|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_17, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_24, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, ULTIMATE.start_f_~a_ref~0.offset=v_ULTIMATE.start_f_~a_ref~0.offset_17, ULTIMATE.start_f_~a_ref~0.base=v_ULTIMATE.start_f_~a_ref~0.base_24, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 38#L14-6true [244] L14-6-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~count~0.offset_15) (<= (+ v_ULTIMATE.start_f_~count~0.offset_15 4) (select |v_#length_38| v_ULTIMATE.start_f_~count~0.base_19)) (= 1 (select |v_#valid_48| v_ULTIMATE.start_f_~count~0.base_19)) (= |v_ULTIMATE.start_f_#t~mem8_5| |v_ULTIMATE.start_f_#t~post9_5|) (= |v_ULTIMATE.start_f_#t~mem8_5| (select (select |v_#memory_int_28| v_ULTIMATE.start_f_~count~0.base_19) v_ULTIMATE.start_f_~count~0.offset_15))) InVars {ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_15, #valid=|v_#valid_48|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_19, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|} OutVars{ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_15, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|, ULTIMATE.start_f_#t~post9=|v_ULTIMATE.start_f_#t~post9_5|, #valid=|v_#valid_48|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_19, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~post9] 3#L16-1true [245] L16-1-->L12-2: Formula: (and (= (store |v_#memory_int_30| v_ULTIMATE.start_f_~count~0.base_20 (store (select |v_#memory_int_30| v_ULTIMATE.start_f_~count~0.base_20) v_ULTIMATE.start_f_~count~0.offset_16 (+ |v_ULTIMATE.start_f_#t~post9_7| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_49| v_ULTIMATE.start_f_~count~0.base_20)) (<= 0 v_ULTIMATE.start_f_~count~0.offset_16) (<= (+ v_ULTIMATE.start_f_~count~0.offset_16 4) (select |v_#length_39| v_ULTIMATE.start_f_~count~0.base_20))) InVars {ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_16, ULTIMATE.start_f_#t~post9=|v_ULTIMATE.start_f_#t~post9_7|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_20, #length=|v_#length_39|} OutVars{ULTIMATE.start_f_~count~0.offset=v_ULTIMATE.start_f_~count~0.offset_16, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|, ULTIMATE.start_f_#t~post9=|v_ULTIMATE.start_f_#t~post9_6|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_f_~count~0.base=v_ULTIMATE.start_f_~count~0.base_20, #length=|v_#length_39|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~post9, #memory_int] 19#L12-2true [2020-07-01 13:03:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash 125291878, now seen corresponding path program 1 times [2020-07-01 13:03:55,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797055496] [2020-07-01 13:03:55,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797055496] [2020-07-01 13:03:55,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:55,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569824532] [2020-07-01 13:03:55,713 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:03:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash -807890816, now seen corresponding path program 1 times [2020-07-01 13:03:55,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361947027] [2020-07-01 13:03:55,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361947027] [2020-07-01 13:03:55,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:55,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:03:55,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330363950] [2020-07-01 13:03:55,749 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:03:55,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:55,751 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-01 13:03:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,868 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2020-07-01 13:03:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:55,871 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:03:55,876 INFO L168 Benchmark]: Toolchain (without parser) took 2796.09 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 562.8 MB in the beginning and 375.6 MB in the end (delta: 187.2 MB). Peak memory consumption was 204.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,876 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:03:55,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.51 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 562.8 MB in the beginning and 628.2 MB in the end (delta: -65.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.00 ms. Allocated memory is still 666.4 MB. Free memory was 628.2 MB in the beginning and 626.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,878 INFO L168 Benchmark]: Boogie Preprocessor took 24.91 ms. Allocated memory is still 666.4 MB. Free memory was 626.8 MB in the beginning and 625.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,878 INFO L168 Benchmark]: RCFGBuilder took 383.49 ms. Allocated memory is still 666.4 MB. Free memory was 624.1 MB in the beginning and 597.4 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,879 INFO L168 Benchmark]: BlockEncodingV2 took 151.46 ms. Allocated memory is still 666.4 MB. Free memory was 597.4 MB in the beginning and 583.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,879 INFO L168 Benchmark]: TraceAbstraction took 1643.57 ms. Allocated memory is still 666.4 MB. Free memory was 583.9 MB in the beginning and 406.7 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,880 INFO L168 Benchmark]: BuchiAutomizer took 237.23 ms. Allocated memory is still 666.4 MB. Free memory was 406.7 MB in the beginning and 375.6 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:55,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 56 locations, 58 edges - StatisticsResult: Encoded RCFG 48 locations, 91 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.51 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 562.8 MB in the beginning and 628.2 MB in the end (delta: -65.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.00 ms. Allocated memory is still 666.4 MB. Free memory was 628.2 MB in the beginning and 626.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.91 ms. Allocated memory is still 666.4 MB. Free memory was 626.8 MB in the beginning and 625.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 383.49 ms. Allocated memory is still 666.4 MB. Free memory was 624.1 MB in the beginning and 597.4 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 151.46 ms. Allocated memory is still 666.4 MB. Free memory was 597.4 MB in the beginning and 583.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1643.57 ms. Allocated memory is still 666.4 MB. Free memory was 583.9 MB in the beginning and 406.7 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 237.23 ms. Allocated memory is still 666.4 MB. Free memory was 406.7 MB in the beginning and 375.6 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 13:03:55,893 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,893 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:55,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == count && 0 == a_ref) && 4 == unknown-#length-unknown[tmp]) && 0 == tmp) && 1 == \valid[count]) && 1 == \valid[a_ref]) && 4 == unknown-#length-unknown[a_ref]) && 4 == unknown-#length-unknown[count]) && 1 == \valid[tmp] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 322 SDslu, 5 SDs, 0 SdLazy, 349 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:03:49.753 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_MeAlhJ/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:03:56.132 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check