java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:43:47,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:43:47,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:43:47,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:43:47,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:43:47,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:43:47,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:43:47,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:43:47,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:43:47,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:43:47,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:43:47,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:43:47,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:43:47,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:43:47,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:43:47,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:43:47,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:43:47,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:43:47,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:43:47,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:43:47,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:43:47,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:43:47,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:43:47,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:43:47,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:43:47,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:43:47,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:43:47,396 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:43:47,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:43:47,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:43:47,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:43:47,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:43:47,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:43:47,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:43:47,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:43:47,407 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:43:47,407 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:43:47,408 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:43:47,408 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:43:47,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:43:47,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:43:47,408 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:43:47,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:43:47,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:43:47,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:43:47,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:43:47,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:43:47,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:43:47,411 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:43:47,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:43:47,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:43:47,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:43:47,413 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:43:47,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:43:47,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:43:47,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:43:47,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:43:47,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:43:47,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:43:47,415 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:43:47,415 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:43:47,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:43:47,464 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:43:47,469 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:43:47,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:43:47,471 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:43:47,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:43:47,653 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:43:47,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:43:47,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:43:47,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:43:47,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:43:47,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3a9b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47, skipping insertion in model container [2018-01-24 11:43:47,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,689 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:43:47,730 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:43:47,843 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:43:47,859 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:43:47,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47 WrapperNode [2018-01-24 11:43:47,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:43:47,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:43:47,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:43:47,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:43:47,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... [2018-01-24 11:43:47,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:43:47,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:43:47,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:43:47,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:43:47,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:43:47,958 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:43:47,959 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:43:47,959 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:43:47,959 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:43:47,959 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:43:47,959 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:43:47,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:43:48,175 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:43:48,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:43:48 BoogieIcfgContainer [2018-01-24 11:43:48,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:43:48,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:43:48,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:43:48,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:43:48,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:43:47" (1/3) ... [2018-01-24 11:43:48,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aba1e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:43:48, skipping insertion in model container [2018-01-24 11:43:48,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:43:47" (2/3) ... [2018-01-24 11:43:48,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aba1e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:43:48, skipping insertion in model container [2018-01-24 11:43:48,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:43:48" (3/3) ... [2018-01-24 11:43:48,181 INFO L105 eAbstractionObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:43:48,188 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:43:48,194 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 11:43:48,233 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:43:48,233 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:43:48,233 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:43:48,233 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:43:48,234 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:43:48,234 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:43:48,234 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:43:48,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:43:48,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:43:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 11:43:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:43:48,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:48,265 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:48,265 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 83465695, now seen corresponding path program 1 times [2018-01-24 11:43:48,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:48,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:48,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:48,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:48,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:48,365 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:48,366 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:48,366 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:48,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:48,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:48,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:43:48,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:43:48,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 11:43:48,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:43:48,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 11:43:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:48,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:48,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:43:48,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:43:48,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:43:48,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:43:48,673 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-24 11:43:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:48,776 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-24 11:43:48,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:43:48,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 11:43:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:48,786 INFO L225 Difference]: With dead ends: 66 [2018-01-24 11:43:48,787 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:43:48,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:43:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 11:43:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:43:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 11:43:48,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2018-01-24 11:43:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:48,824 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 11:43:48,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:43:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 11:43:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:43:48,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:48,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:48,826 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 83465696, now seen corresponding path program 1 times [2018-01-24 11:43:48,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:48,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:48,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:48,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:48,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:48,838 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:48,838 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:48,838 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:48,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:48,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:48,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:43:48,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:43:48,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:43:48,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 11:43:48,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:43:48,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:43:48,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:43:48,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 11:43:49,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:49,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:43:49,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-24 11:43:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:49,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:49,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:43:49,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:43:49,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:43:49,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:43:49,135 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-24 11:43:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:49,486 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 11:43:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:43:49,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-24 11:43:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:49,492 INFO L225 Difference]: With dead ends: 64 [2018-01-24 11:43:49,492 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:43:49,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:43:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:43:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-01-24 11:43:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 11:43:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 11:43:49,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-01-24 11:43:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:49,501 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 11:43:49,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:43:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 11:43:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:43:49,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:49,503 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:49,503 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1544748661, now seen corresponding path program 1 times [2018-01-24 11:43:49,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:49,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:49,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:49,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,513 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:49,513 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:49,513 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:49,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:49,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:49,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:49,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:43:49,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:43:49,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:43:49,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:43:49,614 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 11:43:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:49,697 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 11:43:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:43:49,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 11:43:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:49,699 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:43:49,699 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:43:49,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:43:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:43:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 11:43:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:43:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 11:43:49,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 11:43:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:49,708 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 11:43:49,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:43:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 11:43:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:43:49,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:49,709 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:49,709 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -301838139, now seen corresponding path program 1 times [2018-01-24 11:43:49,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:49,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:49,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:49,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,720 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:49,720 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:49,720 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-01-24 11:43:49,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:49,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:49,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:49,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:43:49,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:43:49,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:43:49,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:49,861 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-24 11:43:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:49,918 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-01-24 11:43:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:43:49,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 11:43:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:49,919 INFO L225 Difference]: With dead ends: 94 [2018-01-24 11:43:49,920 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 11:43:49,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 11:43:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-24 11:43:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:43:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-24 11:43:49,930 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2018-01-24 11:43:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:49,930 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-24 11:43:49,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:43:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-24 11:43:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:43:49,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:49,932 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:49,932 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1322906493, now seen corresponding path program 1 times [2018-01-24 11:43:49,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:49,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:49,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:49,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:49,942 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:49,942 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:49,942 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:49,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:49,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:49,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:43:49,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:49,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:43:49,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:49,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:43:49,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 11:43:50,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:43:50,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 11:43:50,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:50,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:43:50,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:43:50,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:43:50,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:50,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:43:50,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-24 11:43:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:50,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:43:50,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-01-24 11:43:50,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:43:50,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:43:50,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:43:50,201 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-01-24 11:43:52,343 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 11:43:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:54,705 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 11:43:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:43:54,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 11:43:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:54,706 INFO L225 Difference]: With dead ends: 56 [2018-01-24 11:43:54,706 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:43:54,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:43:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:43:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-24 11:43:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:43:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 11:43:54,717 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-24 11:43:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:54,717 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 11:43:54,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:43:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 11:43:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:43:54,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:54,718 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:54,718 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1599933162, now seen corresponding path program 1 times [2018-01-24 11:43:54,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:54,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:54,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:54,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:54,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:54,727 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:54,727 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:54,727 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:54,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:54,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:54,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:54,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:43:54,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:43:54,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:43:54,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:43:54,862 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-01-24 11:43:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:54,966 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 11:43:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:43:54,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 11:43:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:54,967 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:43:54,967 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:43:54,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:43:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:43:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-01-24 11:43:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 11:43:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-24 11:43:54,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 25 [2018-01-24 11:43:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:54,976 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-24 11:43:54,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:43:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-24 11:43:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:43:54,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:54,977 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:54,977 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -89010580, now seen corresponding path program 1 times [2018-01-24 11:43:54,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:54,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:54,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:54,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:54,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:54,984 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:54,985 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:54,985 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:54,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:55,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:43:55,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:55,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:43:55,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:43:55,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:43:55,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:43:55,188 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 9 states. [2018-01-24 11:43:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:55,326 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-24 11:43:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:43:55,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-24 11:43:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:55,328 INFO L225 Difference]: With dead ends: 62 [2018-01-24 11:43:55,328 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 11:43:55,329 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:43:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 11:43:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-01-24 11:43:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:43:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 11:43:55,340 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 25 [2018-01-24 11:43:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:55,341 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 11:43:55,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:43:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 11:43:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:43:55,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:55,342 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:55,342 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1941679528, now seen corresponding path program 1 times [2018-01-24 11:43:55,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:55,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:55,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,351 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:55,351 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:55,351 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:55,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:55,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:55,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 11:43:55,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:55,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:43:55,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-24 11:43:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:43:55,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:55,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:43:55,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:43:55,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:43:55,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:43:55,482 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-01-24 11:43:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:55,676 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 11:43:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:43:55,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 11:43:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:55,678 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:43:55,678 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:43:55,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:43:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:43:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 11:43:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:43:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 11:43:55,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 26 [2018-01-24 11:43:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:55,690 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 11:43:55,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:43:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 11:43:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:43:55,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:55,692 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:55,692 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1941679529, now seen corresponding path program 1 times [2018-01-24 11:43:55,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:55,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:55,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,699 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:55,699 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:55,699 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:55,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:55,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:55,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:43:55,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:43:55,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:43:55,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:43:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:43:55,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:55,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:43:55,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:43:55,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:43:55,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:43:55,759 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-01-24 11:43:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:55,785 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 11:43:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:43:55,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 11:43:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:55,786 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:43:55,786 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:43:55,787 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:43:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:43:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:43:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 11:43:55,797 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-24 11:43:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:55,798 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 11:43:55,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:43:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 11:43:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:43:55,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:55,799 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:55,799 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -35380843, now seen corresponding path program 1 times [2018-01-24 11:43:55,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:55,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:55,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,807 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:55,807 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:55,807 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:55,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:55,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:43:55,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:55,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:43:55,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:43:55,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:43:55,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:55,915 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-24 11:43:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:55,981 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-24 11:43:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:43:55,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-24 11:43:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:55,982 INFO L225 Difference]: With dead ends: 76 [2018-01-24 11:43:55,982 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 11:43:55,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:43:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 11:43:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-01-24 11:43:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:43:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 11:43:55,996 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 30 [2018-01-24 11:43:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:55,996 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 11:43:55,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:43:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 11:43:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:43:55,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:43:55,997 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:43:55,998 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:43:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash -169394349, now seen corresponding path program 1 times [2018-01-24 11:43:55,998 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:43:55,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:43:55,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:55,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:55,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:43:56,005 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:43:56,005 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:43:56,005 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:43:56,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:43:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:43:56,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:43:56,094 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc2.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc2.base| 1))) (and (= |c_#valid| (store (store .cse0 |c_main_#t~malloc3.base| 1) |main_#t~malloc2.base| 0)) (= (select |c_old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |c_main_#t~malloc3.base|) 0)))) is different from true [2018-01-24 11:43:56,099 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc2.base| Int) (|main_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc2.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc3.base| 1) |main_#t~malloc2.base| 0) |main_#t~malloc3.base| 0)) (= (select |c_old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |main_#t~malloc3.base|) 0)))) is different from true [2018-01-24 11:43:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:43:56,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:43:56,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:43:56,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:43:56,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:43:56,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=15, Unknown=2, NotChecked=14, Total=42 [2018-01-24 11:43:56,126 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2018-01-24 11:43:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:43:56,164 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-24 11:43:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:43:56,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 11:43:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:43:56,166 INFO L225 Difference]: With dead ends: 52 [2018-01-24 11:43:56,166 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:43:56,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=15, Unknown=2, NotChecked=14, Total=42 [2018-01-24 11:43:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:43:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:43:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:43:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:43:56,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-24 11:43:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:43:56,168 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:43:56,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:43:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:43:56,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:43:56,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:43:56,238 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 11:43:56,281 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 11:43:56,291 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 96 DAG size of output 80 [2018-01-24 11:43:58,726 WARN L146 SmtUtils]: Spent 2386ms on a formula simplification. DAG size of input: 77 DAG size of output 63 [2018-01-24 11:44:01,115 WARN L146 SmtUtils]: Spent 2386ms on a formula simplification. DAG size of input: 73 DAG size of output 64 [2018-01-24 11:44:01,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,118 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:44:01,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,118 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-24 11:44:01,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,118 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-24 11:44:01,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,119 INFO L397 ceAbstractionStarter]: At program point L552'''(lines 552 554) the Hoare annotation is: (let ((.cse0 (store |old(#valid)| |main_#t~malloc2.base| 1)) (.cse2 (select |#length| main_~arr~2.base)) (.cse1 (* (* main_~length~2 main_~fac~2) 4)) (.cse3 (* 4 main_~length~2))) (and (<= main_~length~2 main_~i~2) (= (select |#valid| main_~arr~2.base) 1) (= |#valid| (store .cse0 |main_#t~malloc3.base| 1)) (= main_~arr2~2.offset 0) (not (= |main_#t~malloc2.base| 0)) (= 0 main_~arr~2.offset) (not (= main_~arr~2.base 0)) (= 0 |main_#t~malloc2.offset|) (= |main_#t~malloc3.offset| 0) (= (select |#length| main_~arr2~2.base) .cse1) (<= (+ (* 4 main_~i~2) main_~arr~2.offset) .cse2) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |main_#t~malloc3.base|) 0) (= 1 (select |#valid| main_~arr2~2.base)) (= .cse2 .cse3) (= (select |#length| |main_#t~malloc3.base|) .cse1) (<= 0 main_~j~2) (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2))) (not (= |main_#t~malloc3.base| 0)) (= (select |#length| |main_#t~malloc2.base|) .cse3) (not (= main_~arr2~2.base 0)))) [2018-01-24 11:44:01,119 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point L552''(lines 552 554) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L397 ceAbstractionStarter]: At program point L549'''(lines 549 551) the Hoare annotation is: (let ((.cse10 (select |#length| main_~arr~2.base)) (.cse18 (* 4 main_~length~2)) (.cse19 (* (* main_~length~2 main_~fac~2) 4)) (.cse20 (store |old(#valid)| |main_#t~malloc2.base| 1))) (let ((.cse0 (= (select |#valid| main_~arr~2.base) 1)) (.cse1 (= main_~arr2~2.offset 0)) (.cse2 (= |#valid| (store .cse20 |main_#t~malloc3.base| 1))) (.cse3 (= 0 |main_#t~malloc2.offset|)) (.cse4 (= |main_#t~malloc3.offset| 0)) (.cse5 (= (select |#length| main_~arr2~2.base) .cse19)) (.cse6 (not (= |main_#t~malloc3.base| 0))) (.cse7 (not (= |main_#t~malloc2.base| 0))) (.cse8 (= 0 main_~arr~2.offset)) (.cse9 (not (= main_~arr~2.base 0))) (.cse11 (= (select |old(#valid)| |main_#t~malloc2.base|) 0)) (.cse12 (= (select .cse20 |main_#t~malloc3.base|) 0)) (.cse13 (= 1 (select |#valid| main_~arr2~2.base))) (.cse14 (= .cse10 .cse18)) (.cse15 (= (select |#length| |main_#t~malloc3.base|) .cse19)) (.cse16 (= (select |#length| |main_#t~malloc2.base|) .cse18)) (.cse17 (not (= main_~arr2~2.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 main_~i~2) .cse6 .cse7 .cse8 .cse9 (<= (+ (* 4 main_~i~2) main_~arr~2.offset) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~2 0) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2))) .cse16 .cse17)))) [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point L549''''(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:44:01,120 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 540 556) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 540 556) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 540 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 11:44:01,121 INFO L401 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L552''''(lines 552 554) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,122 INFO L401 ceAbstractionStarter]: For program point mainErr6EnsuresViolation(lines 540 556) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L552(lines 552 554) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 11:44:01,123 INFO L401 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-24 11:44:01,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:44:01 BoogieIcfgContainer [2018-01-24 11:44:01,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:44:01,167 INFO L168 Benchmark]: Toolchain (without parser) took 13513.30 ms. Allocated memory was 307.2 MB in the beginning and 513.8 MB in the end (delta: 206.6 MB). Free memory was 264.1 MB in the beginning and 442.3 MB in the end (delta: -178.2 MB). Peak memory consumption was 147.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:01,168 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:44:01,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.21 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 254.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:01,169 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:01,169 INFO L168 Benchmark]: RCFGBuilder took 270.24 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 235.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:01,169 INFO L168 Benchmark]: TraceAbstraction took 12989.11 ms. Allocated memory was 307.2 MB in the beginning and 513.8 MB in the end (delta: 206.6 MB). Free memory was 235.2 MB in the beginning and 442.3 MB in the end (delta: -207.1 MB). Peak memory consumption was 118.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:01,171 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.21 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 254.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 270.24 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 235.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12989.11 ms. Allocated memory was 307.2 MB in the beginning and 513.8 MB in the end (delta: 206.6 MB). Free memory was 235.2 MB in the beginning and 442.3 MB in the end (delta: -207.1 MB). Peak memory consumption was 118.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] * 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 - 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 - 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 - 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 - 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 - 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant [2018-01-24 11:44:01,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((length <= i && \valid[arr] == 1) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && arr2 == 0) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && 4 * i + arr <= unknown-#length-unknown[arr]) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && 0 <= j) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0) - InvariantResult [Line: 549]: Loop Invariant [2018-01-24 11:44:01,186 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,186 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,186 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,186 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-24 11:44:01,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-24 11:44:01,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-24 11:44:01,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:01,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && 1 <= i) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && 4 * i + arr <= unknown-#length-unknown[arr]) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) || ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && i == 0) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 7 error locations. SAFE Result, 12.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 641 SDslu, 471 SDs, 0 SdLazy, 493 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 368 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1579 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 313 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 248 ConstructedInterpolants, 27 QuantifiedInterpolants, 50421 SizeOfPredicates, 33 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 17/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-44-01-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-44-01-202.csv Received shutdown request...