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_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:07:11,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:07:11,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:07:11,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:07:11,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:07:11,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:07:11,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:07:11,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:07:11,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:07:11,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:07:11,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:07:11,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:07:11,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:07:11,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:07:11,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:07:11,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:07:11,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:07:11,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:07:11,781 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:07:11,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:07:11,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:07:11,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:07:11,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:07:11,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:07:11,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:07:11,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:07:11,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:07:11,787 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:07:11,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:07:11,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:07:11,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:07:11,788 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:07:11,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:07:11,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:07:11,797 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:07:11,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:07:11,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:07:11,798 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:07:11,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:07:11,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:07:11,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:07:11,800 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:07:11,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:07:11,800 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:07:11,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:07:11,832 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:07:11,834 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:07:11,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:07:11,836 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:07:11,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-04 19:07:11,977 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:07:11,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:07:11,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:07:11,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:07:11,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:07:11,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:07:11" (1/1) ... [2018-02-04 19:07:11,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:11, skipping insertion in model container [2018-02-04 19:07:11,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:07:11" (1/1) ... [2018-02-04 19:07:12,002 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:07:12,036 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:07:12,128 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:07:12,141 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:07:12,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12 WrapperNode [2018-02-04 19:07:12,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:07:12,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:07:12,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:07:12,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:07:12,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (1/1) ... [2018-02-04 19:07:12,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:07:12,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:07:12,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:07:12,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:07:12,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (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:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 19:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:07:12,218 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:07:12,218 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:07:12,219 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 19:07:12,220 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:07:12,220 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:07:12,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:07:12,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:07:12,396 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:07:12,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:07:12 BoogieIcfgContainer [2018-02-04 19:07:12,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:07:12,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:07:12,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:07:12,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:07:12,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:07:11" (1/3) ... [2018-02-04 19:07:12,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ff696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:07:12, skipping insertion in model container [2018-02-04 19:07:12,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:07:12" (2/3) ... [2018-02-04 19:07:12,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ff696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:07:12, skipping insertion in model container [2018-02-04 19:07:12,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:07:12" (3/3) ... [2018-02-04 19:07:12,402 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-04 19:07:12,407 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:07:12,411 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 19:07:12,442 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:07:12,442 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:07:12,442 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:07:12,442 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:07:12,442 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:07:12,442 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:07:12,442 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:07:12,443 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:07:12,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:07:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 19:07:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:07:12,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:12,464 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:07:12,465 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-04 19:07:12,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:12,471 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:12,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:12,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:12,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:12,563 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:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:07:12,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:12,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:07:12,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:07:12,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:07:12,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:07:12,703 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-04 19:07:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:12,804 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-04 19:07:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:07:12,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:07:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:12,816 INFO L225 Difference]: With dead ends: 102 [2018-02-04 19:07:12,816 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 19:07:12,818 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:07:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 19:07:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-04 19:07:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 19:07:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-04 19:07:12,850 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-04 19:07:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:12,851 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-04 19:07:12,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:07:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-04 19:07:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:07:12,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:12,852 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:07:12,852 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-04 19:07:12,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:12,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:12,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:12,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:12,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:12,866 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:12,933 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:07:12,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:12,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:07:12,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:07:12,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:07:12,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:07:12,936 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-04 19:07:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:12,977 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 19:07:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:07:12,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 19:07:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:12,979 INFO L225 Difference]: With dead ends: 65 [2018-02-04 19:07:12,979 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 19:07:12,980 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:07:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 19:07:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-04 19:07:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 19:07:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-04 19:07:12,985 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-04 19:07:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:12,985 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-04 19:07:12,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:07:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-04 19:07:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:07:12,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:12,986 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:07:12,986 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-04 19:07:12,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:12,987 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:12,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:12,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:12,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:13,001 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:13,041 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:07:13,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:13,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:07:13,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:07:13,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:07:13,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:07:13,042 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-04 19:07:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:13,076 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-04 19:07:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:07:13,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:07:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:13,077 INFO L225 Difference]: With dead ends: 61 [2018-02-04 19:07:13,077 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 19:07:13,077 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:07:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 19:07:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 19:07:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 19:07:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 19:07:13,082 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-04 19:07:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:13,082 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 19:07:13,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:07:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 19:07:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:07:13,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:13,083 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:07:13,083 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:13,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-04 19:07:13,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:13,083 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:13,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:13,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:13,095 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:13,143 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:07:13,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:13,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:07:13,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:07:13,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:07:13,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:07:13,143 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-04 19:07:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:13,231 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 19:07:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:07:13,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:07:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:13,232 INFO L225 Difference]: With dead ends: 60 [2018-02-04 19:07:13,232 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 19:07:13,232 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:07:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 19:07:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 19:07:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:07:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 19:07:13,235 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-04 19:07:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:13,236 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 19:07:13,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:07:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 19:07:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:07:13,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:13,236 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:07:13,237 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-04 19:07:13,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:13,238 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:13,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:13,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:13,252 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:13,462 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:07:13,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:13,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:07:13,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:07:13,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:07:13,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:07:13,463 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-04 19:07:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:13,636 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 19:07:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:07:13,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 19:07:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:13,637 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:07:13,637 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 19:07:13,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:07:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 19:07:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-04 19:07:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 19:07:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 19:07:13,641 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-04 19:07:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:13,641 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 19:07:13,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:07:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 19:07:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:07:13,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:13,642 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:07:13,642 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:13,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-04 19:07:13,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:13,642 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:13,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:13,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:13,653 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:13,833 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:07:13,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:13,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:13,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:13,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:13,906 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:13,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:13,925 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:13,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:13,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:07:13,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:07:14,159 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:07:14,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:14,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 19:07:14,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:07:14,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:07:14,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:07:14,160 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 19 states. [2018-02-04 19:07:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:14,551 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 19:07:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:07:14,551 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 19:07:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:14,552 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:07:14,552 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:07:14,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:07:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:07:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-02-04 19:07:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:07:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 19:07:14,555 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-02-04 19:07:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:14,556 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 19:07:14,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:07:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 19:07:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:07:14,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:14,557 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:07:14,557 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-04 19:07:14,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:14,557 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:14,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:14,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:14,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:14,569 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:14,767 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:07:14,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:14,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:14,768 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:07:14,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:07:14,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:14,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:14,817 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:14,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:14,827 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:14,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:14,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:07:14,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:07:15,002 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:07:15,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:15,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 19:07:15,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:07:15,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:07:15,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:07:15,003 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 23 states. [2018-02-04 19:07:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,187 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-04 19:07:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:07:15,187 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 19:07:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,188 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:07:15,188 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 19:07:15,188 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:07:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 19:07:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 19:07:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 19:07:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 19:07:15,191 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 27 [2018-02-04 19:07:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,191 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 19:07:15,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:07:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 19:07:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:07:15,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,192 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] [2018-02-04 19:07:15,195 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737492, now seen corresponding path program 1 times [2018-02-04 19:07:15,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,196 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:15,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,204 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:15,223 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:07:15,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:15,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:07:15,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:07:15,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:07:15,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:07:15,224 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 4 states. [2018-02-04 19:07:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,292 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-02-04 19:07:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:07:15,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 19:07:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,293 INFO L225 Difference]: With dead ends: 90 [2018-02-04 19:07:15,293 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 19:07:15,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:07:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 19:07:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-02-04 19:07:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:07:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-02-04 19:07:15,296 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 35 [2018-02-04 19:07:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,296 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-02-04 19:07:15,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:07:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-02-04 19:07:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:07:15,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,297 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] [2018-02-04 19:07:15,297 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737491, now seen corresponding path program 1 times [2018-02-04 19:07:15,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,297 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,298 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,302 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:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 19:07:15,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:15,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:07:15,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:07:15,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:07:15,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:07:15,320 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 6 states. [2018-02-04 19:07:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,332 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-02-04 19:07:15,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:07:15,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 19:07:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,333 INFO L225 Difference]: With dead ends: 80 [2018-02-04 19:07:15,333 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 19:07:15,333 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:07:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 19:07:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 19:07:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 19:07:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-02-04 19:07:15,336 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 35 [2018-02-04 19:07:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,336 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2018-02-04 19:07:15,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:07:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-02-04 19:07:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:07:15,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,337 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:07:15,337 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1277044790, now seen corresponding path program 1 times [2018-02-04 19:07:15,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,337 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,345 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:15,369 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:07:15,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:07:15,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:07:15,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:07:15,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:07:15,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:07:15,369 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 5 states. [2018-02-04 19:07:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,377 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-04 19:07:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:07:15,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 19:07:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,378 INFO L225 Difference]: With dead ends: 84 [2018-02-04 19:07:15,378 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:07:15,378 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:07:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:07:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-02-04 19:07:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 19:07:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-04 19:07:15,381 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 38 [2018-02-04 19:07:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,382 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-04 19:07:15,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:07:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-04 19:07:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:07:15,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,382 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] [2018-02-04 19:07:15,383 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 1 times [2018-02-04 19:07:15,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,390 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:15,420 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:07:15,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:15,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:15,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:15,459 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:07:15,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:15,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:07:15,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:07:15,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:07:15,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:07:15,460 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 9 states. [2018-02-04 19:07:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,497 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-04 19:07:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:07:15,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 19:07:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,498 INFO L225 Difference]: With dead ends: 86 [2018-02-04 19:07:15,498 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 19:07:15,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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:07:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 19:07:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-04 19:07:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 19:07:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-04 19:07:15,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-04 19:07:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,502 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-04 19:07:15,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:07:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-04 19:07:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:07:15,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,504 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] [2018-02-04 19:07:15,504 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,504 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 2 times [2018-02-04 19:07:15,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,504 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,521 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:15,568 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:07:15,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:15,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:15,569 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:07:15,577 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 19:07:15,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:15,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:15,598 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:07:15,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:07:15,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 19:07:15,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:07:15,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:07:15,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:07:15,599 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 9 states. [2018-02-04 19:07:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,685 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-04 19:07:15,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:07:15,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 19:07:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,686 INFO L225 Difference]: With dead ends: 115 [2018-02-04 19:07:15,686 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 19:07:15,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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:07:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 19:07:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2018-02-04 19:07:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:07:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 19:07:15,690 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2018-02-04 19:07:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,690 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 19:07:15,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:07:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 19:07:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:07:15,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,691 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:07:15,691 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1262891178, now seen corresponding path program 1 times [2018-02-04 19:07:15,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,692 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:15,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,702 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:15,748 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:07:15,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:15,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:15,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:15,811 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:07:15,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:15,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 19:07:15,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:07:15,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:07:15,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:07:15,812 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states. [2018-02-04 19:07:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:15,851 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 19:07:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:07:15,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 19:07:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:15,853 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:07:15,853 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:07:15,853 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:07:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:07:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 19:07:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 19:07:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-02-04 19:07:15,856 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 48 [2018-02-04 19:07:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:15,857 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-02-04 19:07:15,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:07:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-02-04 19:07:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:07:15,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:15,858 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:07:15,858 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:15,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2016472243, now seen corresponding path program 2 times [2018-02-04 19:07:15,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:15,858 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:15,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:07:15,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:15,868 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:15,914 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:07:15,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:15,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:15,915 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:07:15,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:07:15,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:15,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:15,990 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:07:15,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:15,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 19:07:15,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:07:15,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:07:15,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:07:15,991 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 15 states. [2018-02-04 19:07:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:07:16,031 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-04 19:07:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:07:16,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 19:07:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:07:16,032 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:07:16,032 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:07:16,032 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:07:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:07:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:07:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:07:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 19:07:16,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 52 [2018-02-04 19:07:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:07:16,038 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 19:07:16,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:07:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 19:07:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:07:16,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:07:16,039 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:07:16,039 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:07:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2044492860, now seen corresponding path program 3 times [2018-02-04 19:07:16,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:07:16,040 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:07:16,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:16,041 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:07:16,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:07:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:07:16,059 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:16,128 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:07:16,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:07:16,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:07:16,129 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:07:16,150 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:07:16,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:07:16,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:07:16,186 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:07:16,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,199 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:07:16,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,201 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:07:16,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,214 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:07:16,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:07:16,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:07:16,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,412 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:07:16,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,435 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:07:16,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,462 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:07:16,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:07:16,482 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:07:16,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:07:16,497 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:07:16,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:07:16,548 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:07:16,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:07:16,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 19:07:16,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:07:16,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:07:16,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 19:07:16,549 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 21 states. [2018-02-04 19:07:37,941 WARN L143 SmtUtils]: Spent 14097ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 19:08:02,335 WARN L146 SmtUtils]: Spent 24332ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 19:08:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:02,661 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2018-02-04 19:08:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:08:02,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 19:08:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:02,662 INFO L225 Difference]: With dead ends: 162 [2018-02-04 19:08:02,662 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 19:08:02,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 19:08:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 19:08:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2018-02-04 19:08:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 19:08:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-04 19:08:02,667 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 56 [2018-02-04 19:08:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:02,667 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-04 19:08:02,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:08:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-04 19:08:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:08:02,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:02,668 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:08:02,668 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1800200380, now seen corresponding path program 1 times [2018-02-04 19:08:02,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:02,668 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:02,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:02,669 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:08:02,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:02,679 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:02,743 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:08:02,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:02,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:02,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:02,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:02,870 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:08:02,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:08:02,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 19:08:02,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:08:02,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:08:02,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:08:02,871 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 19 states. [2018-02-04 19:08:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:02,922 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-02-04 19:08:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:08:02,922 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 19:08:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:02,923 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:08:02,923 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 19:08:02,924 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:08:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 19:08:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 19:08:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 19:08:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-02-04 19:08:02,926 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 60 [2018-02-04 19:08:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:02,927 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-02-04 19:08:02,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:08:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-02-04 19:08:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:08:02,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:02,927 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:08:02,927 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1308562893, now seen corresponding path program 2 times [2018-02-04 19:08:02,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:02,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:02,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:02,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:02,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:02,938 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:03,034 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:08:03,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:03,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:03,034 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:08:03,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:08:03,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:08:03,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:03,129 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:08:03,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:08:03,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 19:08:03,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:08:03,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:08:03,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:08:03,131 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 21 states. [2018-02-04 19:08:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:03,190 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-02-04 19:08:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:08:03,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 19:08:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:03,192 INFO L225 Difference]: With dead ends: 124 [2018-02-04 19:08:03,192 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 19:08:03,192 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:08:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 19:08:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-04 19:08:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 19:08:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-02-04 19:08:03,198 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 64 [2018-02-04 19:08:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:03,198 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-02-04 19:08:03,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:08:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-02-04 19:08:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 19:08:03,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:03,199 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:08:03,200 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -68509738, now seen corresponding path program 3 times [2018-02-04 19:08:03,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:03,200 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:03,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:03,201 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:08:03,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:03,215 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:03,322 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:08:03,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:03,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:03,323 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:08:03,335 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:08:03,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:08:03,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:03,342 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:08:03,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:08:03,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:03,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:03,457 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:08:03,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:03,462 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:08:03,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:08:03,488 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:08:03,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:08:03,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-04 19:08:03,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:08:03,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:08:03,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:08:03,490 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 22 states. [2018-02-04 19:08:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:04,005 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2018-02-04 19:08:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:08:04,005 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 19:08:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:04,006 INFO L225 Difference]: With dead ends: 159 [2018-02-04 19:08:04,006 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 19:08:04,006 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:08:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 19:08:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2018-02-04 19:08:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:08:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-04 19:08:04,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 68 [2018-02-04 19:08:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:04,009 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-04 19:08:04,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:08:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-04 19:08:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 19:08:04,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:04,009 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:08:04,009 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-02-04 19:08:04,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:04,010 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:04,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,010 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:08:04,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,017 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:04,032 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:08:04,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:08:04,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:08:04,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:08:04,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:08:04,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:08:04,032 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-02-04 19:08:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:04,050 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 19:08:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:08:04,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 19:08:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:04,051 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:08:04,051 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 19:08:04,051 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:08:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 19:08:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-02-04 19:08:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 19:08:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-04 19:08:04,054 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-02-04 19:08:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:04,054 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-04 19:08:04,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:08:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-04 19:08:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 19:08:04,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:04,055 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] [2018-02-04 19:08:04,055 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-02-04 19:08:04,055 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:04,055 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:04,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,066 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:04,077 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:08:04,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:04,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:04,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 19:08:04,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:08:04,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 19:08:04,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:08:04,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:08:04,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2018-02-04 19:08:04,194 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 9 states. [2018-02-04 19:08:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:04,324 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 19:08:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:08:04,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-02-04 19:08:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:04,325 INFO L225 Difference]: With dead ends: 125 [2018-02-04 19:08:04,325 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 19:08:04,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=64, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:08:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 19:08:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 19:08:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:08:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-02-04 19:08:04,329 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-02-04 19:08:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:04,329 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-02-04 19:08:04,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:08:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-02-04 19:08:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 19:08:04,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:04,330 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] [2018-02-04 19:08:04,330 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-02-04 19:08:04,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:04,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:04,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,340 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:04,383 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:04,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:08:04,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:08:04,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:08:04,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:08:04,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:08:04,384 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-02-04 19:08:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:04,409 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 19:08:04,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:08:04,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-04 19:08:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:04,410 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:08:04,410 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:08:04,411 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:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:08:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 19:08:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:08:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 19:08:04,413 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-02-04 19:08:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:04,414 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 19:08:04,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:08:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 19:08:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 19:08:04,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:04,415 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] [2018-02-04 19:08:04,415 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-02-04 19:08:04,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:04,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:04,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,429 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:04,473 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:04,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:04,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:04,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:04,524 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:04,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:08:04,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 19:08:04,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:08:04,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:08:04,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:08:04,526 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 8 states. [2018-02-04 19:08:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:08:04,571 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-02-04 19:08:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:08:04,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-02-04 19:08:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:08:04,572 INFO L225 Difference]: With dead ends: 144 [2018-02-04 19:08:04,572 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 19:08:04,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:08:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 19:08:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-02-04 19:08:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:08:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-04 19:08:04,575 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-02-04 19:08:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:08:04,576 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-04 19:08:04,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:08:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-04 19:08:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:08:04,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:08:04,577 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:04,577 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:08:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-02-04 19:08:04,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:08:04,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:08:04,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:08:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,590 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:04,597 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:08:04,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:08:04,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:08:04,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:08:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:08:04,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:08:04,634 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:04,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,636 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:04,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,654 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:04,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,671 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:04,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:08:04,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:08:04,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,814 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 43 treesize of output 56 [2018-02-04 19:08:04,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,836 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 42 treesize of output 46 [2018-02-04 19:08:04,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,855 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:04,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:04,874 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:04,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:04,896 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:04,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:08:06,090 WARN L143 SmtUtils]: Spent 732ms on a formula simplification that was a NOOP. DAG size: 42 [2018-02-04 19:08:06,419 WARN L143 SmtUtils]: Spent 279ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 19:08:06,751 WARN L143 SmtUtils]: Spent 311ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 19:08:06,759 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse1 (mod v_prenex_13 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_14) 0) (< 2147483647 .cse1) (= (store |c_old(#length)| v_prenex_14 (+ .cse1 (- 4294967296))) |c_#length|))))) is different from true [2018-02-04 19:08:06,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,772 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 63 treesize of output 63 [2018-02-04 19:08:06,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:06,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,847 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:06,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:06,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:06,927 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 61 treesize of output 88 [2018-02-04 19:08:06,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,004 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 60 treesize of output 64 [2018-02-04 19:08:07,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,087 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:07,087 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,159 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:07,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,225 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 56 treesize of output 55 [2018-02-04 19:08:07,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:08:07,289 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:07,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:08:07,347 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:07,348 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:08:35,366 WARN L146 SmtUtils]: Spent 26855ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:08:35,394 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:35,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:08:35,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:08:35,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:08:35,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:08:35,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=208, Unknown=2, NotChecked=28, Total=272 [2018-02-04 19:08:35,395 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 17 states. [2018-02-04 19:08:35,679 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 19:09:44,450 WARN L146 SmtUtils]: Spent 29424ms on a formula simplification. DAG size of input: 100 DAG size of output 98 [2018-02-04 19:09:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:09:44,528 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-04 19:09:44,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:09:44,528 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-02-04 19:09:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:09:44,529 INFO L225 Difference]: With dead ends: 135 [2018-02-04 19:09:44,529 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 19:09:44,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 63.9s TimeCoverageRelationStatistics Valid=103, Invalid=707, Unknown=6, NotChecked=54, Total=870 [2018-02-04 19:09:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 19:09:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2018-02-04 19:09:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 19:09:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-02-04 19:09:44,531 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 85 [2018-02-04 19:09:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:09:44,531 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-02-04 19:09:44,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:09:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-02-04 19:09:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:09:44,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:09:44,532 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:09:44,532 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:09:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1398657356, now seen corresponding path program 1 times [2018-02-04 19:09:44,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:09:44,532 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:09:44,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:44,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:44,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:44,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:09:44,650 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:09:44,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:09:44,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:09:44,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:44,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:09:44,768 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:09:44,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:09:44,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-02-04 19:09:44,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:09:44,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:09:44,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:09:44,770 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 18 states. [2018-02-04 19:09:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:09:45,219 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-04 19:09:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:09:45,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-04 19:09:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:09:45,220 INFO L225 Difference]: With dead ends: 137 [2018-02-04 19:09:45,220 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 19:09:45,221 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:09:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 19:09:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-02-04 19:09:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 19:09:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-04 19:09:45,224 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 86 [2018-02-04 19:09:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:09:45,225 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-04 19:09:45,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:09:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-04 19:09:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:09:45,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:09:45,226 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:09:45,226 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:09:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 408705067, now seen corresponding path program 1 times [2018-02-04 19:09:45,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:09:45,226 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:09:45,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:45,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:45,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:45,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:09:45,505 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:09:45,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:09:45,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:09:45,506 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:45,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:09:45,627 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:09:45,629 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:09:45,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:45,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:45,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:45,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:09:45,687 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:09:45,689 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:09:45,689 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:09:45,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:45,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:45,694 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:09:45,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:09:45,727 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:09:45,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:09:45,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 24 [2018-02-04 19:09:45,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:09:45,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:09:45,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:09:45,728 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 25 states. [2018-02-04 19:09:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:09:46,018 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-02-04 19:09:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:09:46,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-02-04 19:09:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:09:46,018 INFO L225 Difference]: With dead ends: 151 [2018-02-04 19:09:46,018 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 19:09:46,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:09:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 19:09:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-02-04 19:09:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 19:09:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-02-04 19:09:46,021 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 87 [2018-02-04 19:09:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:09:46,021 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-02-04 19:09:46,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:09:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-02-04 19:09:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:09:46,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:09:46,022 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:09:46,022 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:09:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 408705068, now seen corresponding path program 1 times [2018-02-04 19:09:46,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:09:46,022 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:09:46,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:46,022 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:46,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:46,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:09:46,335 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:09:46,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:09:46,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:09:46,336 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:46,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:09:46,427 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:09:46,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:09:46,458 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:09:46,459 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:09:46,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,465 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:09:46,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:09:46,480 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:09:46,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,481 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:09:46,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:09:46,496 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:09:46,497 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:09:46,497 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:09:46,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,502 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:09:46,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:09:46,514 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:09:46,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:09:46,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2018-02-04 19:09:46,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 19:09:46,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 19:09:46,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:09:46,516 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 27 states. [2018-02-04 19:09:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:09:46,880 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-02-04 19:09:46,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:09:46,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-02-04 19:09:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:09:46,881 INFO L225 Difference]: With dead ends: 139 [2018-02-04 19:09:46,881 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 19:09:46,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:09:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 19:09:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-02-04 19:09:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 19:09:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-02-04 19:09:46,885 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 87 [2018-02-04 19:09:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:09:46,886 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-02-04 19:09:46,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 19:09:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-02-04 19:09:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 19:09:46,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:09:46,887 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, 1, 1] [2018-02-04 19:09:46,887 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:09:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1923546252, now seen corresponding path program 1 times [2018-02-04 19:09:46,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:09:46,887 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:09:46,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:46,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:46,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:09:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:46,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:09:46,910 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:09:46,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:09:46,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:09:46,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:09:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:09:46,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:09:46,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 6 treesize of output 5 [2018-02-04 19:09:46,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:46,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:09:47,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:09:47,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:09:47,073 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 11 treesize of output 4 [2018-02-04 19:09:47,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:47,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:47,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 19:09:47,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:09:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 11 [2018-02-04 19:09:47,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:47,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:47,119 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:09:47,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-04 19:09:47,200 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 5 treesize of output 1 [2018-02-04 19:09:47,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:47,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:09:47,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:29 [2018-02-04 19:09:51,229 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-04 19:09:51,299 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 24 treesize of output 20 [2018-02-04 19:09:51,300 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:09:51,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2018-02-04 19:09:51,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:51,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:51,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:09:51,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:10 [2018-02-04 19:09:51,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:09:51,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 19:09:51,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:09:51,360 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 2 xjuncts. [2018-02-04 19:09:51,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 19:09:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 19:09:51,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:09:51,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:09:51,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:09:51,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:09:51,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=303, Unknown=1, NotChecked=0, Total=342 [2018-02-04 19:09:51,392 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 19 states. [2018-02-04 19:10:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:14,307 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-04 19:10:14,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:10:14,308 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-04 19:10:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:14,309 INFO L225 Difference]: With dead ends: 158 [2018-02-04 19:10:14,309 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 19:10:14,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=94, Invalid=717, Unknown=1, NotChecked=0, Total=812 [2018-02-04 19:10:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 19:10:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-04 19:10:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 19:10:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-04 19:10:14,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 89 [2018-02-04 19:10:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:14,313 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-04 19:10:14,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:10:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-04 19:10:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 19:10:14,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:14,314 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, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:14,314 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1757191147, now seen corresponding path program 1 times [2018-02-04 19:10:14,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:14,314 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:14,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:14,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,325 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:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-04 19:10:14,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:14,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:14,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:10:14,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:14,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2018-02-04 19:10:14,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:10:14,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:10:14,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:10:14,462 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 14 states. [2018-02-04 19:10:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:14,591 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-04 19:10:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:10:14,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-04 19:10:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:14,592 INFO L225 Difference]: With dead ends: 143 [2018-02-04 19:10:14,592 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 19:10:14,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:10:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 19:10:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 19:10:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 19:10:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-04 19:10:14,596 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 93 [2018-02-04 19:10:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:14,596 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-04 19:10:14,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:10:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-04 19:10:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 19:10:14,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:14,597 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 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, 1] [2018-02-04 19:10:14,597 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash 988408539, now seen corresponding path program 1 times [2018-02-04 19:10:14,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:14,598 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:14,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:14,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,610 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:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:10:14,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:14,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:14,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:10:14,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:14,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 19:10:14,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:10:14,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:10:14,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:14,673 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 7 states. [2018-02-04 19:10:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:14,714 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-02-04 19:10:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:14,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-02-04 19:10:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:14,715 INFO L225 Difference]: With dead ends: 143 [2018-02-04 19:10:14,715 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 19:10:14,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:10:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 19:10:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-02-04 19:10:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 19:10:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2018-02-04 19:10:14,718 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 94 [2018-02-04 19:10:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:14,718 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2018-02-04 19:10:14,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:10:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2018-02-04 19:10:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 19:10:14,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:14,719 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 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:14,719 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -549703530, now seen corresponding path program 2 times [2018-02-04 19:10:14,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:14,720 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:14,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:14,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,731 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:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 19:10:14,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:14,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:14,780 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:10:14,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:10:14,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:10:14,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 19:10:14,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:14,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-02-04 19:10:14,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:10:14,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:10:14,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:10:14,831 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand 10 states. [2018-02-04 19:10:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:14,889 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-02-04 19:10:14,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:14,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-02-04 19:10:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:14,890 INFO L225 Difference]: With dead ends: 172 [2018-02-04 19:10:14,890 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 19:10:14,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:10:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 19:10:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2018-02-04 19:10:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 19:10:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-02-04 19:10:14,893 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 96 [2018-02-04 19:10:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:14,894 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-02-04 19:10:14,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:10:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-02-04 19:10:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 19:10:14,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:14,895 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:14,895 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash -393848512, now seen corresponding path program 2 times [2018-02-04 19:10:14,895 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:14,895 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:14,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,896 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:10:14,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:14,908 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:14,929 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:14,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:14,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:14,930 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:10:14,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:10:14,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:10:14,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:14,971 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:14,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:14,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:14,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:15,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,120 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 40 treesize of output 34 [2018-02-04 19:10:15,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:15,146 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 34 treesize of output 33 [2018-02-04 19:10:15,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:15,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,173 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 42 treesize of output 36 [2018-02-04 19:10:15,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:15,192 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 36 treesize of output 35 [2018-02-04 19:10:15,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:15,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:10:15,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:69 [2018-02-04 19:10:15,475 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_38 Int) (v_prenex_39 Int)) (let ((.cse1 (mod v_prenex_38 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_39 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1) (<= (select |c_old(#valid)| v_prenex_39) 0))))) is different from true [2018-02-04 19:10:15,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-02-04 19:10:15,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:15,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 82 [2018-02-04 19:10:15,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:15,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 94 [2018-02-04 19:10:15,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:15,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:15,888 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 2 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:10:15,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:16,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:10:16,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,043 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 19:10:16,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-02-04 19:10:16,163 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:16,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 19:10:16,339 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,342 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-02-04 19:10:16,342 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,496 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:10:16,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:16,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:10:16,500 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:16,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 19:10:16,686 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:261, output treesize:373 [2018-02-04 19:10:17,071 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 193 DAG size of output 50 [2018-02-04 19:10:17,157 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 Int) (v_prenex_71 Int)) (let ((.cse0 (mod v_prenex_70 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_71 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0) (<= (select |c_old(#valid)| v_prenex_71) 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:10:17,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,172 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 2 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:10:17,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:17,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,270 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-02-04 19:10:17,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-02-04 19:10:17,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:17,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-02-04 19:10:17,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 84 [2018-02-04 19:10:17,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:17,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 19:10:17,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:10:17,779 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-02-04 19:10:17,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:17,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:17,891 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 19:10:17,892 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:18,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:18,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:18,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 82 [2018-02-04 19:10:18,063 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 19:10:18,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 19:10:18,213 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 28 variables, input treesize:261, output treesize:373 [2018-02-04 19:10:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 15 not checked. [2018-02-04 19:10:18,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:18,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:10:18,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:10:18,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:10:18,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=330, Unknown=6, NotChecked=74, Total=462 [2018-02-04 19:10:18,406 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 22 states. [2018-02-04 19:10:18,452 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse5 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse5) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse5 2147483647)))))) (and (or (exists ((v_prenex_70 Int) (v_prenex_71 Int)) (let ((.cse0 (mod v_prenex_70 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_71 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0) (<= (select |c_old(#valid)| v_prenex_71) 0)))) .cse1) (= 1 (select |c_#valid| |c_ldv_malloc_#t~malloc1.base|)) (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse2 (mod ldv_malloc_~size 4294967296))) (and (= 0 (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|)) (< 2147483647 .cse2) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| (+ .cse2 (- 4294967296))))))) (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse3 (mod v_prenex_33 4294967296))) (and (<= .cse3 2147483647) (= (store |c_old(#length)| v_prenex_34 .cse3) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_34)))))) (or .cse1 (exists ((v_prenex_38 Int) (v_prenex_39 Int)) (let ((.cse4 (mod v_prenex_38 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_39 (+ .cse4 (- 4294967296)))) (< 2147483647 .cse4) (<= (select |c_old(#valid)| v_prenex_39) 0))))))) is different from true [2018-02-04 19:10:31,046 WARN L143 SmtUtils]: Spent 12204ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 19:10:47,364 WARN L143 SmtUtils]: Spent 16282ms on a formula simplification that was a NOOP. DAG size: 74 Received shutdown request... [2018-02-04 19:10:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:10:49,430 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:10:49,433 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:10:49,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:10:49 BoogieIcfgContainer [2018-02-04 19:10:49,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:10:49,434 INFO L168 Benchmark]: Toolchain (without parser) took 217456.54 ms. Allocated memory was 408.4 MB in the beginning and 779.6 MB in the end (delta: 371.2 MB). Free memory was 365.3 MB in the beginning and 563.1 MB in the end (delta: -197.8 MB). Peak memory consumption was 173.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:49,435 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:10:49,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.39 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 352.1 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:49,435 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 350.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:49,435 INFO L168 Benchmark]: RCFGBuilder took 218.35 ms. Allocated memory is still 408.4 MB. Free memory was 350.7 MB in the beginning and 328.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:49,436 INFO L168 Benchmark]: TraceAbstraction took 217036.44 ms. Allocated memory was 408.4 MB in the beginning and 779.6 MB in the end (delta: 371.2 MB). Free memory was 328.6 MB in the beginning and 563.1 MB in the end (delta: -234.5 MB). Peak memory consumption was 136.7 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:49,436 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.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.39 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 352.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 350.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 218.35 ms. Allocated memory is still 408.4 MB. Free memory was 350.7 MB in the beginning and 328.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 217036.44 ms. Allocated memory was 408.4 MB in the beginning and 779.6 MB in the end (delta: 371.2 MB). Free memory was 328.6 MB in the beginning and 563.1 MB in the end (delta: -234.5 MB). Peak memory consumption was 136.7 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 constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (142states) and interpolant automaton (currently 15 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 216.9s OverallTime, 31 OverallIterations, 11 TraceHistogramMax, 172.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1647 SDtfs, 1770 SDslu, 10202 SDs, 0 SdLazy, 5511 SolverSat, 361 SolverUnsat, 76 SolverUnknown, 0 SolverNotchecked, 66.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 1318 SyntacticMatches, 12 SemanticMatches, 486 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 141.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=27, 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, 30 MinimizatonAttempts, 327 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 43.1s InterpolantComputationTime, 3266 NumberOfCodeBlocks, 3194 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2866 ConstructedInterpolants, 101 QuantifiedInterpolants, 1254176 SizeOfPredicates, 103 NumberOfNonLiveVariables, 4602 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 48 InterpolantComputations, 12 PerfectInterpolantSequences, 4573/5646 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_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-10-49-441.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-10-49-441.csv Completed graceful shutdown