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/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:39:39,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:39:39,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:39:39,438 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:39:39,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:39:39,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:39:39,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:39:39,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:39:39,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:39:39,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:39:39,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:39:39,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:39:39,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:39:39,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:39:39,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:39:39,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:39:39,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:39:39,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:39:39,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:39:39,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:39:39,460 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:39:39,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:39:39,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:39:39,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:39:39,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:39:39,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:39:39,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:39:39,465 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:39:39,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:39:39,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:39:39,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:39:39,466 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:39:39,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:39:39,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:39:39,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:39:39,475 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:39:39,475 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:39:39,476 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:39:39,476 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:39:39,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:39:39,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:39:39,476 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:39:39,477 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:39:39,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:39:39,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:39:39,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:39:39,478 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:39:39,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:39:39,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:39:39,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:39:39,479 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:39:39,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:39:39,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:39:39,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:39:39,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:39:39,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:39:39,480 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:39:39,480 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:39:39,480 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:39:39,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:39:39,524 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:39:39,527 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:39:39,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:39:39,529 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:39:39,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:39:39,700 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:39:39,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:39:39,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:39,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:39:39,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:39:39,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39, skipping insertion in model container [2018-01-24 11:39:39,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,730 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:39,766 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:39:39,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:39,908 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:39:39,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39 WrapperNode [2018-01-24 11:39:39,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:39:39,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:39:39,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:39:39,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:39:39,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (1/1) ... [2018-01-24 11:39:39,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:39:39,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:39:39,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:39:39,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:39:39,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (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:39:39,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:39:39,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:39:39,996 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:39:39,996 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:39:39,996 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:39:39,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:39:39,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:39:40,215 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:39:40,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:40 BoogieIcfgContainer [2018-01-24 11:39:40,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:39:40,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:39:40,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:39:40,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:39:40,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:39:39" (1/3) ... [2018-01-24 11:39:40,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696dce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:40, skipping insertion in model container [2018-01-24 11:39:40,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:39:39" (2/3) ... [2018-01-24 11:39:40,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696dce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:39:40, skipping insertion in model container [2018-01-24 11:39:40,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:39:40" (3/3) ... [2018-01-24 11:39:40,221 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:39:40,228 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:39:40,234 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 11:39:40,279 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:39:40,279 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:39:40,279 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:39:40,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:39:40,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:39:40,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:39:40,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:39:40,280 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:39:40,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:39:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-24 11:39:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:39:40,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:40,304 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:40,304 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-01-24 11:39:40,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:40,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:40,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:40,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:40,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:40,492 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:39:40,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:40,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:39:40,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:40,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:40,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:40,514 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-01-24 11:39:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:40,683 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-01-24 11:39:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:40,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:39:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:40,728 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:39:40,729 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 11:39:40,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:39:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 11:39:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 11:39:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 11:39:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-24 11:39:40,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-01-24 11:39:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:40,759 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-24 11:39:40,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-24 11:39:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:39:40,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:40,760 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:40,760 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-01-24 11:39:40,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:40,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:40,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:40,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:40,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:40,838 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:39:40,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:40,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:39:40,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:40,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:40,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:40,841 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-01-24 11:39:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:40,905 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-24 11:39:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:39:40,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:39:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:40,907 INFO L225 Difference]: With dead ends: 39 [2018-01-24 11:39:40,907 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:39:40,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:39:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:39:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:39:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:39:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-24 11:39:40,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-01-24 11:39:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:40,915 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-24 11:39:40,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-24 11:39:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:39:40,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:40,916 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:40,916 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-01-24 11:39:40,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:40,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:40,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:40,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:40,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:41,171 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:39:41,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:41,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:39:41,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:39:41,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:39:41,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:39:41,173 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-01-24 11:39:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:41,354 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-24 11:39:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:39:41,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 11:39:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:41,355 INFO L225 Difference]: With dead ends: 60 [2018-01-24 11:39:41,356 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:39:41,356 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:39:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:39:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 11:39:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 11:39:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-24 11:39:41,362 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-01-24 11:39:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:41,362 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-24 11:39:41,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:39:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-24 11:39:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:39:41,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:41,363 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:41,363 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-01-24 11:39:41,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:41,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:41,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:41,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:41,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:41,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:41,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:41,423 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:39:41,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:41,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:41,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:39:41,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-24 11:39:41,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:39:41,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:39:41,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:39:41,508 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-01-24 11:39:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:41,578 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 11:39:41,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:39:41,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 11:39:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:41,580 INFO L225 Difference]: With dead ends: 93 [2018-01-24 11:39:41,580 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:39:41,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:39:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:39:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-01-24 11:39:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:39:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 11:39:41,589 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-01-24 11:39:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:41,590 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 11:39:41,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:39:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 11:39:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:39:41,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:41,591 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:41,591 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-01-24 11:39:41,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:41,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:41,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:41,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:41,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:41,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:41,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:41,784 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:39:41,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:41,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:41,832 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:39:41,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:39:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:39:41,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 11:39:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:41,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:39:41,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-24 11:39:41,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:39:41,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:39:41,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:39:41,902 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2018-01-24 11:39:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:42,038 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 11:39:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:39:42,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 11:39:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:42,039 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:39:42,039 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:39:42,040 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:39:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:39:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 11:39:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:39:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 11:39:42,048 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-01-24 11:39:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:42,048 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 11:39:42,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:39:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 11:39:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:39:42,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:42,050 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] [2018-01-24 11:39:42,050 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-01-24 11:39:42,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:42,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:42,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:42,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:42,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:42,247 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:39:42,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:42,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:39:42,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:39:42,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:39:42,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:39:42,248 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2018-01-24 11:39:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:42,444 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-01-24 11:39:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:39:42,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 11:39:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:42,445 INFO L225 Difference]: With dead ends: 66 [2018-01-24 11:39:42,445 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 11:39:42,446 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:39:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 11:39:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-01-24 11:39:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:39:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 11:39:42,453 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2018-01-24 11:39:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:42,454 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 11:39:42,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:39:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 11:39:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:39:42,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:42,455 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] [2018-01-24 11:39:42,455 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:42,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1312069626, now seen corresponding path program 1 times [2018-01-24 11:39:42,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:42,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:42,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:42,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:42,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:42,494 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:39:42,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:42,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:39:42,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:42,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:42,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:42,496 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-24 11:39:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:42,535 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-24 11:39:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:39:42,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-24 11:39:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:42,537 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:39:42,537 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 11:39:42,537 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 11:39:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-01-24 11:39:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:39:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 11:39:42,547 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 24 [2018-01-24 11:39:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:42,547 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 11:39:42,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 11:39:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:39:42,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:42,548 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:42,549 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-01-24 11:39:42,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:42,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:42,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:42,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:42,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:42,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:42,762 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:39:42,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:42,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:39:42,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:39:42,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-01-24 11:39:42,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:39:42,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:39:42,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:39:42,848 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-01-24 11:39:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:43,142 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 11:39:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:39:43,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-01-24 11:39:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:43,143 INFO L225 Difference]: With dead ends: 91 [2018-01-24 11:39:43,144 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 11:39:43,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:39:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 11:39:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-24 11:39:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 11:39:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 11:39:43,156 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-24 11:39:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:43,157 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 11:39:43,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:39:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 11:39:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:39:43,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:43,158 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:43,158 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-01-24 11:39:43,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:43,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:43,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:43,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:43,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:43,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:43,322 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:39:43,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:43,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:43,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:39:43,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-01-24 11:39:43,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:39:43,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:39:43,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:39:43,436 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-01-24 11:39:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:43,731 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-24 11:39:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:39:43,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 11:39:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:43,732 INFO L225 Difference]: With dead ends: 112 [2018-01-24 11:39:43,732 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 11:39:43,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:39:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 11:39:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-01-24 11:39:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 11:39:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-01-24 11:39:43,742 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-01-24 11:39:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:43,743 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-01-24 11:39:43,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:39:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-01-24 11:39:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:39:43,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:43,744 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:43,744 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-01-24 11:39:43,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:43,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:43,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:43,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:43,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 11:39:43,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:39:43,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:39:43,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:39:43,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:39:43,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:39:43,828 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2018-01-24 11:39:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:43,871 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 11:39:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:39:43,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 11:39:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:43,873 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:39:43,873 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:39:43,874 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:39:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:39:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 11:39:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 11:39:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-24 11:39:43,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-01-24 11:39:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:43,881 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-24 11:39:43,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:39:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-24 11:39:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:39:43,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:39:43,882 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:39:43,882 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 11:39:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-01-24 11:39:43,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:39:43,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:39:43,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:39:43,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:39:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:39:43,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:39:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 11:39:44,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:39:44,004 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:39:44,013 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:39:44,024 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:39:44,031 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:39:44,032 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:39:44,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:39:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:39:44,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:39:44,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-01-24 11:39:44,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:39:44,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:39:44,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:39:44,231 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 15 states. [2018-01-24 11:39:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:39:44,617 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-01-24 11:39:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:39:44,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-24 11:39:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:39:44,618 INFO L225 Difference]: With dead ends: 58 [2018-01-24 11:39:44,619 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:39:44,619 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:39:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:39:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:39:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:39:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:39:44,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-01-24 11:39:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:39:44,621 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:39:44,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:39:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:39:44,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:39:44,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:39:44,962 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 62 DAG size of output 38 [2018-01-24 11:39:45,168 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 80 DAG size of output 43 [2018-01-24 11:39:45,378 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 77 DAG size of output 45 [2018-01-24 11:39:45,384 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,385 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:45,385 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,385 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 11:39:45,385 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,385 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 11:39:45,385 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 553) no Hoare annotation was computed. [2018-01-24 11:39:45,386 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L397 ceAbstractionStarter]: At program point L555'''(lines 555 557) the Hoare annotation is: (let ((.cse6 (* 4 main_~length~2)) (.cse2 (select |#length| main_~arr~2.base))) (let ((.cse0 (and (<= main_~length~2 main_~i~2) (not (= 0 main_~arr~2.base)) (= 1 (select |#valid| main_~arr~2.base)) (= main_~arr~2.offset 0) (<= 1 main_~length~2) (= 0 |main_#t~malloc1.offset|) (= .cse6 .cse2) (not (= 0 |main_#t~malloc1.base|)) (= 1 (select |#valid| |main_#t~malloc1.base|)))) (.cse3 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse4 (<= (+ (* 4 main_~i~2) main_~arr~2.offset) .cse2)) (.cse5 (= .cse6 (select |#length| |main_#t~malloc1.base|)))) (or (let ((.cse1 (* 4 main_~j~2))) (and .cse0 (<= 4 (+ main_~arr~2.offset .cse1)) (<= (+ main_~arr~2.offset .cse1 4) .cse2) .cse3 .cse4 .cse5)) (and .cse0 .cse3 (= main_~j~2 0) .cse4 .cse5)))) [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-24 11:39:45,387 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:39:45,387 INFO L401 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,388 INFO L397 ceAbstractionStarter]: At program point L554'''(lines 554 558) the Hoare annotation is: (let ((.cse6 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse5 (* 4 main_~length~2)) (.cse7 (select |#length| main_~arr~2.base))) (let ((.cse0 (and (<= main_~length~2 main_~i~2) (not (= 0 main_~arr~2.base)) (= 1 (select |#valid| main_~arr~2.base)) (= main_~arr~2.offset 0) (= 0 |main_#t~malloc1.offset|) (= .cse5 .cse7) (not (= 0 |main_#t~malloc1.base|)) (= 1 (select |#valid| |main_#t~malloc1.base|)))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= 4 .cse6)) (.cse3 (<= .cse6 .cse7)) (.cse4 (= .cse5 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 (<= 4 (+ main_~arr~2.offset (* 4 main_~j~2))) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= main_~j~2 0) .cse3 .cse4)))) [2018-01-24 11:39:45,388 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 11:39:45,388 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 11:39:45,388 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:39:45,388 INFO L397 ceAbstractionStarter]: At program point L547''(lines 547 553) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2)) (.cse4 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse5 (= .cse11 .cse4)) (.cse6 (not (= 0 |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (let ((.cse3 (+ (* 4 main_~i~2) main_~arr~2.offset))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 (<= 4 .cse3) .cse9 .cse10)) (and .cse0 .cse1 .cse2 (<= 1 main_~length~2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= main_~i~2 0))))) [2018-01-24 11:39:45,388 INFO L401 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,388 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L547'''(lines 547 553) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 11:39:45,389 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 11:39:45,390 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-24 11:39:45,390 INFO L401 ceAbstractionStarter]: For program point L554''''(lines 554 558) no Hoare annotation was computed. [2018-01-24 11:39:45,390 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 11:39:45,390 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 11:39:45,390 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 11:39:45,399 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,410 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,419 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:39:45 BoogieIcfgContainer [2018-01-24 11:39:45,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:39:45,428 INFO L168 Benchmark]: Toolchain (without parser) took 5727.27 ms. Allocated memory was 306.2 MB in the beginning and 540.0 MB in the end (delta: 233.8 MB). Free memory was 266.1 MB in the beginning and 477.4 MB in the end (delta: -211.3 MB). Peak memory consumption was 154.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:45,430 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:39:45,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.73 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:45,430 INFO L168 Benchmark]: Boogie Preprocessor took 29.41 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-24 11:39:45,431 INFO L168 Benchmark]: RCFGBuilder took 269.30 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 237.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:45,431 INFO L168 Benchmark]: TraceAbstraction took 5211.24 ms. Allocated memory was 306.2 MB in the beginning and 540.0 MB in the end (delta: 233.8 MB). Free memory was 236.0 MB in the beginning and 477.4 MB in the end (delta: -241.4 MB). Peak memory consumption was 124.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:39:45,433 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.17 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.73 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.41 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 269.30 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 237.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5211.24 ms. Allocated memory was 306.2 MB in the beginning and 540.0 MB in the end (delta: 233.8 MB). Free memory was 236.0 MB in the beginning and 477.4 MB in the end (delta: -241.4 MB). Peak memory consumption was 124.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 11:39:45,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 1 <= length) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - InvariantResult [Line: 554]: Loop Invariant [2018-01-24 11:39:45,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((length <= i && !(0 == arr)) && 1 == \valid[arr]) && arr == 0) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 4 <= arr + 4 * j) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 <= 4 * i + arr) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((length <= i && !(0 == arr)) && 1 == \valid[arr]) && arr == 0) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 <= 4 * i + arr) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 555]: Loop Invariant [2018-01-24 11:39:45,452 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,452 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,452 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,452 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,452 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:39:45,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((length <= i && !(0 == arr)) && 1 == \valid[arr]) && arr == 0) && 1 <= length) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 4 <= arr + 4 * j) && arr + 4 * j + 4 <= unknown-#length-unknown[arr]) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((length <= i && !(0 == arr)) && 1 == \valid[arr]) && arr == 0) && 1 <= length) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 5.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 306 SDtfs, 1287 SDslu, 739 SDs, 0 SdLazy, 721 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 405 HoareAnnotationTreeSize, 7 FomulaSimplifications, 360 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1892 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 355 ConstructedInterpolants, 16 QuantifiedInterpolants, 58925 SizeOfPredicates, 12 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 47/74 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-39-45-461.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-39-45-461.csv Received shutdown request...