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-c17473d-m [2018-02-04 19:06:47,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:06:47,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:06:47,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:06:47,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:06:47,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:06:47,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:06:47,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:06:47,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:06:47,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:06:47,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:06:47,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:06:47,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:06:47,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:06:47,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:06:47,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:06:47,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:06:47,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:06:47,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:06:47,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:06:47,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:06:47,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:06:47,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:06:47,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:06:47,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:06:47,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:06:47,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:06:47,082 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:06:47,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:06:47,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:06:47,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:06:47,083 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 19:06:47,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:06:47,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:06:47,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:06:47,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:06:47,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:06:47,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:06:47,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:06:47,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:06:47,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:06:47,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:06:47,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:06:47,096 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:06:47,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:06:47,096 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:06:47,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:06:47,134 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:06:47,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:06:47,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:06:47,139 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:06:47,139 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 19:06:47,262 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:06:47,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:06:47,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:06:47,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:06:47,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:06:47,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f8729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47, skipping insertion in model container [2018-02-04 19:06:47,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,287 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:06:47,324 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:06:47,409 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:06:47,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:06:47,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47 WrapperNode [2018-02-04 19:06:47,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:06:47,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:06:47,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:06:47,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:06:47,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (1/1) ... [2018-02-04 19:06:47,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:06:47,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:06:47,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:06:47,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:06:47,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (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 19:06:47,499 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:06:47,500 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:06:47,500 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:06:47,501 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:06:47,693 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:06:47,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:06:47 BoogieIcfgContainer [2018-02-04 19:06:47,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:06:47,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:06:47,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:06:47,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:06:47,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:06:47" (1/3) ... [2018-02-04 19:06:47,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:06:47, skipping insertion in model container [2018-02-04 19:06:47,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:06:47" (2/3) ... [2018-02-04 19:06:47,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:06:47, skipping insertion in model container [2018-02-04 19:06:47,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:06:47" (3/3) ... [2018-02-04 19:06:47,698 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-04 19:06:47,703 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:06:47,709 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 19:06:47,739 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:06:47,739 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:06:47,739 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:06:47,739 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:06:47,739 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:06:47,739 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:06:47,739 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:06:47,739 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:06:47,740 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:06:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-04 19:06:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:06:47,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:47,762 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 19:06:47,762 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 19:06:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-04 19:06:47,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:47,767 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:47,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:47,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:47,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:47,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:47,908 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 19:06:47,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:47,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:06:47,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:06:47,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:06:47,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:06:47,984 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-04 19:06:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:48,153 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-04 19:06:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:06:48,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:06:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:48,163 INFO L225 Difference]: With dead ends: 121 [2018-02-04 19:06:48,163 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 19:06:48,164 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 19:06:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 19:06:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-04 19:06:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:06:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-04 19:06:48,196 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-04 19:06:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:48,196 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-04 19:06:48,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:06:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-04 19:06:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:06:48,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:48,197 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 19:06:48,197 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 19:06:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-04 19:06:48,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:48,198 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:48,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:48,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:48,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:48,253 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 19:06:48,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:48,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:06:48,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:06:48,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:06:48,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:06:48,255 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-04 19:06:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:48,271 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-04 19:06:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:06:48,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 19:06:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:48,276 INFO L225 Difference]: With dead ends: 94 [2018-02-04 19:06:48,276 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 19:06:48,277 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 19:06:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 19:06:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-04 19:06:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 19:06:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 19:06:48,285 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-04 19:06:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:48,285 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 19:06:48,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:06:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 19:06:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:06:48,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:48,286 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 19:06:48,286 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 19:06:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-04 19:06:48,286 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:48,286 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:48,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:48,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:48,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:48,330 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 19:06:48,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:48,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:06:48,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:06:48,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:06:48,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:06:48,331 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-04 19:06:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:48,352 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-04 19:06:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:06:48,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:06:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:48,353 INFO L225 Difference]: With dead ends: 72 [2018-02-04 19:06:48,353 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 19:06:48,354 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 19:06:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 19:06:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 19:06:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 19:06:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 19:06:48,357 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-04 19:06:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:48,358 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 19:06:48,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:06:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 19:06:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:06:48,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:48,359 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 19:06:48,359 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 19:06:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-04 19:06:48,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:48,359 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:48,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:48,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:48,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:48,418 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 19:06:48,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:48,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:06:48,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:06:48,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:06:48,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:06:48,419 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-04 19:06:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:48,478 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 19:06:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:06:48,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:06:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:48,479 INFO L225 Difference]: With dead ends: 71 [2018-02-04 19:06:48,479 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 19:06:48,480 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 19:06:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 19:06:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 19:06:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 19:06:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 19:06:48,482 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 19:06:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:48,482 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 19:06:48,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:06:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 19:06:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:06:48,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:48,483 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 19:06:48,483 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 19:06:48,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-04 19:06:48,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:48,483 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:48,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:48,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:48,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:48,663 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 19:06:48,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:48,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:06:48,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:06:48,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:06:48,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:06:48,664 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-04 19:06:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:48,835 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 19:06:48,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:06:48,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 19:06:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:48,836 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:06:48,836 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:06:48,837 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 19:06:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:06:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-04 19:06:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 19:06:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 19:06:48,841 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-04 19:06:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:48,841 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 19:06:48,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:06:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 19:06:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:06:48,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:48,842 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 19:06:48,843 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 19:06:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-04 19:06:48,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:48,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:48,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:48,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:48,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:49,040 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 19:06:49,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:49,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:49,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:49,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:49,117 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 19:06:49,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:49,130 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 19:06:49,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:49,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:06:49,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:06:49,405 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 19:06:49,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:49,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 19:06:49,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:06:49,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:06:49,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:06:49,406 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 19 states. [2018-02-04 19:06:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:49,806 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 19:06:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:06:49,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 19:06:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:49,806 INFO L225 Difference]: With dead ends: 79 [2018-02-04 19:06:49,807 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 19:06:49,807 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 19:06:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 19:06:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-04 19:06:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 19:06:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 19:06:49,810 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-04 19:06:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:49,810 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 19:06:49,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:06:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 19:06:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:06:49,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:49,811 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 19:06:49,811 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 19:06:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-04 19:06:49,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:49,811 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:49,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:49,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:49,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:49,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:50,009 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 19:06:50,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:50,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:50,010 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:06:50,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:06:50,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:06:50,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:50,058 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 19:06:50,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:50,073 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 19:06:50,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:50,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:06:50,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:06:50,233 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 19:06:50,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:50,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 19:06:50,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:06:50,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:06:50,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:06:50,234 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 23 states. [2018-02-04 19:06:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:50,450 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-02-04 19:06:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:06:50,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 19:06:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:50,451 INFO L225 Difference]: With dead ends: 78 [2018-02-04 19:06:50,451 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 19:06:50,452 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 19:06:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 19:06:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 19:06:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 19:06:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 19:06:50,456 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 27 [2018-02-04 19:06:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:50,456 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 19:06:50,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:06:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 19:06:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:06:50,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:50,457 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 19:06:50,458 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 19:06:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1687246701, now seen corresponding path program 1 times [2018-02-04 19:06:50,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:50,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:50,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,459 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:06:50,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:50,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:50,520 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 19:06:50,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:50,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:06:50,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:06:50,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:06:50,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:06:50,521 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 5 states. [2018-02-04 19:06:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:50,530 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-04 19:06:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:06:50,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 19:06:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:50,531 INFO L225 Difference]: With dead ends: 80 [2018-02-04 19:06:50,531 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 19:06:50,532 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 19:06:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 19:06:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-04 19:06:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 19:06:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 19:06:50,535 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 38 [2018-02-04 19:06:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:50,536 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 19:06:50,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:06:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 19:06:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:06:50,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:50,537 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 19:06:50,537 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 19:06:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207588, now seen corresponding path program 1 times [2018-02-04 19:06:50,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:50,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:50,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:50,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:50,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:50,595 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 19:06:50,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:06:50,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:06:50,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:06:50,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:06:50,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:06:50,596 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2018-02-04 19:06:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:50,709 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 19:06:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:06:50,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 19:06:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:50,710 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:06:50,711 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 19:06:50,711 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 19:06:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 19:06:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-04 19:06:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 19:06:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-04 19:06:50,716 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 39 [2018-02-04 19:06:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:50,716 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-04 19:06:50,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:06:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-04 19:06:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:06:50,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:50,717 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 19:06:50,717 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 19:06:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 1 times [2018-02-04 19:06:50,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:50,718 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:50,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:50,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:50,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:50,762 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 19:06:50,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:50,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:50,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:50,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:50,799 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 19:06:50,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:50,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:06:50,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:06:50,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:06:50,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:06:50,800 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 9 states. [2018-02-04 19:06:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:50,828 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-04 19:06:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:06:50,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 19:06:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:50,831 INFO L225 Difference]: With dead ends: 108 [2018-02-04 19:06:50,831 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 19:06:50,831 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 19:06:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 19:06:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-04 19:06:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 19:06:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-04 19:06:50,835 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-04 19:06:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:50,836 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-04 19:06:50,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:06:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-04 19:06:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:06:50,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:50,837 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 19:06:50,837 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 19:06:50,837 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 2 times [2018-02-04 19:06:50,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:50,837 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:50,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,838 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:50,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:50,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:50,886 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 19:06:50,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:50,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:50,887 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:06:50,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 19:06:50,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:06:50,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:50,915 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 19:06:50,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:06:50,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 19:06:50,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:06:50,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:06:50,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:06:50,916 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2018-02-04 19:06:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:51,006 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-02-04 19:06:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:06:51,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 19:06:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:51,007 INFO L225 Difference]: With dead ends: 137 [2018-02-04 19:06:51,007 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 19:06:51,008 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 19:06:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 19:06:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2018-02-04 19:06:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:06:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 19:06:51,011 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 43 [2018-02-04 19:06:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:51,011 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 19:06:51,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:06:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 19:06:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:06:51,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:51,013 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 19:06:51,013 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 19:06:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1836648095, now seen corresponding path program 1 times [2018-02-04 19:06:51,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:51,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:51,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:06:51,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:51,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:51,085 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 19:06:51,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:51,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:51,086 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:51,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:51,142 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 19:06:51,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:51,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 19:06:51,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:06:51,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:06:51,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:06:51,144 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 13 states. [2018-02-04 19:06:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:51,190 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 19:06:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:06:51,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 19:06:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:51,192 INFO L225 Difference]: With dead ends: 115 [2018-02-04 19:06:51,192 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 19:06:51,193 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 19:06:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 19:06:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-02-04 19:06:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 19:06:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 19:06:51,197 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 48 [2018-02-04 19:06:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:51,197 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 19:06:51,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:06:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 19:06:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:06:51,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:51,198 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 19:06:51,198 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 19:06:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1867828374, now seen corresponding path program 2 times [2018-02-04 19:06:51,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:51,198 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:51,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:06:51,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:51,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:51,265 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 19:06:51,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:51,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:51,266 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:06:51,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:06:51,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:06:51,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:51,340 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 19:06:51,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:51,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 19:06:51,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:06:51,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:06:51,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:06:51,341 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 15 states. [2018-02-04 19:06:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:06:51,389 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-02-04 19:06:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:06:51,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 19:06:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:06:51,391 INFO L225 Difference]: With dead ends: 119 [2018-02-04 19:06:51,391 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 19:06:51,391 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 19:06:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 19:06:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 19:06:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 19:06:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-04 19:06:51,395 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 52 [2018-02-04 19:06:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:06:51,395 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-04 19:06:51,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:06:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-04 19:06:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:06:51,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:06:51,396 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 19:06:51,397 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 19:06:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 3 times [2018-02-04 19:06:51,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:06:51,397 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:06:51,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,398 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:06:51,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:06:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:06:51,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:06:51,471 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 19:06:51,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:06:51,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:06:51,473 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:06:51,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:06:51,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:06:51,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:06:51,516 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 19:06:51,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,535 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 19:06:51,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,537 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 19:06:51,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,556 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 19:06:51,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:06:51,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:06:51,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,743 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 19:06:51,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,761 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 19:06:51,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:06:51,780 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 19:06:51,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,800 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 19:06:51,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:06:51,814 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 19:06:51,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:06:51,880 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 19:06:51,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:06:51,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 19:06:51,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:06:51,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:06:51,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 19:06:51,881 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 21 states. [2018-02-04 19:07:15,482 WARN L143 SmtUtils]: Spent 16111ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 19:07:40,456 WARN L146 SmtUtils]: Spent 24916ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 19:07:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:41,119 INFO L93 Difference]: Finished difference Result 199 states and 218 transitions. [2018-02-04 19:07:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:07:41,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 19:07:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:41,143 INFO L225 Difference]: With dead ends: 199 [2018-02-04 19:07:41,143 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 19:07:41,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=232, Invalid=1324, Unknown=4, NotChecked=0, Total=1560 [2018-02-04 19:07:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 19:07:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 136. [2018-02-04 19:07:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 19:07:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-02-04 19:07:41,148 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 56 [2018-02-04 19:07:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:41,148 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-02-04 19:07:41,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:07:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2018-02-04 19:07:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:07:41,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:41,149 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 19:07:41,149 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 19:07:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077307, now seen corresponding path program 1 times [2018-02-04 19:07:41,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:41,149 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:41,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,150 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:41,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:41,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:41,238 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 19:07:41,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:41,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:41,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:41,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:41,345 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 19:07:41,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:41,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 19:07:41,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:07:41,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:07:41,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:07:41,346 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand 19 states. [2018-02-04 19:07:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:41,386 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2018-02-04 19:07:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:07:41,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 19:07:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:41,387 INFO L225 Difference]: With dead ends: 142 [2018-02-04 19:07:41,387 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 19:07:41,388 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 19:07:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 19:07:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-02-04 19:07:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 19:07:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 19:07:41,392 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 60 [2018-02-04 19:07:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:41,392 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 19:07:41,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:07:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 19:07:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:07:41,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:41,393 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 19:07:41,393 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 19:07:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113860, now seen corresponding path program 2 times [2018-02-04 19:07:41,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:41,393 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:41,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:41,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:41,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:41,493 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 19:07:41,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:41,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:41,494 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:07:41,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:07:41,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:41,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:41,602 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 19:07:41,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:41,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 19:07:41,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:07:41,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:07:41,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:07:41,604 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 21 states. [2018-02-04 19:07:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:41,674 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 19:07:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:07:41,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 19:07:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:41,675 INFO L225 Difference]: With dead ends: 146 [2018-02-04 19:07:41,675 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 19:07:41,675 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 19:07:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 19:07:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 19:07:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 19:07:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 19:07:41,679 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-04 19:07:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:41,680 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 19:07:41,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:07:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 19:07:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 19:07:41,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:41,681 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 19:07:41,681 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 19:07:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 3 times [2018-02-04 19:07:41,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:41,681 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:41,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,682 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:41,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:41,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:41,789 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 19:07:41,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:41,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:41,790 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:07:41,801 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:07:41,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:41,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:41,816 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 19:07:41,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:41,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:41,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:07:41,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:41,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:41,910 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 19:07:41,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:41,916 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 19:07:41,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:07:41,943 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 19:07:41,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:41,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-04 19:07:41,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:07:41,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:07:41,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:07:41,944 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 22 states. [2018-02-04 19:07:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:42,670 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-04 19:07:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:07:42,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 19:07:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:42,671 INFO L225 Difference]: With dead ends: 193 [2018-02-04 19:07:42,671 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 19:07:42,671 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 19:07:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 19:07:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-04 19:07:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 19:07:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-04 19:07:42,676 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 68 [2018-02-04 19:07:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:42,676 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-04 19:07:42,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:07:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-04 19:07:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 19:07:42,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:42,677 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 19:07:42,677 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 19:07:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-04 19:07:42,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:42,677 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:42,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:42,678 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:42,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:42,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:42,733 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 19:07:42,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:42,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:07:42,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:07:42,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:07:42,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:07:42,734 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-04 19:07:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:42,764 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-04 19:07:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:07:42,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 19:07:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:42,765 INFO L225 Difference]: With dead ends: 143 [2018-02-04 19:07:42,765 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 19:07:42,766 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 19:07:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 19:07:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-04 19:07:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 19:07:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-04 19:07:42,769 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-04 19:07:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:42,770 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-04 19:07:42,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:07:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-04 19:07:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 19:07:42,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:42,771 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 19:07:42,771 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 19:07:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-04 19:07:42,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:42,771 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:42,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:42,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:42,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:42,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:42,943 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 19:07:42,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:42,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:42,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:42,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:42,991 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 19:07:42,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,013 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 19:07:43,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:07:43,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:07:43,268 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 19:07:43,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:43,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 19:07:43,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:07:43,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:07:43,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:07:43,269 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 23 states. [2018-02-04 19:07:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:43,737 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-04 19:07:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:07:43,738 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-04 19:07:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:43,739 INFO L225 Difference]: With dead ends: 156 [2018-02-04 19:07:43,739 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 19:07:43,739 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 19:07:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 19:07:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2018-02-04 19:07:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 19:07:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-04 19:07:43,742 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-04 19:07:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:43,742 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-04 19:07:43,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:07:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-04 19:07:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 19:07:43,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:43,743 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 19:07:43,743 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 19:07:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-04 19:07:43,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:43,743 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:43,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:43,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:43,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:43,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:07:43,773 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:07:43,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:43,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:43,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:43,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:43,822 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 19:07:43,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,837 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 19:07:43,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:07:43,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:07:43,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:07:43,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:07:43,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:43,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 19:07:43,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:07:43,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:43,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 19:07:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:44,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:44,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:44,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 19:07:44,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-02-04 19:07:44,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:44,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:07:44,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:44,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:44,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:44,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 19:07:46,110 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 19:07:52,111 WARN L143 SmtUtils]: Spent 3976ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:07:52,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:07:52,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:52,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:07:52,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:52,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:52,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:52,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:07:54,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:07:54,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:54,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:07:54,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:54,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:54,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:54,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:07:55,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:07:55,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:55,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:07:55,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:55,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:55,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:55,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:07:57,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:07:57,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:57,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:07:57,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:57,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:57,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:57,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:07:59,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:07:59,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:59,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:07:59,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:59,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:07:59,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:07:59,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:01,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:01,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:01,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:01,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:01,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:01,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:01,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:03,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-04 19:08:03,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:03,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:03,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:03,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:03,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 19:08:07,638 WARN L146 SmtUtils]: Spent 4016ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 19:08:07,862 WARN L143 SmtUtils]: Spent 201ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 19:08:09,886 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 19:08:09,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-04 19:08:09,946 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:08:09,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:09,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-02-04 19:08:09,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:09,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:09,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:09,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 19:08:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 19:08:09,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:08:09,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:08:09,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:08:09,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:08:09,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 19:08:09,996 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 21 states. [2018-02-04 19:08:11,274 WARN L146 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 50 DAG size of output 41 [2018-02-04 19:08:11,594 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 56 DAG size of output 39 [2018-02-04 19:08:13,648 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 43 [2018-02-04 19:08:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:13,913 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-04 19:08:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:08:13,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 19:08:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:13,914 INFO L225 Difference]: With dead ends: 175 [2018-02-04 19:08:13,914 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 19:08:13,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=168, Invalid=1162, Unknown=2, NotChecked=0, Total=1332 [2018-02-04 19:08:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 19:08:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2018-02-04 19:08:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 19:08:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-04 19:08:13,917 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 82 [2018-02-04 19:08:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:13,917 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-04 19:08:13,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:08:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-04 19:08:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 19:08:13,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:13,918 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 19:08:13,918 INFO L371 AbstractCegarLoop]: === Iteration 21 === [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 19:08:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 332825471, now seen corresponding path program 1 times [2018-02-04 19:08:13,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:13,918 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:13,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:13,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:13,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:13,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:08:13,935 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:08:13,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:13,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:13,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:13,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:13,963 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 19:08:13,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:13,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 19:08:13,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:13,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:08:13,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:08:14,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:08:14,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:08:14,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 19:08:14,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:08:14,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:14,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 19:08:14,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:14,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 19:08:14,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-02-04 19:08:14,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:14,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:08:14,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:14,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:14,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 19:08:16,235 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 19:08:19,833 WARN L143 SmtUtils]: Spent 1864ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:08:19,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:19,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:19,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:19,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:19,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:19,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:19,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:21,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:21,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:21,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:21,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:21,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:21,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:23,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:23,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:23,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:23,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:23,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:23,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:23,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:25,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:25,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:25,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:25,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:25,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:25,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:25,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:27,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:27,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:27,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:27,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:27,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:27,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:29,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:29,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:29,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:29,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:29,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:29,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:29,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:08:30,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-04 19:08:30,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:30,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:08:30,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:08:30,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:30,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:30,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:30,920 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 19:08:33,319 WARN L146 SmtUtils]: Spent 2197ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 19:08:33,518 WARN L143 SmtUtils]: Spent 182ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 19:08:33,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-04 19:08:33,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:33,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:33,596 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:08:33,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-02-04 19:08:33,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:33,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:08:33,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 19:08:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 19:08:33,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:08:33,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:08:33,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:08:33,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:08:33,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 19:08:33,641 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 21 states. [2018-02-04 19:08:34,968 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 50 DAG size of output 41 [2018-02-04 19:08:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:35,299 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-02-04 19:08:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:08:35,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 19:08:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:35,300 INFO L225 Difference]: With dead ends: 174 [2018-02-04 19:08:35,300 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 19:08:35,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=155, Invalid=1033, Unknown=2, NotChecked=0, Total=1190 [2018-02-04 19:08:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 19:08:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-04 19:08:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 19:08:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2018-02-04 19:08:35,302 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 82 [2018-02-04 19:08:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:35,303 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2018-02-04 19:08:35,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:08:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2018-02-04 19:08:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 19:08:35,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:35,303 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:08:35,303 INFO L371 AbstractCegarLoop]: === Iteration 22 === [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 19:08:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1452983252, now seen corresponding path program 1 times [2018-02-04 19:08:35,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:35,304 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:35,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:35,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:35,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:08:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:08:35,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:08:35,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:08:35,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:08:35,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:08:35,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:08:35,349 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand 6 states. [2018-02-04 19:08:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:35,376 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-02-04 19:08:35,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:08:35,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-04 19:08:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:35,378 INFO L225 Difference]: With dead ends: 139 [2018-02-04 19:08:35,378 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 19:08:35,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:08:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 19:08:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-02-04 19:08:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 19:08:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-04 19:08:35,381 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 83 [2018-02-04 19:08:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:35,382 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-04 19:08:35,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:08:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-04 19:08:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 19:08:35,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:35,383 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 19:08:35,383 INFO L371 AbstractCegarLoop]: === Iteration 23 === [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 19:08:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 558282765, now seen corresponding path program 1 times [2018-02-04 19:08:35,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:35,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:35,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:08:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:08:35,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:35,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:35,462 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:35,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:08:35,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:08:35,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-04 19:08:35,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:08:35,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:08:35,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:08:35,522 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 11 states. [2018-02-04 19:08:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:35,709 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2018-02-04 19:08:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:08:35,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-02-04 19:08:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:35,710 INFO L225 Difference]: With dead ends: 195 [2018-02-04 19:08:35,710 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 19:08:35,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:08:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 19:08:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2018-02-04 19:08:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 19:08:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-04 19:08:35,713 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 84 [2018-02-04 19:08:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:35,713 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-04 19:08:35,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:08:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-04 19:08:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:08:35,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:35,714 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:08:35,714 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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 19:08:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 641539646, now seen corresponding path program 1 times [2018-02-04 19:08:35,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:35,714 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:35,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:35,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:35,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:08:35,741 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:08:35,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:35,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:35,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:35,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:35,831 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 19:08:35,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:35,850 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 19:08:35,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:35,882 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 19:08:35,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:35,884 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 19:08:35,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:35,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:08:35,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:08:36,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,033 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 43 treesize of output 47 [2018-02-04 19:08:36,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,064 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 41 treesize of output 50 [2018-02-04 19:08:36,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,100 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 41 treesize of output 44 [2018-02-04 19:08:36,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,126 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 40 treesize of output 44 [2018-02-04 19:08:36,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,150 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 19:08:36,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:08:36,338 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse0 (mod v_prenex_18 4294967296))) (and (< 2147483647 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_19 (+ .cse0 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_19) 0)))) (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse1 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse1) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse1 2147483647))))) is different from true [2018-02-04 19:08:36,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2018-02-04 19:08:36,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2018-02-04 19:08:36,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 73 [2018-02-04 19:08:36,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:08:36,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-02-04 19:08:36,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 92 [2018-02-04 19:08:36,767 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 77 [2018-02-04 19:08:36,843 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:36,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-02-04 19:08:36,959 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:37,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:08:37,020 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:08:55,580 WARN L146 SmtUtils]: Spent 18518ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:08:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 203 trivial. 6 not checked. [2018-02-04 19:08:55,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:08:55,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:08:55,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:08:55,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:08:55,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=205, Unknown=5, NotChecked=28, Total=272 [2018-02-04 19:08:55,612 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 17 states. [2018-02-04 19:10:10,506 WARN L146 SmtUtils]: Spent 34868ms on a formula simplification. DAG size of input: 100 DAG size of output 98 [2018-02-04 19:10:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:10,585 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2018-02-04 19:10:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:10:10,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-02-04 19:10:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:10,586 INFO L225 Difference]: With dead ends: 198 [2018-02-04 19:10:10,587 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 19:10:10,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=103, Invalid=705, Unknown=8, NotChecked=54, Total=870 [2018-02-04 19:10:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 19:10:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 161. [2018-02-04 19:10:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 19:10:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-02-04 19:10:10,591 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 85 [2018-02-04 19:10:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:10,591 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-02-04 19:10:10,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:10:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-02-04 19:10:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:10:10,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:10,591 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, 1, 1, 1] [2018-02-04 19:10:10,591 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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 19:10:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1920478082, now seen corresponding path program 1 times [2018-02-04 19:10:10,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:10,592 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:10,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:10,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:10,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:10,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:10,645 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 19:10:10,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:10,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:10:10,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:10,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:10,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:10,646 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 5 states. [2018-02-04 19:10:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:10,680 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-02-04 19:10:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:10,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-02-04 19:10:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:10,682 INFO L225 Difference]: With dead ends: 173 [2018-02-04 19:10:10,682 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 19:10:10,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 19:10:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2018-02-04 19:10:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 19:10:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2018-02-04 19:10:10,686 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 85 [2018-02-04 19:10:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:10,686 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2018-02-04 19:10:10,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2018-02-04 19:10:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:10:10,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:10,687 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 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] [2018-02-04 19:10:10,687 INFO L371 AbstractCegarLoop]: === Iteration 26 === [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 19:10:10,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1810246633, now seen corresponding path program 1 times [2018-02-04 19:10:10,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:10,688 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:10,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:10,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:10,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:10,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:10:10,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:10,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:10,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:10,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:10:10,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:10,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-02-04 19:10:10,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:10:10,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:10:10,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:10:10,929 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 18 states. [2018-02-04 19:10:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:11,387 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2018-02-04 19:10:11,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:10:11,387 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-04 19:10:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:11,388 INFO L225 Difference]: With dead ends: 178 [2018-02-04 19:10:11,388 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 19:10:11,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-02-04 19:10:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 19:10:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 155. [2018-02-04 19:10:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 19:10:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-02-04 19:10:11,391 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 86 [2018-02-04 19:10:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:11,391 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-02-04 19:10:11,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:10:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-02-04 19:10:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:10:11,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:11,392 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 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] [2018-02-04 19:10:11,392 INFO L371 AbstractCegarLoop]: === Iteration 27 === [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 19:10:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 283070766, now seen corresponding path program 1 times [2018-02-04 19:10:11,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:11,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:11,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:11,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:11,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:11,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 19:10:11,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:11,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:11,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:11,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:11,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:10:11,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:10:11,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:11,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:11,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:11,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:10:11,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:10:11,914 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:10:11,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-02-04 19:10:11,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:11,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:11,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:11,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:10:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:10:11,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:11,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 24 [2018-02-04 19:10:11,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:10:11,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:10:11,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:10:11,936 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 25 states. [2018-02-04 19:10:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:12,327 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2018-02-04 19:10:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:10:12,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-02-04 19:10:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:12,329 INFO L225 Difference]: With dead ends: 210 [2018-02-04 19:10:12,329 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 19:10:12,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1364, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:10:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 19:10:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2018-02-04 19:10:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 19:10:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2018-02-04 19:10:12,333 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 87 [2018-02-04 19:10:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:12,334 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2018-02-04 19:10:12,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:10:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2018-02-04 19:10:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:10:12,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:12,334 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 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] [2018-02-04 19:10:12,335 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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 19:10:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash 283070767, now seen corresponding path program 1 times [2018-02-04 19:10:12,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:12,335 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:12,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:12,336 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:12,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:12,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:10:12,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:12,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:12,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:12,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:12,775 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 19:10:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:12,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:10:12,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:10:12,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:10:12,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:10:12,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:10:12,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:10:12,896 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:10:12,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:10:12,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:12,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:10:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:10:12,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:12,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2018-02-04 19:10:12,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 19:10:12,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 19:10:12,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:10:12,931 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand 27 states. [2018-02-04 19:10:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:13,286 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-02-04 19:10:13,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:10:13,286 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-02-04 19:10:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:13,287 INFO L225 Difference]: With dead ends: 186 [2018-02-04 19:10:13,287 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 19:10:13,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:10:13,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 19:10:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2018-02-04 19:10:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 19:10:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-02-04 19:10:13,290 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 87 [2018-02-04 19:10:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:13,290 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-02-04 19:10:13,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 19:10:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-02-04 19:10:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:10:13,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:13,291 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:13,291 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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 19:10:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1189582988, now seen corresponding path program 1 times [2018-02-04 19:10:13,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:13,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:13,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:13,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:13,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:13,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:13,313 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:13,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:13,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:13,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:13,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:13,350 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 19:10:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,360 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 19:10:13,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:13,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:10:13,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:10:13,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:10:13,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2018-02-04 19:10:13,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:10:13,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:13,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 19:10:13,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:13,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-02-04 19:10:13,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-02-04 19:10:13,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:13,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:10:13,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:13,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:13,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-02-04 19:10:17,459 WARN L143 SmtUtils]: Spent 1971ms on a formula simplification that was a NOOP. DAG size: 41 [2018-02-04 19:10:17,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:10:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:10:17,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:17,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-02-04 19:10:19,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-04 19:10:19,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:19,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:10:19,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:19,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:19,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:19,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 Received shutdown request... [2018-02-04 19:10:21,113 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 19:10:21,113 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:10:21,116 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:10:21,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:10:21 BoogieIcfgContainer [2018-02-04 19:10:21,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:10:21,118 INFO L168 Benchmark]: Toolchain (without parser) took 213855.34 ms. Allocated memory was 398.5 MB in the beginning and 724.0 MB in the end (delta: 325.6 MB). Free memory was 355.2 MB in the beginning and 568.9 MB in the end (delta: -213.7 MB). Peak memory consumption was 111.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:21,119 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:10:21,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.71 ms. Allocated memory is still 398.5 MB. Free memory was 355.2 MB in the beginning and 342.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:21,119 INFO L168 Benchmark]: Boogie Preprocessor took 29.78 ms. Allocated memory is still 398.5 MB. Free memory was 342.0 MB in the beginning and 340.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:21,119 INFO L168 Benchmark]: RCFGBuilder took 231.74 ms. Allocated memory is still 398.5 MB. Free memory was 340.7 MB in the beginning and 317.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:21,120 INFO L168 Benchmark]: TraceAbstraction took 213423.04 ms. Allocated memory was 398.5 MB in the beginning and 724.0 MB in the end (delta: 325.6 MB). Free memory was 315.9 MB in the beginning and 568.9 MB in the end (delta: -253.1 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:21,121 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 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.71 ms. Allocated memory is still 398.5 MB. Free memory was 355.2 MB in the beginning and 342.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.78 ms. Allocated memory is still 398.5 MB. Free memory was 342.0 MB in the beginning and 340.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.74 ms. Allocated memory is still 398.5 MB. Free memory was 340.7 MB in the beginning and 317.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213423.04 ms. Allocated memory was 398.5 MB in the beginning and 724.0 MB in the end (delta: 325.6 MB). Free memory was 315.9 MB in the beginning and 568.9 MB in the end (delta: -253.1 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 213.3s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 134.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1888 SDtfs, 2146 SDslu, 12180 SDs, 0 SdLazy, 7578 SolverSat, 494 SolverUnsat, 76 SolverUnknown, 0 SolverNotchecked, 46.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1542 GetRequests, 1001 SyntacticMatches, 35 SemanticMatches, 506 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 153.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 428 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 70.4s InterpolantComputationTime, 2717 NumberOfCodeBlocks, 2645 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2425 ConstructedInterpolants, 182 QuantifiedInterpolants, 1234008 SizeOfPredicates, 102 NumberOfNonLiveVariables, 3676 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 43 InterpolantComputations, 11 PerfectInterpolantSequences, 3442/4638 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-10-21-127.csv 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-TraceAbstractionBenchmarks-0-2018-02-04_19-10-21-127.csv Completed graceful shutdown