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-ccafca9-m [2018-02-04 04:15:19,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:15:19,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:15:19,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:15:19,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:15:19,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:15:19,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:15:19,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:15:19,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:15:19,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:15:19,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:15:19,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:15:19,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:15:19,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:15:19,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:15:19,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:15:19,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:15:19,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:15:19,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:15:19,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:15:19,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:15:19,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:15:19,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:15:19,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:15:19,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:15:19,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:15:19,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:15:19,777 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:15:19,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:15:19,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:15:19,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:15:19,778 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-04 04:15:19,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:15:19,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:15:19,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:15:19,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:15:19,790 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:15:19,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:15:19,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:15:19,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:15:19,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:15:19,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:15:19,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:15:19,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:15:19,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:15:19,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:15:19,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:15:19,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:15:19,793 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:15:19,793 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:15:19,793 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:15:19,793 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:15:19,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:15:19,833 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:15:19,838 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:15:19,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:15:19,841 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:15:19,842 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-04 04:15:20,009 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:15:20,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:15:20,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:15:20,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:15:20,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:15:20,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17832045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20, skipping insertion in model container [2018-02-04 04:15:20,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,032 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:15:20,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:15:20,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:15:20,167 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:15:20,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20 WrapperNode [2018-02-04 04:15:20,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:15:20,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:15:20,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:15:20,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:15:20,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... [2018-02-04 04:15:20,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:15:20,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:15:20,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:15:20,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:15:20,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:15:20,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:15:20,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:15:20,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:15:20,233 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 04:15:20,233 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 04:15:20,233 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:15:20,233 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:15:20,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:15:20,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:15:20,409 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:15:20,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:20 BoogieIcfgContainer [2018-02-04 04:15:20,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:15:20,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:15:20,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:15:20,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:15:20,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:15:20" (1/3) ... [2018-02-04 04:15:20,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e47a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:20, skipping insertion in model container [2018-02-04 04:15:20,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:20" (2/3) ... [2018-02-04 04:15:20,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e47a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:20, skipping insertion in model container [2018-02-04 04:15:20,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:20" (3/3) ... [2018-02-04 04:15:20,416 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-04 04:15:20,421 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:15:20,427 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 04:15:20,460 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:15:20,460 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:15:20,460 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:15:20,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:15:20,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:15:20,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:15:20,461 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:15:20,461 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:15:20,462 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:15:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-04 04:15:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:15:20,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:20,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:20,484 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-04 04:15:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-04 04:15:20,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:20,489 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:20,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:20,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:20,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:20,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:20,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:20,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:15:20,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:15:20,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:15:20,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:15:20,716 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-04 04:15:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:20,867 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-04 04:15:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:15:20,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 04:15:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:20,879 INFO L225 Difference]: With dead ends: 121 [2018-02-04 04:15:20,879 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:15:20,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:15:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:15:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-04 04:15:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 04:15:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-04 04:15:20,919 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-04 04:15:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:20,920 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-04 04:15:20,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:15:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-04 04:15:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:15:20,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:20,921 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:20,921 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-04 04:15:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-04 04:15:20,922 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:20,922 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:20,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:20,923 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:20,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:20,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:20,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:20,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:20,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:15:20,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:15:20,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:15:20,987 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-04 04:15:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:21,004 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-04 04:15:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:15:21,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:15:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:21,006 INFO L225 Difference]: With dead ends: 94 [2018-02-04 04:15:21,006 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 04:15:21,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:15:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 04:15:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-04 04:15:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 04:15:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 04:15:21,013 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-04 04:15:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:21,014 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 04:15:21,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:15:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 04:15:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:15:21,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:21,015 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:21,015 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-04 04:15:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-04 04:15:21,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:21,015 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:21,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:21,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:21,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:21,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:21,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:15:21,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:21,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:21,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:21,071 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-04 04:15:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:21,124 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-04 04:15:21,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:21,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:15:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:21,126 INFO L225 Difference]: With dead ends: 72 [2018-02-04 04:15:21,126 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 04:15:21,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:15:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 04:15:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 04:15:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 04:15:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 04:15:21,130 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-04 04:15:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:21,130 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 04:15:21,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 04:15:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:15:21,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:21,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:21,132 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-04 04:15:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-04 04:15:21,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:21,133 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:21,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,134 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:21,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:21,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:21,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:21,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:21,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:21,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:21,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:21,181 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-04 04:15:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:21,255 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 04:15:21,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:21,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:15:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:21,256 INFO L225 Difference]: With dead ends: 71 [2018-02-04 04:15:21,256 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 04:15:21,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:15:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 04:15:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 04:15:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 04:15:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 04:15:21,260 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 04:15:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:21,260 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 04:15:21,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 04:15:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:15:21,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:21,261 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:21,261 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-04 04:15:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-04 04:15:21,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:21,261 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:21,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:21,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:21,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:21,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:21,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:15:21,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:15:21,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:15:21,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:15:21,461 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-04 04:15:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:21,630 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 04:15:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:15:21,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 04:15:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:21,631 INFO L225 Difference]: With dead ends: 75 [2018-02-04 04:15:21,632 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 04:15:21,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:15:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 04:15:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-04 04:15:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:15:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 04:15:21,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-04 04:15:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:21,637 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 04:15:21,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:15:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 04:15:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:15:21,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:21,638 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:21,638 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-04 04:15:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-04 04:15:21,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:21,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:21,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:21,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:21,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:21,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:21,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:21,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:21,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:21,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:15:21,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:21,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:15:21,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:21,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:15:21,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:15:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:22,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:22,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 04:15:22,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:15:22,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:15:22,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:15:22,256 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 19 states. [2018-02-04 04:15:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:22,664 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 04:15:22,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:15:22,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 04:15:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:22,665 INFO L225 Difference]: With dead ends: 79 [2018-02-04 04:15:22,666 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 04:15:22,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:15:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 04:15:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-04 04:15:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 04:15:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 04:15:22,669 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-04 04:15:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:22,669 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 04:15:22,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:15:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 04:15:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:15:22,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:22,670 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:22,671 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-04 04:15:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-04 04:15:22,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:22,671 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:22,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:22,672 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:22,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:22,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:22,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:22,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:22,899 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:15:22,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:15:22,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:15:22,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:22,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:15:22,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:22,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:15:22,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:22,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:15:22,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:15:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:23,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:23,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 04:15:23,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:15:23,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:15:23,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:15:23,139 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 23 states. [2018-02-04 04:15:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:23,355 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-02-04 04:15:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:15:23,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 04:15:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:23,357 INFO L225 Difference]: With dead ends: 78 [2018-02-04 04:15:23,357 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 04:15:23,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:15:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 04:15:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 04:15:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 04:15:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 04:15:23,360 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 27 [2018-02-04 04:15:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:23,360 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 04:15:23,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:15:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 04:15:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:15:23,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:23,361 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:23,361 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-04 04:15:23,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1687246701, now seen corresponding path program 1 times [2018-02-04 04:15:23,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:23,361 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:23,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,362 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:15:23,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:15:23,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:23,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:23,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:15:23,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:15:23,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:15:23,399 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 5 states. [2018-02-04 04:15:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:23,412 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-04 04:15:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:15:23,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 04:15:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:23,413 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:15:23,413 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:15:23,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:15:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:15:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-04 04:15:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 04:15:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 04:15:23,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 38 [2018-02-04 04:15:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:23,416 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 04:15:23,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:15:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 04:15:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 04:15:23,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:23,417 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:23,417 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-04 04:15:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207588, now seen corresponding path program 1 times [2018-02-04 04:15:23,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:23,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:23,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,418 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:23,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:15:23,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:23,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:23,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:23,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:23,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:23,463 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2018-02-04 04:15:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:23,544 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 04:15:23,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:15:23,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 04:15:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:23,545 INFO L225 Difference]: With dead ends: 120 [2018-02-04 04:15:23,546 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 04:15:23,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:15:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 04:15:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-04 04:15:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 04:15:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-04 04:15:23,553 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 39 [2018-02-04 04:15:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:23,554 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-04 04:15:23,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-04 04:15:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 04:15:23,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:23,555 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:23,555 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-04 04:15:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 1 times [2018-02-04 04:15:23,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:23,555 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:23,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,557 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:23,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:23,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:23,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:23,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:23,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:23,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 04:15:23,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:15:23,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:15:23,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:15:23,632 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 9 states. [2018-02-04 04:15:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:23,671 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-04 04:15:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:23,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 04:15:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:23,672 INFO L225 Difference]: With dead ends: 108 [2018-02-04 04:15:23,672 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 04:15:23,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:15:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 04:15:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-04 04:15:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 04:15:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-04 04:15:23,677 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-04 04:15:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:23,678 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-04 04:15:23,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:15:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-04 04:15:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:15:23,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:23,679 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:23,679 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-04 04:15:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 2 times [2018-02-04 04:15:23,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:23,679 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:23,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:23,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:23,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:23,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:23,726 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:15:23,735 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:15:23,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:15:23,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 04:15:23,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:15:23,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 04:15:23,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:15:23,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:15:23,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:15:23,757 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2018-02-04 04:15:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:23,858 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-02-04 04:15:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:15:23,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 04:15:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:23,860 INFO L225 Difference]: With dead ends: 137 [2018-02-04 04:15:23,860 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 04:15:23,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:15:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 04:15:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2018-02-04 04:15:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 04:15:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 04:15:23,865 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 43 [2018-02-04 04:15:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:23,865 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 04:15:23,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:15:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 04:15:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 04:15:23,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:23,867 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:23,867 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-04 04:15:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1836648095, now seen corresponding path program 1 times [2018-02-04 04:15:23,867 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:23,867 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:23,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,868 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:15:23,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:15:23,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:23,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:23,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:23,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:23,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:23,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 04:15:23,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:15:23,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:15:23,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:15:23,998 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 13 states. [2018-02-04 04:15:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:24,053 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 04:15:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:15:24,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 04:15:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:24,054 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:15:24,055 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:15:24,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:15:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:15:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-02-04 04:15:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:15:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 04:15:24,059 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 48 [2018-02-04 04:15:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:24,060 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 04:15:24,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:15:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 04:15:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:15:24,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:24,061 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:24,061 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-04 04:15:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1867828374, now seen corresponding path program 2 times [2018-02-04 04:15:24,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:24,061 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:24,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:24,062 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:24,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:24,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:15:24,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:24,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:24,128 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:15:24,145 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:15:24,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:15:24,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:24,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:24,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 04:15:24,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:15:24,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:15:24,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:15:24,211 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 15 states. [2018-02-04 04:15:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:24,266 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-02-04 04:15:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:15:24,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 04:15:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:24,270 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:15:24,270 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:15:24,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:15:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:15:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 04:15:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 04:15:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-04 04:15:24,275 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 52 [2018-02-04 04:15:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:24,275 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-04 04:15:24,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:15:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-04 04:15:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 04:15:24,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:24,276 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:15:24,276 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-04 04:15:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 3 times [2018-02-04 04:15:24,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:24,277 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:24,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:24,278 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:15:24,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:24,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:15:24,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:15:24,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:15:24,347 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:15:24,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 04:15:24,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:15:24,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:15:24,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 04:15:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 04:15:24,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 04:15:24,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 04:15:24,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:15:24,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 04:15:24,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 04:15:24,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,630 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-04 04:15:24,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:15:24,653 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-04 04:15:24,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 04:15:24,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:15:24,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 04:15:24,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 04:15:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 04:15:24,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:15:24,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 04:15:24,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:15:24,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:15:24,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 04:15:24,770 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 21 states. [2018-02-04 04:15:46,511 WARN L143 SmtUtils]: Spent 14181ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 04:16:11,479 WARN L146 SmtUtils]: Spent 24925ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 04:16:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:11,748 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-02-04 04:16:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:16:11,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 04:16:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:11,750 INFO L225 Difference]: With dead ends: 192 [2018-02-04 04:16:11,750 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 04:16:11,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 04:16:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 04:16:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 136. [2018-02-04 04:16:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 04:16:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-02-04 04:16:11,756 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 56 [2018-02-04 04:16:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:11,756 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-02-04 04:16:11,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:16:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2018-02-04 04:16:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 04:16:11,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:11,757 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:11,757 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-04 04:16:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077307, now seen corresponding path program 1 times [2018-02-04 04:16:11,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:11,758 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:11,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:11,759 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:16:11,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:11,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:16:11,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:16:11,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:16:11,838 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:16:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:11,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:16:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:16:11,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:16:11,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 04:16:11,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:16:11,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:16:11,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:16:11,940 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand 19 states. [2018-02-04 04:16:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:12,015 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2018-02-04 04:16:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:16:12,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 04:16:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:12,016 INFO L225 Difference]: With dead ends: 142 [2018-02-04 04:16:12,016 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 04:16:12,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:16:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 04:16:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-02-04 04:16:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:16:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 04:16:12,019 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 60 [2018-02-04 04:16:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:12,019 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 04:16:12,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:16:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 04:16:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 04:16:12,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:12,019 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:12,020 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-04 04:16:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113860, now seen corresponding path program 2 times [2018-02-04 04:16:12,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:12,020 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:12,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:12,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:16:12,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:12,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:16:12,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:16:12,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:16:12,101 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:16:12,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:16:12,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:16:12,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:16:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:16:12,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:16:12,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 04:16:12,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:16:12,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:16:12,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:16:12,198 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 21 states. [2018-02-04 04:16:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:12,252 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 04:16:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:16:12,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 04:16:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:12,253 INFO L225 Difference]: With dead ends: 146 [2018-02-04 04:16:12,253 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 04:16:12,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:16:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 04:16:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 04:16:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 04:16:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 04:16:12,257 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-04 04:16:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:12,258 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 04:16:12,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:16:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 04:16:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 04:16:12,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:12,259 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:12,259 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-04 04:16:12,259 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 3 times [2018-02-04 04:16:12,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:12,259 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:12,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:12,260 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:16:12,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:12,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:16:12,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:16:12,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:16:12,380 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:16:12,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 04:16:12,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:16:12,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:16:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:16:12,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:16:12,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:16:12,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 04:16:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:16:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:16:12,494 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-04 04:16:12,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:16:12,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:16:12,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 04:16:12,519 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-04 04:16:12,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:16:12,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-04 04:16:12,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:16:12,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:16:12,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:16:12,520 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 22 states. [2018-02-04 04:16:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:13,227 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-04 04:16:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:16:13,227 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 04:16:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:13,228 INFO L225 Difference]: With dead ends: 193 [2018-02-04 04:16:13,228 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 04:16:13,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:16:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 04:16:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-04 04:16:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 04:16:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-04 04:16:13,233 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 68 [2018-02-04 04:16:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:13,234 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-04 04:16:13,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:16:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-04 04:16:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 04:16:13,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:13,235 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:13,235 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-04 04:16:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-04 04:16:13,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:13,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:13,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:13,237 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:16:13,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:13,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 04:16:13,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:16:13,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:16:13,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:16:13,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:16:13,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:16:13,311 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-04 04:16:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:13,333 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-04 04:16:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:16:13,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 04:16:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:13,334 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:16:13,334 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:16:13,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:16:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:16:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-04 04:16:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 04:16:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-04 04:16:13,338 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-04 04:16:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:13,339 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-04 04:16:13,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:16:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-04 04:16:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 04:16:13,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:13,340 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:13,340 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-04 04:16:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-04 04:16:13,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:13,340 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:13,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:13,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:16:13,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:13,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 04:16:13,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:16:13,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:16:13,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:16:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:13,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:16:13,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:16:13,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:16:13,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:16:13,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:16:13,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:16:13,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:16:13,870 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-04 04:16:13,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:16:13,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 04:16:13,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:16:13,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:16:13,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:16:13,870 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 23 states. [2018-02-04 04:16:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:16:14,395 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-04 04:16:14,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:16:14,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-04 04:16:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:16:14,396 INFO L225 Difference]: With dead ends: 156 [2018-02-04 04:16:14,397 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 04:16:14,397 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-04 04:16:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 04:16:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2018-02-04 04:16:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 04:16:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-04 04:16:14,401 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-04 04:16:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:16:14,401 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-04 04:16:14,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:16:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-04 04:16:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:16:14,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:16:14,402 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:16:14,402 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-04 04:16:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-04 04:16:14,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:16:14,403 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:16:14,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:14,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:16:14,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:16:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:16:14,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:16:14,432 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-04 04:16:14,436 INFO L168 Benchmark]: Toolchain (without parser) took 54426.07 ms. Allocated memory was 393.7 MB in the beginning and 745.0 MB in the end (delta: 351.3 MB). Free memory was 347.8 MB in the beginning and 647.4 MB in the end (delta: -299.7 MB). Peak memory consumption was 51.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:16:14,437 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 393.7 MB. Free memory is still 353.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:16:14,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.70 ms. Allocated memory is still 393.7 MB. Free memory was 347.8 MB in the beginning and 334.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:16:14,437 INFO L168 Benchmark]: Boogie Preprocessor took 23.49 ms. Allocated memory is still 393.7 MB. Free memory was 334.6 MB in the beginning and 331.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:16:14,438 INFO L168 Benchmark]: RCFGBuilder took 212.43 ms. Allocated memory is still 393.7 MB. Free memory was 331.9 MB in the beginning and 306.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:16:14,438 INFO L168 Benchmark]: TraceAbstraction took 54024.89 ms. Allocated memory was 393.7 MB in the beginning and 745.0 MB in the end (delta: 351.3 MB). Free memory was 306.6 MB in the beginning and 647.4 MB in the end (delta: -340.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:16:14,439 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.15 ms. Allocated memory is still 393.7 MB. Free memory is still 353.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.70 ms. Allocated memory is still 393.7 MB. Free memory was 347.8 MB in the beginning and 334.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.49 ms. Allocated memory is still 393.7 MB. Free memory was 334.6 MB in the beginning and 331.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 212.43 ms. Allocated memory is still 393.7 MB. Free memory was 331.9 MB in the beginning and 306.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54024.89 ms. Allocated memory was 393.7 MB in the beginning and 745.0 MB in the end (delta: 351.3 MB). Free memory was 306.6 MB in the beginning and 647.4 MB in the end (delta: -340.8 MB). Peak memory consumption was 10.5 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-04_04-16-14-445.csv Received shutdown request...