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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:38:42,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:38:42,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:38:42,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:38:42,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:38:42,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:38:42,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:38:42,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:38:42,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:38:42,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:38:42,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:38:42,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:38:42,708 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:38:42,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:38:42,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:38:42,713 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:38:42,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:38:42,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:38:42,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:38:42,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:38:42,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:38:42,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:38:42,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:38:42,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:38:42,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:38:42,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:38:42,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:38:42,726 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:38:42,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:38:42,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:38:42,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:38:42,728 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:38:42,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:38:42,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:38:42,738 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:38:42,739 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:38:42,739 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:38:42,739 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:38:42,739 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:38:42,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:38:42,740 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:38:42,740 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:38:42,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:38:42,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:38:42,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:38:42,741 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:38:42,741 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:38:42,741 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:38:42,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:38:42,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:38:42,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:38:42,742 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:38:42,742 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:38:42,742 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:38:42,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:38:42,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:38:42,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:38:42,743 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:38:42,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:38:42,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:38:42,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:38:42,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:38:42,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:38:42,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:38:42,745 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:38:42,745 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:38:42,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:38:42,793 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:38:42,797 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:38:42,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:38:42,799 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:38:42,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-28 22:38:42,983 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:38:42,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:38:42,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:38:42,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:38:42,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:38:42,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:38:42" (1/1) ... [2018-01-28 22:38:43,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:42, skipping insertion in model container [2018-01-28 22:38:43,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:38:42" (1/1) ... [2018-01-28 22:38:43,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:38:43,061 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:38:43,172 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:38:43,188 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:38:43,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43 WrapperNode [2018-01-28 22:38:43,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:38:43,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:38:43,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:38:43,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:38:43,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... [2018-01-28 22:38:43,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:38:43,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:38:43,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:38:43,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:38:43,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (1/1) ... No working directory specified, using /storage/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-01-28 22:38:43,278 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:38:43,278 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:38:43,278 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:38:43,279 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:38:43,279 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:38:43,279 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:38:43,279 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:38:43,279 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:38:43,279 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:38:43,280 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:38:43,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:38:43,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:38:43,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:38:43,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:38:43 BoogieIcfgContainer [2018-01-28 22:38:43,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:38:43,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:38:43,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:38:43,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:38:43,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:38:42" (1/3) ... [2018-01-28 22:38:43,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee19848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:38:43, skipping insertion in model container [2018-01-28 22:38:43,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:38:43" (2/3) ... [2018-01-28 22:38:43,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee19848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:38:43, skipping insertion in model container [2018-01-28 22:38:43,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:38:43" (3/3) ... [2018-01-28 22:38:43,483 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-28 22:38:43,490 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:38:43,496 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 22:38:43,541 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:38:43,541 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:38:43,541 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:38:43,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:38:43,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:38:43,542 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:38:43,542 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:38:43,542 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:38:43,543 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:38:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-28 22:38:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 22:38:43,571 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:43,572 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:38:43,573 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2118854820, now seen corresponding path program 1 times [2018-01-28 22:38:43,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:43,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:43,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:43,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:43,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:43,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:43,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:43,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:38:43,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:38:43,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:38:43,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:38:43,862 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-28 22:38:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:43,969 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-01-28 22:38:43,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:38:43,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-28 22:38:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:43,981 INFO L225 Difference]: With dead ends: 118 [2018-01-28 22:38:43,982 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 22:38:43,986 INFO L533 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-01-28 22:38:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 22:38:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-01-28 22:38:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-28 22:38:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-28 22:38:44,027 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2018-01-28 22:38:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,028 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-28 22:38:44,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:38:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-28 22:38:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:38:44,030 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,030 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:38:44,030 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash -356759092, now seen corresponding path program 1 times [2018-01-28 22:38:44,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:44,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:38:44,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:38:44,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:38:44,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:44,129 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-01-28 22:38:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,253 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-01-28 22:38:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:38:44,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-28 22:38:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,256 INFO L225 Difference]: With dead ends: 98 [2018-01-28 22:38:44,256 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 22:38:44,257 INFO L533 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-01-28 22:38:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 22:38:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 57. [2018-01-28 22:38:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-28 22:38:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-28 22:38:44,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 23 [2018-01-28 22:38:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,267 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-28 22:38:44,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:38:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-28 22:38:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 22:38:44,268 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,268 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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-01-28 22:38:44,268 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 15601453, now seen corresponding path program 1 times [2018-01-28 22:38:44,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:44,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:38:44,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:38:44,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:38:44,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:38:44,347 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-01-28 22:38:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,411 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-28 22:38:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:38:44,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-28 22:38:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,412 INFO L225 Difference]: With dead ends: 107 [2018-01-28 22:38:44,413 INFO L226 Difference]: Without dead ends: 59 [2018-01-28 22:38:44,413 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-28 22:38:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-28 22:38:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-28 22:38:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-28 22:38:44,421 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 28 [2018-01-28 22:38:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,422 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-28 22:38:44,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:38:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-28 22:38:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 22:38:44,423 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,423 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-01-28 22:38:44,423 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash -204345955, now seen corresponding path program 1 times [2018-01-28 22:38:44,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:44,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:38:44,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:38:44,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:38:44,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:44,497 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-01-28 22:38:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,559 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-28 22:38:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:38:44,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-28 22:38:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,561 INFO L225 Difference]: With dead ends: 59 [2018-01-28 22:38:44,561 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 22:38:44,561 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-01-28 22:38:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 22:38:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-28 22:38:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-28 22:38:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-28 22:38:44,566 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 29 [2018-01-28 22:38:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,566 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-28 22:38:44,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:38:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-28 22:38:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 22:38:44,567 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,567 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-01-28 22:38:44,567 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -204345954, now seen corresponding path program 1 times [2018-01-28 22:38:44,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:44,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:38:44,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:38:44,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:38:44,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:44,631 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-01-28 22:38:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,760 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-28 22:38:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:38:44,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-28 22:38:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,762 INFO L225 Difference]: With dead ends: 66 [2018-01-28 22:38:44,762 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 22:38:44,763 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-01-28 22:38:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 22:38:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-28 22:38:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-28 22:38:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-28 22:38:44,771 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 29 [2018-01-28 22:38:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,771 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-28 22:38:44,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:38:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-28 22:38:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 22:38:44,773 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,773 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-01-28 22:38:44,773 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,773 INFO L82 PathProgramCache]: Analyzing trace with hash -204345906, now seen corresponding path program 1 times [2018-01-28 22:38:44,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:44,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:38:44,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:38:44,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:38:44,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:38:44,839 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-01-28 22:38:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,873 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-28 22:38:44,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:38:44,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-28 22:38:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,875 INFO L225 Difference]: With dead ends: 114 [2018-01-28 22:38:44,875 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 22:38:44,876 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:38:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 22:38:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2018-01-28 22:38:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 22:38:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-28 22:38:44,885 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 29 [2018-01-28 22:38:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:44,885 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-28 22:38:44,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:38:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-28 22:38:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:38:44,887 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:44,887 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 22:38:44,887 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1456085898, now seen corresponding path program 1 times [2018-01-28 22:38:44,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:44,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:44,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:44,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:44,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:38:44,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:44,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:38:44,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:38:44,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:38:44,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:38:44,952 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2018-01-28 22:38:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:44,996 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-28 22:38:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:38:44,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 22:38:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:44,998 INFO L225 Difference]: With dead ends: 132 [2018-01-28 22:38:44,998 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 22:38:44,999 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 22:38:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-01-28 22:38:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 22:38:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-28 22:38:45,008 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2018-01-28 22:38:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:45,008 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-28 22:38:45,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:38:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-28 22:38:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:38:45,010 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:45,010 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 22:38:45,010 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330386, now seen corresponding path program 1 times [2018-01-28 22:38:45,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:45,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:45,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:45,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:45,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:45,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:45,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:45,271 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:38:45,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:45,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:45,361 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-01-28 22:38:45,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:45,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:45,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:38:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:45,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:45,417 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-01-28 22:38:45,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:45,424 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-01-28 22:38:45,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-28 22:38:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:45,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:45,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:38:45,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:38:45,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:38:45,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:38:45,515 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 11 states. [2018-01-28 22:38:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:45,890 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-01-28 22:38:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:38:45,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-28 22:38:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:45,892 INFO L225 Difference]: With dead ends: 91 [2018-01-28 22:38:45,893 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 22:38:45,893 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:38:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 22:38:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-01-28 22:38:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-28 22:38:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-28 22:38:45,904 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 38 [2018-01-28 22:38:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:45,905 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-28 22:38:45,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:38:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-28 22:38:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:38:45,906 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:45,906 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 22:38:45,907 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:45,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330387, now seen corresponding path program 1 times [2018-01-28 22:38:45,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:45,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:45,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:45,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:45,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:45,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:46,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:46,345 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:38:46,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:46,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:46,420 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-01-28 22:38:46,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,437 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-01-28 22:38:46,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,439 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-01-28 22:38:46,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,454 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-01-28 22:38:46,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:38:46,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:38:46,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,741 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 54 treesize of output 48 [2018-01-28 22:38:46,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,786 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 45 treesize of output 48 [2018-01-28 22:38:46,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,828 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 44 treesize of output 38 [2018-01-28 22:38:46,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:46,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-28 22:38:46,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:46,903 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-01-28 22:38:46,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:38:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:47,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:47,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-28 22:38:47,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:38:47,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:38:47,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-28 22:38:47,021 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 21 states. [2018-01-28 22:38:47,323 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:39:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:30,844 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-28 22:39:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:39:30,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-28 22:39:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:30,846 INFO L225 Difference]: With dead ends: 141 [2018-01-28 22:39:30,846 INFO L226 Difference]: Without dead ends: 140 [2018-01-28 22:39:30,846 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-28 22:39:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-28 22:39:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 71. [2018-01-28 22:39:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 22:39:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-01-28 22:39:30,861 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 38 [2018-01-28 22:39:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:30,862 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-01-28 22:39:30,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:39:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-01-28 22:39:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 22:39:30,863 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:30,863 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:30,863 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash -916219476, now seen corresponding path program 1 times [2018-01-28 22:39:30,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:30,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:30,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:30,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:30,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:30,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:39:30,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:30,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:39:30,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:39:30,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:39:30,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:39:30,908 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 4 states. [2018-01-28 22:39:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:30,940 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-28 22:39:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:39:30,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-28 22:39:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:30,941 INFO L225 Difference]: With dead ends: 101 [2018-01-28 22:39:30,941 INFO L226 Difference]: Without dead ends: 82 [2018-01-28 22:39:30,942 INFO L533 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-01-28 22:39:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-28 22:39:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-01-28 22:39:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 22:39:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-28 22:39:30,961 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 40 [2018-01-28 22:39:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:30,962 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-28 22:39:30,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:39:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-28 22:39:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:39:30,963 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:30,963 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:30,963 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash -578645626, now seen corresponding path program 1 times [2018-01-28 22:39:30,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:30,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:30,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:30,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:30,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:30,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:39:31,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:31,127 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:31,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:31,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:39:31,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:31,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-28 22:39:31,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:39:31,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:39:31,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-28 22:39:31,371 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 13 states. [2018-01-28 22:39:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:31,670 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-28 22:39:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:39:31,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-28 22:39:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:31,671 INFO L225 Difference]: With dead ends: 85 [2018-01-28 22:39:31,671 INFO L226 Difference]: Without dead ends: 74 [2018-01-28 22:39:31,672 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-28 22:39:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-28 22:39:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-28 22:39:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-28 22:39:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-28 22:39:31,689 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 43 [2018-01-28 22:39:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:31,689 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-28 22:39:31,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:39:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-28 22:39:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:39:31,690 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:31,691 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 22:39:31,691 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1929970958, now seen corresponding path program 1 times [2018-01-28 22:39:31,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:31,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:31,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:31,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:31,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:31,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:39:31,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:39:31,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:39:31,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:39:31,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:39:31,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:39:31,739 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 6 states. [2018-01-28 22:39:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:31,805 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-28 22:39:31,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:31,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-28 22:39:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:31,807 INFO L225 Difference]: With dead ends: 118 [2018-01-28 22:39:31,807 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 22:39:31,808 INFO L533 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-01-28 22:39:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 22:39:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2018-01-28 22:39:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 22:39:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-28 22:39:31,820 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 44 [2018-01-28 22:39:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:31,821 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-28 22:39:31,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:39:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-28 22:39:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 22:39:31,822 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:31,822 INFO L330 BasicCegarLoop]: trace histogram [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, 1] [2018-01-28 22:39:31,822 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1808851570, now seen corresponding path program 1 times [2018-01-28 22:39:31,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:31,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:31,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:31,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:31,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:31,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:31,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:31,888 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:31,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:31,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:32,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:32,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-28 22:39:32,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:39:32,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:39:32,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:39:32,012 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-28 22:39:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:32,122 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-01-28 22:39:32,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:39:32,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-28 22:39:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:32,123 INFO L225 Difference]: With dead ends: 131 [2018-01-28 22:39:32,123 INFO L226 Difference]: Without dead ends: 108 [2018-01-28 22:39:32,124 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:39:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-28 22:39:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2018-01-28 22:39:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 22:39:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-28 22:39:32,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 47 [2018-01-28 22:39:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:32,139 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-28 22:39:32,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:39:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-28 22:39:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:39:32,140 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:32,140 INFO L330 BasicCegarLoop]: trace histogram [3, 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] [2018-01-28 22:39:32,140 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1945346733, now seen corresponding path program 1 times [2018-01-28 22:39:32,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:32,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:32,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:32,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:32,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:32,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:32,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:32,563 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:32,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:32,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:32,621 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-01-28 22:39:32,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,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 26 treesize of output 25 [2018-01-28 22:39:32,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,651 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-01-28 22:39:32,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,653 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-01-28 22:39:32,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:39:32,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:39:32,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:32,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:32,936 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 16 treesize of output 25 [2018-01-28 22:39:32,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:32,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:32,962 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-01-28 22:39:32,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:32,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:39:32,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-28 22:39:33,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:33,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:33,296 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-01-28 22:39:33,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:33,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:33,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:33,317 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 21 treesize of output 34 [2018-01-28 22:39:33,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:33,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:39:33,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-28 22:39:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:33,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:33,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-28 22:39:33,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:39:33,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:39:33,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-28 22:39:33,428 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 29 states. [2018-01-28 22:39:33,777 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-28 22:39:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:34,590 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-01-28 22:39:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:39:34,590 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-28 22:39:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:34,592 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:39:34,592 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:39:34,593 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=1581, Unknown=5, NotChecked=0, Total=1806 [2018-01-28 22:39:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:39:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2018-01-28 22:39:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 22:39:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-28 22:39:34,607 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 56 [2018-01-28 22:39:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:34,607 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-28 22:39:34,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:39:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-28 22:39:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:39:34,608 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:34,608 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2018-01-28 22:39:34,608 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1619062292, now seen corresponding path program 1 times [2018-01-28 22:39:34,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:34,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:34,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:34,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:34,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:34,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:34,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:34,743 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:34,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:34,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:39:34,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:34,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-28 22:39:34,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:39:34,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:39:34,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:39:34,897 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 15 states. [2018-01-28 22:39:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:35,181 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-01-28 22:39:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:39:35,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-01-28 22:39:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:35,182 INFO L225 Difference]: With dead ends: 114 [2018-01-28 22:39:35,182 INFO L226 Difference]: Without dead ends: 113 [2018-01-28 22:39:35,183 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:39:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-28 22:39:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-01-28 22:39:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 22:39:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-28 22:39:35,202 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-28 22:39:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:35,203 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-28 22:39:35,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:39:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-28 22:39:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:39:35,204 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:35,204 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-28 22:39:35,204 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676510, now seen corresponding path program 1 times [2018-01-28 22:39:35,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:35,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:35,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:35,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:35,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:35,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-28 22:39:35,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:35,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:35,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:35,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:35,782 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-01-28 22:39:35,785 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-01-28 22:39:35,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:35,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:35,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-28 22:39:36,011 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 23 treesize of output 19 [2018-01-28 22:39:36,013 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:39:36,013 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 19 treesize of output 15 [2018-01-28 22:39:36,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:36,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:36,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:36,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-28 22:39:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:39:36,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:36,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-01-28 22:39:36,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:39:36,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:39:36,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:39:36,046 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 23 states. [2018-01-28 22:39:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:38,652 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-01-28 22:39:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:39:38,652 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-01-28 22:39:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:38,653 INFO L225 Difference]: With dead ends: 123 [2018-01-28 22:39:38,653 INFO L226 Difference]: Without dead ends: 122 [2018-01-28 22:39:38,654 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 22:39:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-28 22:39:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-01-28 22:39:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:39:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-28 22:39:38,666 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-28 22:39:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:38,667 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-28 22:39:38,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:39:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-28 22:39:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:39:38,667 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:38,667 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-28 22:39:38,667 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676511, now seen corresponding path program 1 times [2018-01-28 22:39:38,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:38,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:38,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:38,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:38,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:38,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:39:39,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:39,013 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:39,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:39,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:39,064 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-01-28 22:39:39,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:39,103 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-01-28 22:39:39,106 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-01-28 22:39:39,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-28 22:39:39,187 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 13 treesize of output 1 [2018-01-28 22:39:39,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-28 22:39:39,279 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 25 treesize of output 21 [2018-01-28 22:39:39,281 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:39:39,282 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 21 treesize of output 17 [2018-01-28 22:39:39,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:39,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-28 22:39:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:39:39,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:39,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2018-01-28 22:39:39,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:39:39,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:39:39,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:39:39,318 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 25 states. [2018-01-28 22:39:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:39,916 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-28 22:39:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:39:39,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-01-28 22:39:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:39,917 INFO L225 Difference]: With dead ends: 103 [2018-01-28 22:39:39,918 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 22:39:39,918 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 22:39:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 22:39:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-28 22:39:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:39:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-28 22:39:39,936 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-28 22:39:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:39,937 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-28 22:39:39,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:39:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-28 22:39:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:39:39,938 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:39,938 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:39,938 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1003409082, now seen corresponding path program 1 times [2018-01-28 22:39:39,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:39,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:39,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:39,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:39,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:39:40,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:40,000 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:40,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:40,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:39:40,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:40,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-28 22:39:40,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:39:40,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:39:40,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:39:40,127 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-28 22:39:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:40,199 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-28 22:39:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:39:40,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-28 22:39:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:40,201 INFO L225 Difference]: With dead ends: 105 [2018-01-28 22:39:40,201 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 22:39:40,201 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:39:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 22:39:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-28 22:39:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 22:39:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-28 22:39:40,218 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-28 22:39:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:40,219 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-28 22:39:40,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:39:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-28 22:39:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 22:39:40,220 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:40,220 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-28 22:39:40,220 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1057480014, now seen corresponding path program 2 times [2018-01-28 22:39:40,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:40,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:40,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:40,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:40,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:39:40,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:40,331 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:40,339 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:39:40,355 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:39:40,357 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:39:40,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-28 22:39:40,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:39:40,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-28 22:39:40,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:39:40,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:39:40,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:39:40,430 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-01-28 22:39:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:39:40,861 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2018-01-28 22:39:40,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:39:40,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-01-28 22:39:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:39:40,862 INFO L225 Difference]: With dead ends: 194 [2018-01-28 22:39:40,862 INFO L226 Difference]: Without dead ends: 172 [2018-01-28 22:39:40,863 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2018-01-28 22:39:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-28 22:39:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 109. [2018-01-28 22:39:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 22:39:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-01-28 22:39:40,879 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 65 [2018-01-28 22:39:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:39:40,879 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-01-28 22:39:40,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:39:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-01-28 22:39:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:39:40,880 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:39:40,880 INFO L330 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:39:40,880 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:39:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416881, now seen corresponding path program 1 times [2018-01-28 22:39:40,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:39:40,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:39:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,881 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:39:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:39:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:40,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:39:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:39:41,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:39:41,346 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:39:41,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:39:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:39:41,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:39:41,384 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-01-28 22:39:41,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:39:41,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:41,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:41,450 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-01-28 22:39:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 22:39:41,483 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-01-28 22:39:41,485 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-01-28 22:39:41,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-28 22:39:41,562 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-01-28 22:39:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:41,566 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-01-28 22:39:41,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-28 22:39:45,588 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-28 22:39:45,884 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-01-28 22:39:45,887 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:39:45,887 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-01-28 22:39:45,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:45,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:45,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:39:45,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-28 22:39:46,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:39:46,034 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-01-28 22:39:46,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:39:46,047 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-01-28 22:39:46,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-28 22:39:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:39:46,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:39:46,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2018-01-28 22:39:46,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:39:46,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:39:46,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-28 22:39:46,131 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 31 states. [2018-01-28 22:40:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:17,389 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-01-28 22:40:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:40:17,390 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-01-28 22:40:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:17,391 INFO L225 Difference]: With dead ends: 124 [2018-01-28 22:40:17,391 INFO L226 Difference]: Without dead ends: 122 [2018-01-28 22:40:17,391 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=262, Invalid=1993, Unknown=1, NotChecked=0, Total=2256 [2018-01-28 22:40:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-28 22:40:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-01-28 22:40:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:40:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-28 22:40:17,413 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 66 [2018-01-28 22:40:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:17,414 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-28 22:40:17,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 22:40:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-28 22:40:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:40:17,415 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:17,415 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:40:17,415 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:40:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416929, now seen corresponding path program 1 times [2018-01-28 22:40:17,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:17,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:17,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:17,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:17,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:17,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:40:17,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:40:17,485 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:40:17,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:17,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:40:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:40:17,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:40:17,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:40:17,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:40:17,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:40:17,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:40:17,573 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 10 states. [2018-01-28 22:40:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:17,649 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-28 22:40:17,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:40:17,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-28 22:40:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:17,651 INFO L225 Difference]: With dead ends: 137 [2018-01-28 22:40:17,651 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 22:40:17,651 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:40:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 22:40:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-28 22:40:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:40:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-01-28 22:40:17,669 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 66 [2018-01-28 22:40:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:17,669 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-01-28 22:40:17,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:40:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-01-28 22:40:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:40:17,670 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:17,670 INFO L330 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:40:17,670 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:40:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1763817103, now seen corresponding path program 1 times [2018-01-28 22:40:17,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:17,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:17,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:17,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:17,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:17,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:18,077 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 24 DAG size of output 18 [2018-01-28 22:40:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-28 22:40:18,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:40:18,916 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:40:18,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:18,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:40:19,213 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 49 treesize of output 46 [2018-01-28 22:40:19,215 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-01-28 22:40:19,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,228 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 49 treesize of output 46 [2018-01-28 22:40:19,231 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-01-28 22:40:19,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:40:19,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-28 22:40:19,572 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 53 treesize of output 35 [2018-01-28 22:40:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,593 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-28 22:40:19,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:19,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-28 22:40:19,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-28 22:40:20,723 WARN L146 SmtUtils]: Spent 1060ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-01-28 22:40:23,058 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 75 treesize of output 67 [2018-01-28 22:40:23,060 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:40:23,060 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 49 treesize of output 33 [2018-01-28 22:40:23,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:23,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:23,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 75 treesize of output 67 [2018-01-28 22:40:23,100 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:40:23,101 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:40:23,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-01-28 22:40:23,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:23,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:40:23,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:40:23,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:151, output treesize:63 [2018-01-28 22:40:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:40:25,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:40:25,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2018-01-28 22:40:25,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 22:40:25,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 22:40:25,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1270, Unknown=33, NotChecked=0, Total=1406 [2018-01-28 22:40:25,440 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 38 states. [2018-01-28 22:40:29,742 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 115 DAG size of output 46 [2018-01-28 22:40:32,709 WARN L146 SmtUtils]: Spent 2159ms on a formula simplification. DAG size of input: 84 DAG size of output 39 [2018-01-28 22:40:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:40:34,985 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-28 22:40:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:40:34,985 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2018-01-28 22:40:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:40:34,986 INFO L225 Difference]: With dead ends: 120 [2018-01-28 22:40:34,986 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 22:40:34,987 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=250, Invalid=2663, Unknown=57, NotChecked=0, Total=2970 [2018-01-28 22:40:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 22:40:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-28 22:40:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 22:40:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-28 22:40:35,008 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 69 [2018-01-28 22:40:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:40:35,008 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-28 22:40:35,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-28 22:40:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-28 22:40:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-28 22:40:35,009 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:40:35,009 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:40:35,010 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:40:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1766894189, now seen corresponding path program 2 times [2018-01-28 22:40:35,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:40:35,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:40:35,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:35,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:40:35,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:40:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:40:35,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:40:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:40:35,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:40:35,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:40:35,675 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:40:35,687 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:40:35,698 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:40:35,704 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:40:35,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:40:35,728 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-01-28 22:40:35,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:35,746 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-01-28 22:40:35,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:35,762 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-01-28 22:40:35,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:35,764 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-01-28 22:40:35,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:35,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:40:35,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:40:36,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,158 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 52 treesize of output 55 [2018-01-28 22:40:36,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:36,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,221 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 47 treesize of output 41 [2018-01-28 22:40:36,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:36,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-28 22:40:36,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:36,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:36,303 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 44 treesize of output 38 [2018-01-28 22:40:36,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:36,334 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-01-28 22:40:36,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:40:36,529 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-28 22:40:36,806 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-01-28 22:40:37,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,209 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 90 [2018-01-28 22:40:37,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:37,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,445 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-01-28 22:40:37,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:37,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,685 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 90 [2018-01-28 22:40:37,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:37,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,938 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 52 treesize of output 46 [2018-01-28 22:40:37,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:37,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:37,942 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 58 treesize of output 52 [2018-01-28 22:40:37,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,230 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 54 treesize of output 48 [2018-01-28 22:40:38,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:38,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,235 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:40:38,235 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:38,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,490 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-01-28 22:40:38,490 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:38,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,785 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 54 treesize of output 48 [2018-01-28 22:40:38,786 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:38,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:38,790 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 60 treesize of output 54 [2018-01-28 22:40:38,790 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:39,048 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 55 treesize of output 58 [2018-01-28 22:40:39,049 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:39,406 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-01-28 22:40:39,407 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-28 22:40:40,065 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-28 22:40:40,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,565 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 90 [2018-01-28 22:40:40,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:40,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,807 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 52 treesize of output 46 [2018-01-28 22:40:40,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:40,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,811 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 58 treesize of output 52 [2018-01-28 22:40:40,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:40,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:40,995 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-01-28 22:40:40,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:41,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,360 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-01-28 22:40:41,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:41,684 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 55 treesize of output 58 [2018-01-28 22:40:41,685 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:41,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,980 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 54 treesize of output 48 [2018-01-28 22:40:41,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:41,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:41,985 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 60 treesize of output 54 [2018-01-28 22:40:41,986 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:42,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,302 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 90 [2018-01-28 22:40:42,302 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-28 22:40:42,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,677 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 54 treesize of output 48 [2018-01-28 22:40:42,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:42,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:40:42,681 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:40:42,682 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:40:42,951 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-01-28 22:40:42,951 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-28 22:40:43,430 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-28 22:40:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:40:43,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:40:43,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-01-28 22:40:43,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-28 22:40:43,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-28 22:40:43,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1061, Unknown=1, NotChecked=0, Total=1190 [2018-01-28 22:40:43,488 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 35 states. [2018-01-28 22:40:43,732 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-28 22:40:43,934 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:41:07,725 WARN L143 SmtUtils]: Spent 1103ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-28 22:41:10,064 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 60 DAG size of output 57 [2018-01-28 22:41:10,337 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 60 DAG size of output 57 [2018-01-28 22:41:11,128 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 60 DAG size of output 57 [2018-01-28 22:41:11,389 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-01-28 22:41:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:41:12,160 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-01-28 22:41:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:41:12,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-01-28 22:41:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:41:12,161 INFO L225 Difference]: With dead ends: 148 [2018-01-28 22:41:12,161 INFO L226 Difference]: Without dead ends: 147 [2018-01-28 22:41:12,162 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=332, Invalid=2525, Unknown=5, NotChecked=0, Total=2862 [2018-01-28 22:41:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-28 22:41:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2018-01-28 22:41:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-28 22:41:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-01-28 22:41:12,178 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 74 [2018-01-28 22:41:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:41:12,178 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-01-28 22:41:12,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-28 22:41:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-01-28 22:41:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-28 22:41:12,179 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:41:12,179 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-28 22:41:12,179 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:41:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1924859348, now seen corresponding path program 2 times [2018-01-28 22:41:12,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:41:12,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:41:12,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:41:12,181 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:41:12,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:41:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:41:12,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:41:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-28 22:41:12,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:41:12,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:41:12,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:41:12,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:41:12,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:41:12,378 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 7 states. Received shutdown request... [2018-01-28 22:41:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:41:12,529 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:41:12,535 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:41:12,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:41:12 BoogieIcfgContainer [2018-01-28 22:41:12,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:41:12,536 INFO L168 Benchmark]: Toolchain (without parser) took 149552.37 ms. Allocated memory was 304.1 MB in the beginning and 525.9 MB in the end (delta: 221.8 MB). Free memory was 261.0 MB in the beginning and 446.7 MB in the end (delta: -185.7 MB). Peak memory consumption was 36.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:41:12,537 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:41:12,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.54 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 247.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:41:12,537 INFO L168 Benchmark]: Boogie Preprocessor took 35.85 ms. Allocated memory is still 304.1 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:41:12,537 INFO L168 Benchmark]: RCFGBuilder took 244.97 ms. Allocated memory is still 304.1 MB. Free memory was 245.9 MB in the beginning and 226.8 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:41:12,538 INFO L168 Benchmark]: TraceAbstraction took 149057.53 ms. Allocated memory was 304.1 MB in the beginning and 525.9 MB in the end (delta: 221.8 MB). Free memory was 226.8 MB in the beginning and 446.7 MB in the end (delta: -219.9 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:41:12,539 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.17 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.54 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 247.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.85 ms. Allocated memory is still 304.1 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 244.97 ms. Allocated memory is still 304.1 MB. Free memory was 245.9 MB in the beginning and 226.8 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 149057.53 ms. Allocated memory was 304.1 MB in the beginning and 525.9 MB in the end (delta: 221.8 MB). Free memory was 226.8 MB in the beginning and 446.7 MB in the end (delta: -219.9 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and interpolant automaton (currently 3 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 149.0s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 120.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1308 SDtfs, 2013 SDslu, 8468 SDs, 0 SdLazy, 6100 SolverSat, 327 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 94.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 732 SyntacticMatches, 30 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=20, 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.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 462 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1917 ConstructedInterpolants, 195 QuantifiedInterpolants, 1197146 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2184 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 482/773 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-41-12-547.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-41-12-547.csv Completed graceful shutdown