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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:06:58,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:06:58,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:06:58,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:06:58,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:06:58,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:06:58,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:06:58,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:06:58,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:06:58,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:06:58,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:06:58,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:06:58,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:06:58,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:06:58,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:06:58,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:06:58,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:06:58,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:06:58,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:06:58,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:06:58,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:06:58,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:06:58,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:06:58,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:06:58,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:06:58,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:06:58,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:06:58,570 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:06:58,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:06:58,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:06:58,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:06:58,571 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:06:58,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:06:58,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:06:58,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:06:58,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:06:58,582 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:06:58,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:06:58,582 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:06:58,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:06:58,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:06:58,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:06:58,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:06:58,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:06:58,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:06:58,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:06:58,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:06:58,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:06:58,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:06:58,585 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:06:58,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:06:58,585 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:06:58,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:06:58,623 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:06:58,626 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:06:58,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:06:58,630 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:06:58,630 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_false-valid-memtrack.i [2018-02-02 21:06:58,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:06:58,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:06:58,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:58,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:06:58,773 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:06:58,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58, skipping insertion in model container [2018-02-02 21:06:58,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,790 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:58,826 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:58,914 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:58,926 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:58,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58 WrapperNode [2018-02-02 21:06:58,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:58,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:06:58,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:06:58,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:06:58,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (1/1) ... [2018-02-02 21:06:58,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:06:58,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:06:58,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:06:58,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:06:58,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (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-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:06:58,996 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:06:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:06:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:06:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:06:58,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:06:59,194 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:06:59,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:59 BoogieIcfgContainer [2018-02-02 21:06:59,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:06:59,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:06:59,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:06:59,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:06:59,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:06:58" (1/3) ... [2018-02-02 21:06:59,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cac531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:59, skipping insertion in model container [2018-02-02 21:06:59,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:58" (2/3) ... [2018-02-02 21:06:59,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cac531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:59, skipping insertion in model container [2018-02-02 21:06:59,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:59" (3/3) ... [2018-02-02 21:06:59,198 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 21:06:59,204 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:06:59,209 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 21:06:59,235 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:06:59,236 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:06:59,236 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:06:59,236 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:06:59,236 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:06:59,236 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:06:59,236 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:06:59,236 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:06:59,236 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:06:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 21:06:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:59,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:59,251 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:59,252 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]=== [2018-02-02 21:06:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 21:06:59,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:59,256 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:59,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:59,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:59,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:59,397 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-02 21:06:59,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:59,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:06:59,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:06:59,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:06:59,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:59,409 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 21:06:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:59,575 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 21:06:59,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:06:59,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 21:06:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:59,585 INFO L225 Difference]: With dead ends: 121 [2018-02-02 21:06:59,586 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:06:59,587 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-02 21:06:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:06:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 21:06:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 21:06:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 21:06:59,624 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 21:06:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:59,624 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 21:06:59,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:06:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 21:06:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:59,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:59,626 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:59,626 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]=== [2018-02-02 21:06:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 21:06:59,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:59,626 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:59,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:59,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:59,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:59,687 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-02 21:06:59,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:59,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:59,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:59,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:59,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:59,689 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 21:06:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:59,707 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 21:06:59,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:59,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:06:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:59,709 INFO L225 Difference]: With dead ends: 94 [2018-02-02 21:06:59,709 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 21:06:59,709 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-02 21:06:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 21:06:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 21:06:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 21:06:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 21:06:59,714 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 21:06:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:59,714 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 21:06:59,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 21:06:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:59,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:59,715 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-02 21:06:59,715 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]=== [2018-02-02 21:06:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 21:06:59,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:59,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:59,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:59,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:59,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:59,768 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-02 21:06:59,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:59,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:06:59,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:59,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:59,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:59,770 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 21:06:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:59,797 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 21:06:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:59,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:06:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:59,798 INFO L225 Difference]: With dead ends: 72 [2018-02-02 21:06:59,798 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 21:06:59,799 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-02 21:06:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 21:06:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 21:06:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 21:06:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 21:06:59,802 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 21:06:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:59,803 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 21:06:59,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 21:06:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:59,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:59,804 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-02 21:06:59,804 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]=== [2018-02-02 21:06:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 21:06:59,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:59,804 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:59,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:59,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:59,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:59,858 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-02 21:06:59,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:59,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:59,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:59,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:59,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:59,860 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 21:06:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:59,943 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 21:06:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:59,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:06:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:59,944 INFO L225 Difference]: With dead ends: 71 [2018-02-02 21:06:59,944 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 21:06:59,944 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-02 21:06:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 21:06:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 21:06:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 21:06:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 21:06:59,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 21:06:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:59,950 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 21:06:59,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 21:06:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:59,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:59,951 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-02 21:06:59,951 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]=== [2018-02-02 21:06:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 21:06:59,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:59,952 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:59,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:59,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:59,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:00,147 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-02 21:07:00,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:07:00,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:07:00,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:07:00,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:07:00,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:07:00,149 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 21:07:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:00,311 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 21:07:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:07:00,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 21:07:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:00,312 INFO L225 Difference]: With dead ends: 75 [2018-02-02 21:07:00,312 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 21:07:00,313 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-02 21:07:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 21:07:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 21:07:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 21:07:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 21:07:00,316 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 21:07:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:00,316 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 21:07:00,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:07:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 21:07:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:07:00,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:00,317 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-02 21:07:00,317 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]=== [2018-02-02 21:07:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 21:07:00,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:00,317 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:00,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:00,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:00,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:00,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:00,552 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-02 21:07:00,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:00,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:00,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:00,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:00,644 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-02 21:07:00,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:00,661 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-02 21:07:00,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:00,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:07:00,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:07:00,966 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-02 21:07:00,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:00,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-02 21:07:00,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:07:00,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:07:00,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:07:00,968 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 19 states. [2018-02-02 21:07:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:01,410 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 21:07:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:07:01,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-02 21:07:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:01,410 INFO L225 Difference]: With dead ends: 79 [2018-02-02 21:07:01,411 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 21:07:01,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:07:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 21:07:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-02 21:07:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 21:07:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-02 21:07:01,414 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-02 21:07:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:01,414 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-02 21:07:01,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:07:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-02 21:07:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:07:01,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:01,415 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-02 21:07:01,415 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]=== [2018-02-02 21:07:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 21:07:01,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:01,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:01,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:01,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:01,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:01,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:01,700 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-02 21:07:01,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:01,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:01,701 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:07:01,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:07:01,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:01,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:01,744 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-02 21:07:01,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:01,756 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-02 21:07:01,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:01,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:07:01,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:07:01,939 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-02 21:07:01,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:01,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-02 21:07:01,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:07:01,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:07:01,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:07:01,940 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 23 states. [2018-02-02 21:07:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:02,180 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-02-02 21:07:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:07:02,180 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-02 21:07:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:02,180 INFO L225 Difference]: With dead ends: 78 [2018-02-02 21:07:02,181 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 21:07:02,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:07:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 21:07:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-02 21:07:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 21:07:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 21:07:02,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 27 [2018-02-02 21:07:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:02,184 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 21:07:02,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:07:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 21:07:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:07:02,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:02,185 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-02 21:07:02,185 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]=== [2018-02-02 21:07:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1687246701, now seen corresponding path program 1 times [2018-02-02 21:07:02,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:02,185 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:02,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,186 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:02,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:02,228 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-02 21:07:02,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:07:02,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:07:02,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:07:02,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:07:02,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:07:02,230 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 5 states. [2018-02-02 21:07:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:02,242 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-02 21:07:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:07:02,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 21:07:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:02,244 INFO L225 Difference]: With dead ends: 80 [2018-02-02 21:07:02,244 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 21:07:02,244 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-02 21:07:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 21:07:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-02 21:07:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 21:07:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-02 21:07:02,248 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 38 [2018-02-02 21:07:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:02,248 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-02 21:07:02,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:07:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-02 21:07:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 21:07:02,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:02,250 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-02 21:07:02,250 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]=== [2018-02-02 21:07:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207588, now seen corresponding path program 1 times [2018-02-02 21:07:02,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:02,250 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:02,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:02,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:02,295 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-02 21:07:02,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:07:02,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:07:02,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:07:02,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:07:02,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:07:02,296 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2018-02-02 21:07:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:02,391 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 21:07:02,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:07:02,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 21:07:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:02,393 INFO L225 Difference]: With dead ends: 120 [2018-02-02 21:07:02,393 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 21:07:02,393 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-02 21:07:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 21:07:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-02 21:07:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 21:07:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-02 21:07:02,398 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 39 [2018-02-02 21:07:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:02,406 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-02 21:07:02,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:07:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-02 21:07:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 21:07:02,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:02,407 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-02 21:07:02,407 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]=== [2018-02-02 21:07:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 1 times [2018-02-02 21:07:02,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:02,408 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:02,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:02,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:02,481 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-02 21:07:02,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:02,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:02,483 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:02,602 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-02 21:07:02,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:02,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-02 21:07:02,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:07:02,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:07:02,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:07:02,603 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 9 states. [2018-02-02 21:07:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:02,654 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-02 21:07:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:07:02,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 21:07:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:02,655 INFO L225 Difference]: With dead ends: 108 [2018-02-02 21:07:02,655 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 21:07:02,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:07:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 21:07:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 21:07:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 21:07:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 21:07:02,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-02 21:07:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:02,660 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 21:07:02,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:07:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 21:07:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:07:02,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:02,661 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-02 21:07:02,661 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]=== [2018-02-02 21:07:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 2 times [2018-02-02 21:07:02,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:02,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:02,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:02,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:02,811 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-02 21:07:02,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:02,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:02,812 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:07:02,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:07:02,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:02,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:02,840 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-02 21:07:02,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:07:02,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-02 21:07:02,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:07:02,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:07:02,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:07:02,842 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2018-02-02 21:07:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:02,950 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-02-02 21:07:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:07:02,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-02 21:07:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:02,952 INFO L225 Difference]: With dead ends: 137 [2018-02-02 21:07:02,952 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 21:07:02,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:07:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 21:07:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2018-02-02 21:07:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 21:07:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-02 21:07:02,957 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 43 [2018-02-02 21:07:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:02,957 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-02 21:07:02,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:07:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-02 21:07:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 21:07:02,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:02,958 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-02 21:07:02,958 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]=== [2018-02-02 21:07:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1836648095, now seen corresponding path program 1 times [2018-02-02 21:07:02,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:02,959 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:02,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:02,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:02,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:03,022 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-02 21:07:03,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:03,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:03,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:03,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:03,086 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-02 21:07:03,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:03,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 21:07:03,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:07:03,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:07:03,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:07:03,091 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 13 states. [2018-02-02 21:07:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:03,177 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-02 21:07:03,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:07:03,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 21:07:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:03,181 INFO L225 Difference]: With dead ends: 115 [2018-02-02 21:07:03,181 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:07:03,181 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-02 21:07:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:07:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-02-02 21:07:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 21:07:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-02 21:07:03,185 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 48 [2018-02-02 21:07:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:03,185 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-02 21:07:03,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:07:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-02 21:07:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 21:07:03,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:03,187 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-02 21:07:03,187 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]=== [2018-02-02 21:07:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1867828374, now seen corresponding path program 2 times [2018-02-02 21:07:03,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:03,187 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:03,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:03,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:03,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:03,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:03,249 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-02 21:07:03,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:03,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:03,250 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:07:03,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:07:03,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:03,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:03,331 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-02 21:07:03,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:03,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 21:07:03,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:07:03,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:07:03,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:07:03,333 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 15 states. [2018-02-02 21:07:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:03,391 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-02-02 21:07:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:07:03,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 21:07:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:03,392 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:07:03,392 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 21:07:03,393 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-02 21:07:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 21:07:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 21:07:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:07:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-02 21:07:03,397 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 52 [2018-02-02 21:07:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:03,397 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-02 21:07:03,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:07:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-02 21:07:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 21:07:03,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:03,398 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-02 21:07:03,398 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]=== [2018-02-02 21:07:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 3 times [2018-02-02 21:07:03,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:03,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:03,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:03,399 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:03,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:03,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:03,466 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-02 21:07:03,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:03,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:03,467 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:07:03,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 21:07:03,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:03,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:03,514 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-02 21:07:03,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,544 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-02 21:07:03,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,547 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-02 21:07:03,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,564 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-02 21:07:03,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:07:03,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 21:07:03,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,818 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-02 21:07:03,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,867 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 37 treesize of output 50 [2018-02-02 21:07:03,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:03,896 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 36 treesize of output 30 [2018-02-02 21:07:03,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,916 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-02 21:07:03,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:03,937 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-02 21:07:03,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 21:07:03,999 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-02 21:07:03,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:04,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-02 21:07:04,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:07:04,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:07:04,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-02 21:07:04,000 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 21 states. [2018-02-02 21:07:25,868 WARN L143 SmtUtils]: Spent 14259ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-02 21:07:50,133 WARN L146 SmtUtils]: Spent 24219ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-02 21:07:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:50,427 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-02-02 21:07:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:07:50,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-02 21:07:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:50,429 INFO L225 Difference]: With dead ends: 192 [2018-02-02 21:07:50,429 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 21:07:50,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-02 21:07:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 21:07:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 136. [2018-02-02 21:07:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 21:07:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-02-02 21:07:50,432 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 56 [2018-02-02 21:07:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:50,433 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-02-02 21:07:50,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:07:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2018-02-02 21:07:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 21:07:50,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:50,434 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-02 21:07:50,434 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]=== [2018-02-02 21:07:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077307, now seen corresponding path program 1 times [2018-02-02 21:07:50,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:50,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:50,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,435 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:50,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:50,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:50,504 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-02 21:07:50,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:50,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:50,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:50,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:50,622 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-02 21:07:50,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:50,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 21:07:50,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:07:50,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:07:50,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:07:50,623 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand 19 states. [2018-02-02 21:07:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:50,669 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2018-02-02 21:07:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:07:50,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 21:07:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:50,670 INFO L225 Difference]: With dead ends: 142 [2018-02-02 21:07:50,670 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 21:07:50,670 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-02 21:07:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 21:07:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-02-02 21:07:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 21:07:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-02 21:07:50,673 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 60 [2018-02-02 21:07:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:50,674 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-02 21:07:50,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:07:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-02 21:07:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 21:07:50,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:50,675 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-02 21:07:50,675 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]=== [2018-02-02 21:07:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113860, now seen corresponding path program 2 times [2018-02-02 21:07:50,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:50,675 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:50,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:50,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:50,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:50,763 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-02 21:07:50,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:50,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:50,765 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:07:50,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:07:50,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:50,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:50,875 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-02 21:07:50,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:50,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 21:07:50,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:07:50,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:07:50,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:07:50,876 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 21 states. [2018-02-02 21:07:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:50,939 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-02 21:07:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:07:50,940 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 21:07:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:50,941 INFO L225 Difference]: With dead ends: 146 [2018-02-02 21:07:50,941 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 21:07:50,941 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-02 21:07:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 21:07:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 21:07:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 21:07:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-02 21:07:50,945 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-02 21:07:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:50,946 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-02 21:07:50,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:07:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-02 21:07:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:07:50,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:50,946 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-02 21:07:50,947 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]=== [2018-02-02 21:07:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 3 times [2018-02-02 21:07:50,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:50,947 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:50,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,948 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:50,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:50,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:51,055 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-02 21:07:51,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:51,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:51,056 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:07:51,069 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 21:07:51,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:07:51,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:51,074 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-02 21:07:51,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:51,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:07:51,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 21:07:51,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:51,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:07:51,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-02 21:07:51,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:51,166 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-02 21:07:51,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 21:07:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 21:07:51,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:51,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-02 21:07:51,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:07:51,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:07:51,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:07:51,186 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 22 states. [2018-02-02 21:07:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:51,815 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-02 21:07:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:07:51,816 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-02 21:07:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:51,816 INFO L225 Difference]: With dead ends: 193 [2018-02-02 21:07:51,817 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 21:07:51,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:07:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 21:07:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-02 21:07:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 21:07:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 21:07:51,820 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 68 [2018-02-02 21:07:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:51,821 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 21:07:51,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:07:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 21:07:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 21:07:51,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:51,821 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-02 21:07:51,821 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]=== [2018-02-02 21:07:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-02 21:07:51,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:51,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:51,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:51,822 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:07:51,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:51,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:51,845 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-02 21:07:51,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:07:51,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:07:51,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:07:51,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:07:51,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:07:51,846 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-02 21:07:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:51,874 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-02 21:07:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:07:51,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 21:07:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:51,875 INFO L225 Difference]: With dead ends: 143 [2018-02-02 21:07:51,875 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 21:07:51,875 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-02 21:07:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 21:07:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-02 21:07:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 21:07:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 21:07:51,878 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-02 21:07:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:51,878 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 21:07:51,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:07:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 21:07:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 21:07:51,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:51,879 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-02 21:07:51,879 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]=== [2018-02-02 21:07:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-02 21:07:51,879 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:51,879 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:51,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:51,880 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:51,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:51,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:52,051 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-02 21:07:52,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:07:52,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:07:52,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:52,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:07:52,107 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-02 21:07:52,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:52,120 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-02 21:07:52,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:07:52,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:07:52,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:07:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 21:07:52,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:07:52,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-02 21:07:52,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:07:52,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:07:52,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:07:52,366 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 23 states. [2018-02-02 21:07:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:07:52,893 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-02 21:07:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:07:52,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-02 21:07:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:07:52,894 INFO L225 Difference]: With dead ends: 156 [2018-02-02 21:07:52,894 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 21:07:52,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 21:07:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 21:07:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2018-02-02 21:07:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 21:07:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-02 21:07:52,896 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-02 21:07:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:07:52,897 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-02 21:07:52,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:07:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-02 21:07:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 21:07:52,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:07:52,897 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-02 21:07:52,897 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]=== [2018-02-02 21:07:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-02 21:07:52,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:07:52,897 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:07:52,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:52,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:07:52,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:07:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:07:52,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:07:52,922 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 21:07:52,925 INFO L168 Benchmark]: Toolchain (without parser) took 54158.51 ms. Allocated memory was 397.4 MB in the beginning and 746.6 MB in the end (delta: 349.2 MB). Free memory was 354.2 MB in the beginning and 584.9 MB in the end (delta: -230.7 MB). Peak memory consumption was 118.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:07:52,925 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:07:52,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.77 ms. Allocated memory is still 397.4 MB. Free memory was 354.2 MB in the beginning and 341.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:07:52,926 INFO L168 Benchmark]: Boogie Preprocessor took 27.19 ms. Allocated memory is still 397.4 MB. Free memory was 341.0 MB in the beginning and 339.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:07:52,926 INFO L168 Benchmark]: RCFGBuilder took 234.24 ms. Allocated memory is still 397.4 MB. Free memory was 339.7 MB in the beginning and 316.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:07:52,926 INFO L168 Benchmark]: TraceAbstraction took 53729.59 ms. Allocated memory was 397.4 MB in the beginning and 746.6 MB in the end (delta: 349.2 MB). Free memory was 314.8 MB in the beginning and 584.9 MB in the end (delta: -270.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:07:52,927 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.13 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.77 ms. Allocated memory is still 397.4 MB. Free memory was 354.2 MB in the beginning and 341.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.19 ms. Allocated memory is still 397.4 MB. Free memory was 341.0 MB in the beginning and 339.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 234.24 ms. Allocated memory is still 397.4 MB. Free memory was 339.7 MB in the beginning and 316.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53729.59 ms. Allocated memory was 397.4 MB in the beginning and 746.6 MB in the end (delta: 349.2 MB). Free memory was 314.8 MB in the beginning and 584.9 MB in the end (delta: -270.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-07-52-932.csv Received shutdown request...