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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:45:45,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:45:45,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:45:45,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:45:45,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:45:45,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:45:45,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:45:45,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:45:45,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:45:45,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:45:45,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:45:45,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:45:45,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:45:45,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:45:45,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:45:45,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:45:45,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:45:45,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:45:45,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:45:45,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:45:45,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:45:45,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:45:45,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:45:45,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:45:45,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:45:45,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:45:45,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:45:45,438 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:45:45,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:45:45,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:45:45,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:45:45,439 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:45:45,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:45:45,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:45:45,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:45:45,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:45:45,449 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:45:45,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:45:45,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:45:45,450 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:45:45,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:45:45,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:45:45,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:45:45,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:45:45,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:45:45,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:45:45,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:45:45,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:45:45,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:45:45,452 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:45:45,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:45:45,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:45:45,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:45:45,494 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:45:45,497 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:45:45,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:45:45,498 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:45:45,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 00:45:45,636 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:45:45,637 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:45:45,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:45:45,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:45:45,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:45:45,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45, skipping insertion in model container [2018-02-04 00:45:45,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,656 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:45:45,691 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:45:45,771 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:45:45,786 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:45:45,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45 WrapperNode [2018-02-04 00:45:45,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:45:45,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:45:45,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:45:45,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:45:45,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... [2018-02-04 00:45:45,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:45:45,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:45:45,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:45:45,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:45:45,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 00:45:45,871 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:45:45,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:45:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:45:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 00:45:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 00:45:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:45:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:45:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:45:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:45:46,069 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:45:46,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:45:46 BoogieIcfgContainer [2018-02-04 00:45:46,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:45:46,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:45:46,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:45:46,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:45:46,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:45:45" (1/3) ... [2018-02-04 00:45:46,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a8bd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:45:46, skipping insertion in model container [2018-02-04 00:45:46,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:45:45" (2/3) ... [2018-02-04 00:45:46,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a8bd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:45:46, skipping insertion in model container [2018-02-04 00:45:46,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:45:46" (3/3) ... [2018-02-04 00:45:46,074 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 00:45:46,080 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:45:46,086 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 00:45:46,108 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:45:46,108 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:45:46,108 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:45:46,108 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:45:46,109 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:45:46,109 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:45:46,109 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:45:46,109 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:45:46,109 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:45:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 00:45:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:45:46,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:46,126 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:46,126 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-04 00:45:46,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:46,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:46,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:46,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:46,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:46,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:46,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:45:46,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:45:46,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:45:46,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:45:46,366 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-04 00:45:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:46,407 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-04 00:45:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:45:46,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:45:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:46,417 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:45:46,417 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 00:45:46,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:45:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 00:45:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 00:45:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:45:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 00:45:46,454 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-04 00:45:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:46,454 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 00:45:46,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:45:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 00:45:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:45:46,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:46,456 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:46,456 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-04 00:45:46,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:46,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:46,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:46,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:46,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:46,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:46,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:45:46,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:45:46,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:45:46,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:45:46,496 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-04 00:45:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:46,570 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 00:45:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:45:46,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:45:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:46,572 INFO L225 Difference]: With dead ends: 112 [2018-02-04 00:45:46,572 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 00:45:46,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:45:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 00:45:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-04 00:45:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 00:45:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 00:45:46,580 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-04 00:45:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:46,581 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 00:45:46,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:45:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 00:45:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:45:46,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:46,582 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:46,582 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-04 00:45:46,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:46,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:46,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:46,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:46,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:46,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:46,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:45:46,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:45:46,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:45:46,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:45:46,650 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-04 00:45:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:46,755 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 00:45:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:45:46,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:45:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:46,756 INFO L225 Difference]: With dead ends: 76 [2018-02-04 00:45:46,756 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 00:45:46,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:45:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 00:45:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-04 00:45:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 00:45:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 00:45:46,761 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-04 00:45:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:46,761 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 00:45:46,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:45:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 00:45:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:45:46,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:46,762 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:46,762 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-04 00:45:46,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:46,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:46,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:46,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:46,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:46,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:46,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:45:46,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:45:46,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:45:46,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:45:46,936 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 00:45:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:47,130 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 00:45:47,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:45:47,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 00:45:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:47,132 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:45:47,132 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:45:47,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:45:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:45:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 00:45:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:45:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 00:45:47,137 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-04 00:45:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:47,138 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 00:45:47,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:45:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 00:45:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:45:47,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:47,139 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:47,139 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:47,139 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-04 00:45:47,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:47,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:47,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,140 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:47,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:47,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:47,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:47,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:45:47,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:45:47,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:45:47,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:45:47,180 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-04 00:45:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:47,207 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 00:45:47,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:45:47,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:45:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:47,208 INFO L225 Difference]: With dead ends: 77 [2018-02-04 00:45:47,208 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 00:45:47,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:45:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 00:45:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 00:45:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:45:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 00:45:47,212 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-04 00:45:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:47,212 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 00:45:47,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:45:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 00:45:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:45:47,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:47,213 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:47,213 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-04 00:45:47,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:47,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:47,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:47,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:47,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:47,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:47,396 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:45:47,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:47,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:47,479 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 17 treesize of output 16 [2018-02-04 00:45:47,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:47,491 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 20 treesize of output 19 [2018-02-04 00:45:47,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:47,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:45:47,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:45:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:47,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:47,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 00:45:47,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 00:45:47,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 00:45:47,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:45:47,712 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-02-04 00:45:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:47,927 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 00:45:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:45:47,928 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-04 00:45:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:47,929 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:45:47,929 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 00:45:47,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:45:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 00:45:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-02-04 00:45:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:45:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 00:45:47,933 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-02-04 00:45:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:47,934 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 00:45:47,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 00:45:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 00:45:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:45:47,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:47,934 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:47,935 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-04 00:45:47,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:47,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:47,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:47,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:47,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:48,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:48,125 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:45:48,130 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:45:48,148 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:45:48,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:45:48,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:48,170 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 17 treesize of output 16 [2018-02-04 00:45:48,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:48,179 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 20 treesize of output 19 [2018-02-04 00:45:48,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:48,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:45:48,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:45:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:48,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:48,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 00:45:48,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:45:48,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:45:48,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:45:48,391 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2018-02-04 00:45:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:48,593 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 00:45:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:45:48,593 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 00:45:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:48,594 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:45:48,594 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:45:48,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:45:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:45:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 00:45:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 00:45:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 00:45:48,598 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-02-04 00:45:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:48,598 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 00:45:48,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:45:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 00:45:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:45:48,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:48,599 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2018-02-04 00:45:48,600 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times [2018-02-04 00:45:48,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:48,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:48,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,601 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:45:48,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:48,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:45:48,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:48,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:45:48,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:45:48,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:45:48,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:45:48,639 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 00:45:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:48,648 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 00:45:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:45:48,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 00:45:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:48,649 INFO L225 Difference]: With dead ends: 83 [2018-02-04 00:45:48,649 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 00:45:48,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:45:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 00:45:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 00:45:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:45:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 00:45:48,652 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-02-04 00:45:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:48,653 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 00:45:48,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:45:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 00:45:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:45:48,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:48,654 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1] [2018-02-04 00:45:48,654 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times [2018-02-04 00:45:48,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:48,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:48,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:48,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:48,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:45:48,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:45:48,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:45:48,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:45:48,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:45:48,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:45:48,691 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-04 00:45:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:48,803 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-04 00:45:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:45:48,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 00:45:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:48,804 INFO L225 Difference]: With dead ends: 123 [2018-02-04 00:45:48,804 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 00:45:48,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:45:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 00:45:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-02-04 00:45:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 00:45:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-04 00:45:48,808 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39 [2018-02-04 00:45:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:48,808 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-04 00:45:48,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:45:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-04 00:45:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:45:48,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:48,808 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1] [2018-02-04 00:45:48,809 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times [2018-02-04 00:45:48,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:48,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:48,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:48,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:48,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:48,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:48,838 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:45:48,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:48,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:48,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:48,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 00:45:48,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:45:48,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:45:48,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:45:48,900 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2018-02-04 00:45:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:48,919 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 00:45:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:45:48,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 00:45:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:48,924 INFO L225 Difference]: With dead ends: 112 [2018-02-04 00:45:48,924 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:45:48,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:45:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:45:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 00:45:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 00:45:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-04 00:45:48,929 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-04 00:45:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:48,929 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-04 00:45:48,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:45:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-04 00:45:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:45:48,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:48,930 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:48,930 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times [2018-02-04 00:45:48,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:48,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:48,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:48,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:48,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:48,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:48,970 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:45:48,975 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:45:48,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 00:45:48,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:45:48,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:45:49,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:45:49,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 00:45:49,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:45:49,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:45:49,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:45:49,043 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states. [2018-02-04 00:45:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:49,136 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 00:45:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:45:49,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 00:45:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:49,137 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:45:49,137 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 00:45:49,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:45:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 00:45:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-02-04 00:45:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 00:45:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 00:45:49,139 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2018-02-04 00:45:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:49,140 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 00:45:49,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:45:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 00:45:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:45:49,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:49,140 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:49,141 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times [2018-02-04 00:45:49,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:49,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:49,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:45:49,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:49,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:45:49,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:49,202 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:45:49,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:49,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:49,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:49,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 00:45:49,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:45:49,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:45:49,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:45:49,290 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states. [2018-02-04 00:45:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:49,336 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-02-04 00:45:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:45:49,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 00:45:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:49,338 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:45:49,338 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 00:45:49,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:45:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 00:45:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 00:45:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 00:45:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 00:45:49,342 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48 [2018-02-04 00:45:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:49,342 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 00:45:49,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:45:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 00:45:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:45:49,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:49,343 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:49,343 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times [2018-02-04 00:45:49,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:49,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:49,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,345 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:45:49,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:49,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:45:49,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:49,406 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:45:49,414 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:45:49,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:45:49,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:45:49,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:45:49,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:49,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 00:45:49,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:45:49,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:45:49,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:45:49,506 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 00:45:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:45:49,541 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-02-04 00:45:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:45:49,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 00:45:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:45:49,544 INFO L225 Difference]: With dead ends: 123 [2018-02-04 00:45:49,544 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 00:45:49,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:45:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 00:45:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-04 00:45:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 00:45:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-02-04 00:45:49,548 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52 [2018-02-04 00:45:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:45:49,549 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-02-04 00:45:49,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:45:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-02-04 00:45:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:45:49,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:45:49,550 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:45:49,550 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:45:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times [2018-02-04 00:45:49,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:45:49,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:45:49,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,551 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:45:49,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:45:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:45:49,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:45:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:45:49,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:45:49,625 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:45:49,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:45:49,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:45:49,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:45:49,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:45:49,657 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 26 treesize of output 25 [2018-02-04 00:45:49,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,670 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 23 treesize of output 22 [2018-02-04 00:45:49,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,683 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 22 treesize of output 21 [2018-02-04 00:45:49,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,684 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 25 treesize of output 24 [2018-02-04 00:45:49,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:45:49,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:45:49,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:45:49,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:45:49,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 00:45:49,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:45:49,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:45:49,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-02-04 00:45:49,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:45:49,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-02-04 00:45:49,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 00:45:49,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:49,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:45:49,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 00:45:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 00:45:49,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:49,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 00:45:49,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:45:49,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:45:49,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 00:45:49,991 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states. [2018-02-04 00:46:12,571 WARN L143 SmtUtils]: Spent 14133ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 00:46:34,747 WARN L146 SmtUtils]: Spent 22112ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 00:46:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:46:35,000 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2018-02-04 00:46:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:46:35,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 00:46:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:46:35,001 INFO L225 Difference]: With dead ends: 197 [2018-02-04 00:46:35,001 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 00:46:35,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 00:46:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 00:46:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-02-04 00:46:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 00:46:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 00:46:35,005 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56 [2018-02-04 00:46:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:46:35,006 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 00:46:35,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:46:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 00:46:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:46:35,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:46:35,006 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:46:35,006 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:46:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times [2018-02-04 00:46:35,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:46:35,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:46:35,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,007 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:46:35,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:35,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:46:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:46:35,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:46:35,080 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:46:35,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:46:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:35,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:46:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:46:35,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:46:35,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 00:46:35,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:46:35,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:46:35,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:46:35,231 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states. [2018-02-04 00:46:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:46:35,276 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 00:46:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:46:35,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 00:46:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:46:35,277 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:46:35,278 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 00:46:35,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:46:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 00:46:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 00:46:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 00:46:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 00:46:35,281 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60 [2018-02-04 00:46:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:46:35,281 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 00:46:35,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:46:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 00:46:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 00:46:35,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:46:35,281 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:46:35,281 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:46:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times [2018-02-04 00:46:35,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:46:35,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:46:35,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:46:35,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:35,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:46:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:46:35,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:46:35,359 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:46:35,364 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:46:35,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:46:35,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:46:35,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:46:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:46:35,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:46:35,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 00:46:35,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:46:35,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:46:35,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:46:35,488 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states. [2018-02-04 00:46:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:46:35,546 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-04 00:46:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:46:35,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 00:46:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:46:35,548 INFO L225 Difference]: With dead ends: 150 [2018-02-04 00:46:35,548 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 00:46:35,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:46:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 00:46:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 00:46:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 00:46:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-04 00:46:35,552 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64 [2018-02-04 00:46:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:46:35,552 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-04 00:46:35,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:46:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-04 00:46:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 00:46:35,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:46:35,553 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:46:35,553 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:46:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times [2018-02-04 00:46:35,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:46:35,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:46:35,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,554 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:46:35,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:35,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:46:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:46:35,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:46:35,658 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:46:35,663 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:46:35,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:46:35,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:46:35,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:46:35,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:46:35,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:46:35,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:46:35,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:46:35,741 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 00:46:35,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:46:35,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:46:35,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:46:35,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 00:46:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-02-04 00:46:35,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:46:35,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-02-04 00:46:35,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:46:35,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:46:35,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420 [2018-02-04 00:46:35,778 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 21 states. [2018-02-04 00:46:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:46:36,140 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2018-02-04 00:46:36,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:46:36,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-02-04 00:46:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:46:36,141 INFO L225 Difference]: With dead ends: 175 [2018-02-04 00:46:36,141 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 00:46:36,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=1138, Unknown=2, NotChecked=72, Total=1482 [2018-02-04 00:46:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 00:46:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2018-02-04 00:46:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 00:46:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-04 00:46:36,145 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68 [2018-02-04 00:46:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:46:36,145 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-04 00:46:36,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:46:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-04 00:46:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:46:36,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:46:36,146 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1] [2018-02-04 00:46:36,146 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:46:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-04 00:46:36,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:46:36,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:46:36,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:36,147 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:46:36,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:36,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:46:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 00:46:36,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:46:36,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:46:36,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:46:36,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:46:36,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:46:36,215 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-04 00:46:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:46:36,231 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 00:46:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:46:36,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 00:46:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:46:36,232 INFO L225 Difference]: With dead ends: 155 [2018-02-04 00:46:36,232 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 00:46:36,232 INFO L554 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-02-04 00:46:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 00:46:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-04 00:46:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 00:46:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-04 00:46:36,235 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-04 00:46:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:46:36,235 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-04 00:46:36,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:46:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-04 00:46:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 00:46:36,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:46:36,236 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:46:36,236 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:46:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-04 00:46:36,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:46:36,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:46:36,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:36,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:46:36,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:46:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:36,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:46:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 00:46:36,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:46:36,392 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:46:36,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:46:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:46:36,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:46:36,436 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 17 treesize of output 16 [2018-02-04 00:46:36,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:46:36,449 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 14 treesize of output 13 [2018-02-04 00:46:36,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:46:36,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:46:36,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 00:46:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:46:42,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:46:42,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-04 00:46:42,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:46:42,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:46:42,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=816, Unknown=2, NotChecked=0, Total=930 [2018-02-04 00:46:42,032 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 31 states. [2018-02-04 00:47:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:47:36,729 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-04 00:47:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:47:36,729 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-04 00:47:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:47:36,730 INFO L225 Difference]: With dead ends: 170 [2018-02-04 00:47:36,730 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 00:47:36,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=544, Invalid=2992, Unknown=4, NotChecked=0, Total=3540 [2018-02-04 00:47:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 00:47:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2018-02-04 00:47:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 00:47:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-04 00:47:36,734 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-04 00:47:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:47:36,734 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-04 00:47:36,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:47:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-04 00:47:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 00:47:36,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:47:36,735 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:47:36,735 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:47:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-04 00:47:36,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:47:36,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:47:36,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:47:36,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:47:36,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:47:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:47:36,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:47:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:47:37,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:47:37,584 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:47:37,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:47:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:47:37,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:47:37,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:47:37,652 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 12 treesize of output 11 [2018-02-04 00:47:37,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-04 00:47:37,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 00:47:37,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 00:47:37,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 00:47:37,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-04 00:47:37,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-02-04 00:47:37,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 00:47:37,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-04 00:47:37,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-04 00:47:37,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:37,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 00:47:37,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-04 00:47:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:37,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-02-04 00:47:37,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:37,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:37,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 00:47:38,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-02-04 00:47:38,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-02-04 00:47:38,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:38,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-04 00:47:38,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-02-04 00:47:38,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-02-04 00:47:38,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:38,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-04 00:47:38,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-02-04 00:47:38,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:38,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-02-04 00:47:38,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:38,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:38,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-04 00:47:39,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-02-04 00:47:39,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:39,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-02-04 00:47:39,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:39,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:39,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:39,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-04 00:47:51,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2018-02-04 00:47:51,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:47:51,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 591 [2018-02-04 00:47:51,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:47:51,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:47:51,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 00:47:51,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 [2018-02-04 00:48:23,110 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 00:48:23,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-02-04 00:48:23,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:48:23,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 324 [2018-02-04 00:48:23,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:48:23,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:48:23,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:48:23,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:132, output treesize:3 [2018-02-04 00:48:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 105 proven. 97 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:48:23,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:48:23,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-02-04 00:48:23,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 00:48:23,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 00:48:23,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1853, Unknown=18, NotChecked=0, Total=2256 [2018-02-04 00:48:23,503 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 48 states. Received shutdown request... [2018-02-04 00:49:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:49:28,051 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:49:28,054 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:49:28,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:49:28 BoogieIcfgContainer [2018-02-04 00:49:28,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:49:28,055 INFO L168 Benchmark]: Toolchain (without parser) took 222418.87 ms. Allocated memory was 399.5 MB in the beginning and 692.6 MB in the end (delta: 293.1 MB). Free memory was 353.5 MB in the beginning and 613.9 MB in the end (delta: -260.4 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. [2018-02-04 00:49:28,056 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:49:28,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.31 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 340.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:49:28,056 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 ms. Allocated memory is still 399.5 MB. Free memory was 340.2 MB in the beginning and 338.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:49:28,056 INFO L168 Benchmark]: RCFGBuilder took 245.64 ms. Allocated memory is still 399.5 MB. Free memory was 338.9 MB in the beginning and 313.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:49:28,057 INFO L168 Benchmark]: TraceAbstraction took 221985.22 ms. Allocated memory was 399.5 MB in the beginning and 692.6 MB in the end (delta: 293.1 MB). Free memory was 313.6 MB in the beginning and 613.9 MB in the end (delta: -300.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:49:28,058 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.31 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 340.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.96 ms. Allocated memory is still 399.5 MB. Free memory was 340.2 MB in the beginning and 338.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 245.64 ms. Allocated memory is still 399.5 MB. Free memory was 338.9 MB in the beginning and 313.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 221985.22 ms. Allocated memory was 399.5 MB in the beginning and 692.6 MB in the end (delta: 293.1 MB). Free memory was 313.6 MB in the beginning and 613.9 MB in the end (delta: -300.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 221.9s OverallTime, 20 OverallIterations, 11 TraceHistogramMax, 166.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1362 SDtfs, 1106 SDslu, 7927 SDs, 0 SdLazy, 4697 SolverSat, 270 SolverUnsat, 65 SolverUnknown, 0 SolverNotchecked, 95.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 558 SyntacticMatches, 15 SemanticMatches, 365 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 119.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=19, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 203 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 54.8s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1495 ConstructedInterpolants, 109 QuantifiedInterpolants, 946508 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2020 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 1116/2274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-49-28-064.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-49-28-064.csv Completed graceful shutdown