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/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 20:58:03,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 20:58:03,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 20:58:03,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 20:58:03,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 20:58:03,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 20:58:03,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 20:58:03,766 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 20:58:03,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 20:58:03,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 20:58:03,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 20:58:03,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 20:58:03,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 20:58:03,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 20:58:03,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 20:58:03,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 20:58:03,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 20:58:03,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 20:58:03,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 20:58:03,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 20:58:03,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 20:58:03,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 20:58:03,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 20:58:03,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 20:58:03,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 20:58:03,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 20:58:03,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 20:58:03,792 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 20:58:03,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 20:58:03,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 20:58:03,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 20:58:03,793 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 20:58:03,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 20:58:03,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 20:58:03,816 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 20:58:03,816 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 20:58:03,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 20:58:03,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 20:58:03,816 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 20:58:03,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 20:58:03,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 20:58:03,818 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 20:58:03,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 20:58:03,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 20:58:03,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 20:58:03,818 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 20:58:03,819 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 20:58:03,819 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 20:58:03,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 20:58:03,819 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 20:58:03,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 20:58:03,820 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 20:58:03,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 20:58:03,829 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 20:58:03,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 20:58:03,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 20:58:03,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 20:58:03,830 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 20:58:03,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 20:58:03,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 20:58:03,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 20:58:03,831 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 20:58:03,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 20:58:03,831 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 20:58:03,832 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 20:58:03,832 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 20:58:03,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 20:58:03,887 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 20:58:03,890 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 20:58:03,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 20:58:03,893 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 20:58:03,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:04,106 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 20:58:04,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 20:58:04,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:04,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 20:58:04,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 20:58:04,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518bd560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04, skipping insertion in model container [2018-01-28 20:58:04,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,144 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:04,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:04,352 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:04,374 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:04,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04 WrapperNode [2018-01-28 20:58:04,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:04,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 20:58:04,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 20:58:04,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 20:58:04,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (1/1) ... [2018-01-28 20:58:04,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 20:58:04,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 20:58:04,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 20:58:04,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 20:58:04,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (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 20:58:04,521 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 20:58:04,521 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 20:58:04,521 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 20:58:04,521 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 20:58:04,521 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 20:58:04,521 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 20:58:04,521 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 20:58:04,522 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 20:58:04,522 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 20:58:04,522 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 20:58:04,522 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 20:58:04,522 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 20:58:05,012 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 20:58:05,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:05 BoogieIcfgContainer [2018-01-28 20:58:05,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 20:58:05,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 20:58:05,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 20:58:05,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 20:58:05,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:58:04" (1/3) ... [2018-01-28 20:58:05,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62780f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:05, skipping insertion in model container [2018-01-28 20:58:05,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:04" (2/3) ... [2018-01-28 20:58:05,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62780f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:05, skipping insertion in model container [2018-01-28 20:58:05,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:05" (3/3) ... [2018-01-28 20:58:05,023 INFO L107 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:05,030 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 20:58:05,041 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-28 20:58:05,128 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 20:58:05,128 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 20:58:05,128 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 20:58:05,128 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 20:58:05,129 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 20:58:05,129 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 20:58:05,129 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 20:58:05,129 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 20:58:05,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 20:58:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-28 20:58:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 20:58:05,193 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:05,195 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:05,195 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:05,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879530, now seen corresponding path program 1 times [2018-01-28 20:58:05,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:05,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:05,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:05,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:05,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:05,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:05,548 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 20:58:05,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:05,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 20:58:05,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 20:58:05,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 20:58:05,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 20:58:05,574 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-28 20:58:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:06,003 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-28 20:58:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 20:58:06,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-28 20:58:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:06,013 INFO L225 Difference]: With dead ends: 66 [2018-01-28 20:58:06,014 INFO L226 Difference]: Without dead ends: 50 [2018-01-28 20:58:06,017 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-28 20:58:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-28 20:58:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-28 20:58:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-28 20:58:06,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2018-01-28 20:58:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:06,059 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-28 20:58:06,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 20:58:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-28 20:58:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 20:58:06,060 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:06,060 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:06,061 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879531, now seen corresponding path program 1 times [2018-01-28 20:58:06,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:06,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:06,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:06,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:06,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:06,223 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 20:58:06,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:06,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:58:06,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:06,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:06,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:06,226 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-28 20:58:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:06,640 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-01-28 20:58:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 20:58:06,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-28 20:58:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:06,645 INFO L225 Difference]: With dead ends: 72 [2018-01-28 20:58:06,645 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 20:58:06,646 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:58:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 20:58:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-01-28 20:58:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-28 20:58:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-28 20:58:06,658 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-01-28 20:58:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:06,658 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-28 20:58:06,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-28 20:58:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 20:58:06,660 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:06,660 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:06,660 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash -679096899, now seen corresponding path program 1 times [2018-01-28 20:58:06,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:06,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:06,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:06,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:06,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:06,751 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 20:58:06,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:06,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 20:58:06,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:58:06,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:58:06,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:58:06,753 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 4 states. [2018-01-28 20:58:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:06,785 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-28 20:58:06,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 20:58:06,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 20:58:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:06,787 INFO L225 Difference]: With dead ends: 58 [2018-01-28 20:58:06,787 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 20:58:06,788 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 20:58:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 20:58:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-28 20:58:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 20:58:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 20:58:06,795 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2018-01-28 20:58:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:06,796 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 20:58:06,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:58:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 20:58:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 20:58:06,796 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:06,796 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:06,797 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -675276707, now seen corresponding path program 1 times [2018-01-28 20:58:06,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:06,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:06,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:06,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:06,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:06,953 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 20:58:06,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:06,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 20:58:06,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 20:58:06,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 20:58:06,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:06,954 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-01-28 20:58:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:07,078 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-28 20:58:07,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 20:58:07,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-28 20:58:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:07,080 INFO L225 Difference]: With dead ends: 64 [2018-01-28 20:58:07,080 INFO L226 Difference]: Without dead ends: 62 [2018-01-28 20:58:07,081 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-01-28 20:58:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-28 20:58:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2018-01-28 20:58:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 20:58:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-28 20:58:07,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 19 [2018-01-28 20:58:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:07,089 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-28 20:58:07,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 20:58:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-28 20:58:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 20:58:07,091 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:07,091 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] [2018-01-28 20:58:07,091 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1131978318, now seen corresponding path program 1 times [2018-01-28 20:58:07,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:07,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:07,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:07,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:07,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:07,195 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 20:58:07,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:07,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:58:07,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:58:07,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:58:07,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:58:07,197 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 4 states. [2018-01-28 20:58:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:07,233 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-28 20:58:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 20:58:07,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-28 20:58:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:07,234 INFO L225 Difference]: With dead ends: 51 [2018-01-28 20:58:07,234 INFO L226 Difference]: Without dead ends: 44 [2018-01-28 20:58:07,235 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 20:58:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-28 20:58:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-28 20:58:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-28 20:58:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-28 20:58:07,241 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2018-01-28 20:58:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:07,241 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-28 20:58:07,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:58:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-28 20:58:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 20:58:07,243 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:07,243 INFO L330 BasicCegarLoop]: trace histogram [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 20:58:07,243 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -395515362, now seen corresponding path program 1 times [2018-01-28 20:58:07,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:07,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:07,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:07,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:07,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:07,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:07,314 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 20:58:07,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:07,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:07,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:07,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-28 20:58:07,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:07,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:07,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:07,402 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2018-01-28 20:58:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:07,446 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-28 20:58:07,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 20:58:07,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-28 20:58:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:07,447 INFO L225 Difference]: With dead ends: 48 [2018-01-28 20:58:07,447 INFO L226 Difference]: Without dead ends: 47 [2018-01-28 20:58:07,447 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:58:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-28 20:58:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-01-28 20:58:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-28 20:58:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-01-28 20:58:07,453 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 32 [2018-01-28 20:58:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:07,453 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-01-28 20:58:07,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-01-28 20:58:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 20:58:07,454 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:07,454 INFO L330 BasicCegarLoop]: trace histogram [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 20:58:07,455 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -395515361, now seen corresponding path program 1 times [2018-01-28 20:58:07,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:07,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:07,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:07,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:07,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:08,073 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 28 DAG size of output 14 [2018-01-28 20:58:08,389 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 33 DAG size of output 28 [2018-01-28 20:58:08,720 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 39 DAG size of output 32 [2018-01-28 20:58:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:08,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:08,895 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 20:58:08,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:08,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:09,008 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 8 treesize of output 7 [2018-01-28 20:58:09,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:09,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:09,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-28 20:58:09,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:09,199 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:09,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:09,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:09,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:09,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-28 20:58:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:09,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:09,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-01-28 20:58:09,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 20:58:09,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 20:58:09,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-01-28 20:58:09,480 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 18 states. [2018-01-28 20:58:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:09,909 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-01-28 20:58:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 20:58:09,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-28 20:58:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:09,914 INFO L225 Difference]: With dead ends: 64 [2018-01-28 20:58:09,914 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 20:58:09,914 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-01-28 20:58:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 20:58:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-01-28 20:58:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-28 20:58:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-28 20:58:09,920 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-01-28 20:58:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:09,921 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-28 20:58:09,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 20:58:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-28 20:58:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 20:58:09,922 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:09,922 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-01-28 20:58:09,923 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1325802579, now seen corresponding path program 2 times [2018-01-28 20:58:09,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:09,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:09,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:09,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:09,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:09,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:10,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:10,522 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 20:58:10,527 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:58:10,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:10,546 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:10,548 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:10,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:10,555 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 8 treesize of output 7 [2018-01-28 20:58:10,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:10,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:10,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:10,577 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 13 treesize of output 10 [2018-01-28 20:58:10,579 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 10 treesize of output 9 [2018-01-28 20:58:10,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:10,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:10,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:10,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:10,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:10,656 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:10,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:10,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:10,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:10,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:58:10,963 WARN L143 SmtUtils]: Spent 272ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-28 20:58:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:11,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:11,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-01-28 20:58:11,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 20:58:11,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 20:58:11,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-28 20:58:11,190 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-01-28 20:58:12,218 WARN L143 SmtUtils]: Spent 247ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-28 20:58:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:12,329 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-28 20:58:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 20:58:12,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-28 20:58:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:12,331 INFO L225 Difference]: With dead ends: 78 [2018-01-28 20:58:12,331 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 20:58:12,332 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2018-01-28 20:58:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 20:58:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-01-28 20:58:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 20:58:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-01-28 20:58:12,341 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 46 [2018-01-28 20:58:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:12,342 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-01-28 20:58:12,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 20:58:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-01-28 20:58:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 20:58:12,344 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:12,344 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:12,344 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1400671353, now seen corresponding path program 3 times [2018-01-28 20:58:12,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:12,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:12,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:12,346 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:12,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:12,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:12,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:12,881 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 20:58:12,891 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 20:58:12,904 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:58:12,916 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:58:12,929 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:58:12,937 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:58:12,940 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:12,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:12,950 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 8 treesize of output 7 [2018-01-28 20:58:12,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:12,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:12,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:12,976 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 13 treesize of output 10 [2018-01-28 20:58:12,979 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 10 treesize of output 9 [2018-01-28 20:58:12,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:12,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:12,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:12,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:13,079 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 13 treesize of output 10 [2018-01-28 20:58:13,082 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 10 treesize of output 9 [2018-01-28 20:58:13,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:13,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:13,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:13,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:13,370 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 16 treesize of output 12 [2018-01-28 20:58:13,375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-28 20:58:13,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:13,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:13,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 20:58:13,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 20:58:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:13,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:13,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-01-28 20:58:13,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 20:58:13,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 20:58:13,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-28 20:58:13,894 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 24 states. [2018-01-28 20:58:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:14,937 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-01-28 20:58:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 20:58:14,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-01-28 20:58:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:14,939 INFO L225 Difference]: With dead ends: 92 [2018-01-28 20:58:14,939 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 20:58:14,940 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 20:58:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 20:58:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-01-28 20:58:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 20:58:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-01-28 20:58:14,947 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 60 [2018-01-28 20:58:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:14,948 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-01-28 20:58:14,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 20:58:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-01-28 20:58:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-28 20:58:14,950 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:14,950 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:14,950 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash 563877819, now seen corresponding path program 4 times [2018-01-28 20:58:14,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:14,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:14,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:14,951 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:14,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:14,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:15,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:15,816 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 20:58:15,822 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 20:58:15,857 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:15,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:15,867 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 8 treesize of output 7 [2018-01-28 20:58:15,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:15,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:15,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:16,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:16,131 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:16,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:16,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:16,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:16,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:58:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:16,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:16,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-01-28 20:58:16,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 20:58:16,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 20:58:16,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-01-28 20:58:16,835 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 29 states. [2018-01-28 20:58:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:18,341 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-01-28 20:58:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 20:58:18,341 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-01-28 20:58:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:18,342 INFO L225 Difference]: With dead ends: 106 [2018-01-28 20:58:18,342 INFO L226 Difference]: Without dead ends: 103 [2018-01-28 20:58:18,343 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2018-01-28 20:58:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-28 20:58:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-01-28 20:58:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 20:58:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-01-28 20:58:18,350 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 74 [2018-01-28 20:58:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:18,350 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-01-28 20:58:18,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 20:58:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-01-28 20:58:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-28 20:58:18,352 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:18,352 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:18,352 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1655222033, now seen corresponding path program 5 times [2018-01-28 20:58:18,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:18,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:18,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:18,360 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:18,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:18,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:19,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:19,177 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 20:58:19,182 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-28 20:58:19,191 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,196 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,199 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,203 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,208 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:19,217 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:19,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:19,225 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 8 treesize of output 7 [2018-01-28 20:58:19,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:19,256 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 13 treesize of output 10 [2018-01-28 20:58:19,258 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 10 treesize of output 9 [2018-01-28 20:58:19,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:19,315 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 13 treesize of output 10 [2018-01-28 20:58:19,321 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 10 treesize of output 9 [2018-01-28 20:58:19,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:19,378 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 13 treesize of output 10 [2018-01-28 20:58:19,380 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 10 treesize of output 9 [2018-01-28 20:58:19,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:19,460 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 13 treesize of output 10 [2018-01-28 20:58:19,462 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 10 treesize of output 11 [2018-01-28 20:58:19,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:19,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-28 20:58:19,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:19,580 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:19,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:19,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:19,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:19,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:58:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:19,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:19,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-28 20:58:19,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-28 20:58:19,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-28 20:58:19,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 20:58:19,837 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 34 states. [2018-01-28 20:58:21,415 WARN L143 SmtUtils]: Spent 274ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-28 20:58:21,732 WARN L143 SmtUtils]: Spent 286ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-28 20:58:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:21,862 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-01-28 20:58:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 20:58:21,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-01-28 20:58:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:21,863 INFO L225 Difference]: With dead ends: 120 [2018-01-28 20:58:21,863 INFO L226 Difference]: Without dead ends: 117 [2018-01-28 20:58:21,863 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=353, Invalid=2953, Unknown=0, NotChecked=0, Total=3306 [2018-01-28 20:58:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-28 20:58:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-28 20:58:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 20:58:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-01-28 20:58:21,870 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 88 [2018-01-28 20:58:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:21,871 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-01-28 20:58:21,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-28 20:58:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-01-28 20:58:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 20:58:21,873 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:21,873 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:21,873 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1861460189, now seen corresponding path program 6 times [2018-01-28 20:58:21,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:21,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:21,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:21,875 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:21,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:21,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:22,761 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 49 DAG size of output 30 [2018-01-28 20:58:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:22,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:22,973 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 20:58:22,978 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-28 20:58:22,990 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:22,995 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,000 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,006 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,012 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,018 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,028 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 20:58:23,031 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:23,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:23,043 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 8 treesize of output 7 [2018-01-28 20:58:23,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:23,125 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 13 treesize of output 10 [2018-01-28 20:58:23,127 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 10 treesize of output 9 [2018-01-28 20:58:23,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:23,202 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 13 treesize of output 10 [2018-01-28 20:58:23,204 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 10 treesize of output 9 [2018-01-28 20:58:23,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-28 20:58:23,279 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 13 treesize of output 10 [2018-01-28 20:58:23,281 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 10 treesize of output 11 [2018-01-28 20:58:23,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-28 20:58:23,362 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 13 treesize of output 10 [2018-01-28 20:58:23,364 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 10 treesize of output 9 [2018-01-28 20:58:23,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-28 20:58:23,553 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 16 treesize of output 12 [2018-01-28 20:58:23,554 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-28 20:58:23,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:23,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 20:58:23,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 20:58:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:23,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:23,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-28 20:58:23,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 20:58:23,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 20:58:23,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 20:58:23,741 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 39 states. [2018-01-28 20:58:26,132 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 102 DAG size of output 43 [2018-01-28 20:58:26,644 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 81 DAG size of output 54 [2018-01-28 20:58:26,811 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 78 DAG size of output 64 [2018-01-28 20:58:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:28,327 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-01-28 20:58:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-28 20:58:28,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-01-28 20:58:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:28,328 INFO L225 Difference]: With dead ends: 190 [2018-01-28 20:58:28,328 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 20:58:28,330 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1667, Invalid=8839, Unknown=0, NotChecked=0, Total=10506 [2018-01-28 20:58:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 20:58:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-01-28 20:58:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-28 20:58:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-01-28 20:58:28,339 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 102 [2018-01-28 20:58:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:28,340 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-01-28 20:58:28,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 20:58:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-01-28 20:58:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-28 20:58:28,343 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:28,343 INFO L330 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:28,343 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash 335995175, now seen corresponding path program 7 times [2018-01-28 20:58:28,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:28,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:28,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:28,344 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:28,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:28,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:30,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:30,185 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 20:58:30,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:30,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:30,257 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 8 treesize of output 7 [2018-01-28 20:58:30,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:30,527 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 13 treesize of output 10 [2018-01-28 20:58:30,555 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 10 treesize of output 9 [2018-01-28 20:58:30,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:30,915 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 13 treesize of output 10 [2018-01-28 20:58:30,920 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 10 treesize of output 9 [2018-01-28 20:58:30,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:30,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,177 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 13 treesize of output 10 [2018-01-28 20:58:31,180 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 10 treesize of output 9 [2018-01-28 20:58:31,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,369 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 13 treesize of output 10 [2018-01-28 20:58:31,372 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 10 treesize of output 11 [2018-01-28 20:58:31,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,575 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 13 treesize of output 10 [2018-01-28 20:58:31,577 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 10 treesize of output 9 [2018-01-28 20:58:31,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,680 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 13 treesize of output 10 [2018-01-28 20:58:31,682 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 10 treesize of output 9 [2018-01-28 20:58:31,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,778 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 13 treesize of output 10 [2018-01-28 20:58:31,780 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 10 treesize of output 11 [2018-01-28 20:58:31,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,881 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 13 treesize of output 10 [2018-01-28 20:58:31,883 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 10 treesize of output 11 [2018-01-28 20:58:31,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:31,982 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 13 treesize of output 10 [2018-01-28 20:58:31,985 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 10 treesize of output 11 [2018-01-28 20:58:31,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:31,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:32,085 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 13 treesize of output 10 [2018-01-28 20:58:32,086 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 10 treesize of output 11 [2018-01-28 20:58:32,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:32,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:32,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:32,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:32,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:32,256 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:32,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:32,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:32,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:32,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:58:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:32,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:32,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-28 20:58:32,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-28 20:58:32,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-28 20:58:32,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3131, Unknown=0, NotChecked=0, Total=3306 [2018-01-28 20:58:32,786 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 58 states. [2018-01-28 20:58:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:36,915 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-01-28 20:58:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-28 20:58:36,916 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 172 [2018-01-28 20:58:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:36,917 INFO L225 Difference]: With dead ends: 204 [2018-01-28 20:58:36,917 INFO L226 Difference]: Without dead ends: 201 [2018-01-28 20:58:36,919 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2611 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=620, Invalid=9886, Unknown=0, NotChecked=0, Total=10506 [2018-01-28 20:58:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-28 20:58:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-01-28 20:58:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-28 20:58:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-01-28 20:58:36,927 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 172 [2018-01-28 20:58:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:36,928 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-01-28 20:58:36,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-28 20:58:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-01-28 20:58:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-28 20:58:36,930 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:36,930 INFO L330 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:36,930 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:36,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1027550555, now seen corresponding path program 8 times [2018-01-28 20:58:36,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:36,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:36,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:36,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:36,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:36,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:37,896 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 21 DAG size of output 19 [2018-01-28 20:58:38,084 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 22 DAG size of output 22 [2018-01-28 20:58:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:39,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:39,187 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 20:58:39,194 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:58:39,211 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:39,247 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:39,260 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:39,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:39,286 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 8 treesize of output 7 [2018-01-28 20:58:39,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:58:39,329 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 13 treesize of output 10 [2018-01-28 20:58:39,331 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 10 treesize of output 9 [2018-01-28 20:58:39,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-28 20:58:39,399 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 13 treesize of output 10 [2018-01-28 20:58:39,402 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 10 treesize of output 9 [2018-01-28 20:58:39,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,486 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 13 treesize of output 10 [2018-01-28 20:58:39,487 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 10 treesize of output 9 [2018-01-28 20:58:39,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,575 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 13 treesize of output 10 [2018-01-28 20:58:39,577 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 10 treesize of output 11 [2018-01-28 20:58:39,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,673 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 13 treesize of output 10 [2018-01-28 20:58:39,676 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 10 treesize of output 9 [2018-01-28 20:58:39,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,769 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 13 treesize of output 10 [2018-01-28 20:58:39,771 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 10 treesize of output 9 [2018-01-28 20:58:39,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,860 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 13 treesize of output 10 [2018-01-28 20:58:39,862 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 10 treesize of output 11 [2018-01-28 20:58:39,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:39,952 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 13 treesize of output 10 [2018-01-28 20:58:39,953 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 10 treesize of output 11 [2018-01-28 20:58:39,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:39,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:40,059 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 13 treesize of output 10 [2018-01-28 20:58:40,061 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 10 treesize of output 11 [2018-01-28 20:58:40,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:40,155 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 13 treesize of output 10 [2018-01-28 20:58:40,157 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 10 treesize of output 11 [2018-01-28 20:58:40,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:40,260 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 13 treesize of output 10 [2018-01-28 20:58:40,262 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 10 treesize of output 11 [2018-01-28 20:58:40,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:40,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:58:40,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:58:40,426 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:58:40,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:40,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:40,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:58:40,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:58:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:41,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:41,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2018-01-28 20:58:41,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-28 20:58:41,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-28 20:58:41,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3332, Unknown=0, NotChecked=0, Total=3782 [2018-01-28 20:58:41,346 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 62 states. [2018-01-28 20:58:42,989 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 43 DAG size of output 38 [2018-01-28 20:58:48,660 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 163 DAG size of output 43 [2018-01-28 20:58:49,377 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 143 DAG size of output 83 [2018-01-28 20:58:49,710 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-28 20:58:49,872 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-28 20:58:50,024 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-28 20:58:50,193 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-28 20:58:50,613 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-28 20:58:51,052 WARN L146 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-28 20:58:51,259 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 80 DAG size of output 65 [2018-01-28 20:58:51,415 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 82 DAG size of output 71 [2018-01-28 20:58:51,573 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-28 20:58:51,976 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-28 20:58:52,254 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-28 20:58:53,155 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-28 20:58:53,455 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-28 20:58:53,941 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 70 DAG size of output 61 [2018-01-28 20:58:54,118 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 74 DAG size of output 65 [2018-01-28 20:58:54,348 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 60 DAG size of output 51 [2018-01-28 20:58:54,568 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-28 20:58:55,110 WARN L146 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-28 20:58:55,530 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 62 DAG size of output 50 [2018-01-28 20:58:55,707 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 64 DAG size of output 56 [2018-01-28 20:58:56,042 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-01-28 20:58:56,248 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-28 20:58:56,460 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-28 20:58:58,014 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 64 DAG size of output 53 [2018-01-28 20:58:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:59,304 INFO L93 Difference]: Finished difference Result 358 states and 389 transitions. [2018-01-28 20:58:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-01-28 20:58:59,305 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 186 [2018-01-28 20:58:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:59,306 INFO L225 Difference]: With dead ends: 358 [2018-01-28 20:58:59,306 INFO L226 Difference]: Without dead ends: 355 [2018-01-28 20:58:59,312 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13557 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=6022, Invalid=31420, Unknown=0, NotChecked=0, Total=37442 [2018-01-28 20:58:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-28 20:58:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-01-28 20:58:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-28 20:58:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-01-28 20:58:59,329 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 186 [2018-01-28 20:58:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:59,329 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-01-28 20:58:59,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-28 20:58:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-01-28 20:58:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-28 20:58:59,335 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:59,335 INFO L330 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:59,335 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 20:58:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1615602281, now seen corresponding path program 9 times [2018-01-28 20:58:59,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:59,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:59,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:59,337 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:59,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:59,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:02,481 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 22 DAG size of output 22 [2018-01-28 20:59:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:04,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:04,175 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 20:59:04,180 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 20:59:04,203 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,207 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,211 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,216 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,220 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,226 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,231 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,237 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,245 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,267 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,299 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,309 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,347 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,494 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,689 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,907 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,936 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:04,978 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:05,036 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:05,067 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:05,157 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:05,227 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:05,258 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:05,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:05,323 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 8 treesize of output 7 [2018-01-28 20:59:05,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:05,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:05,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 20:59:08,694 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 13 treesize of output 10 [2018-01-28 20:59:08,704 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 10 treesize of output 11 [2018-01-28 20:59:08,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:08,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:08,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:08,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-28 20:59:09,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 20:59:09,356 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 20:59:09,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:09,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:09,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 20:59:09,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-28 20:59:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:10,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:10,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 105 [2018-01-28 20:59:10,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-01-28 20:59:10,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-01-28 20:59:10,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=9800, Unknown=0, NotChecked=0, Total=11130 [2018-01-28 20:59:10,514 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 106 states. [2018-01-28 20:59:26,225 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 284 DAG size of output 43 [2018-01-28 20:59:27,464 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 264 DAG size of output 138 [2018-01-28 20:59:28,297 WARN L146 SmtUtils]: Spent 579ms on a formula simplification. DAG size of input: 262 DAG size of output 215 [2018-01-28 20:59:28,705 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-28 20:59:29,117 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 154 DAG size of output 131 [2018-01-28 20:59:29,478 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 158 DAG size of output 135 [2018-01-28 20:59:29,803 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 144 DAG size of output 121 [2018-01-28 20:59:30,494 WARN L146 SmtUtils]: Spent 532ms on a formula simplification. DAG size of input: 248 DAG size of output 206 [2018-01-28 20:59:31,368 WARN L146 SmtUtils]: Spent 617ms on a formula simplification. DAG size of input: 251 DAG size of output 206 [2018-01-28 20:59:31,728 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 146 DAG size of output 120 [2018-01-28 20:59:32,055 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 148 DAG size of output 126 [2018-01-28 20:59:32,386 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 152 DAG size of output 130 [2018-01-28 20:59:32,698 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-28 20:59:33,489 WARN L146 SmtUtils]: Spent 642ms on a formula simplification. DAG size of input: 237 DAG size of output 197 [2018-01-28 20:59:34,219 WARN L146 SmtUtils]: Spent 493ms on a formula simplification. DAG size of input: 240 DAG size of output 197 [2018-01-28 20:59:34,560 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 140 DAG size of output 115 [2018-01-28 20:59:34,881 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 142 DAG size of output 121 [2018-01-28 20:59:35,311 WARN L146 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 146 DAG size of output 125 [2018-01-28 20:59:35,670 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 132 DAG size of output 111 [2018-01-28 20:59:36,448 WARN L146 SmtUtils]: Spent 612ms on a formula simplification. DAG size of input: 226 DAG size of output 188 [2018-01-28 20:59:37,136 WARN L146 SmtUtils]: Spent 449ms on a formula simplification. DAG size of input: 229 DAG size of output 188 [2018-01-28 20:59:37,481 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 134 DAG size of output 110 [2018-01-28 20:59:37,791 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 136 DAG size of output 116 [2018-01-28 20:59:38,170 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 140 DAG size of output 120 [2018-01-28 20:59:38,474 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 126 DAG size of output 106 [2018-01-28 20:59:39,046 WARN L146 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 215 DAG size of output 179 [2018-01-28 20:59:39,704 WARN L146 SmtUtils]: Spent 420ms on a formula simplification. DAG size of input: 218 DAG size of output 179 [2018-01-28 20:59:40,061 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 128 DAG size of output 105 [2018-01-28 20:59:40,372 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-01-28 20:59:40,677 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 134 DAG size of output 115 [2018-01-28 20:59:40,961 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-01-28 20:59:41,512 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 204 DAG size of output 170 [2018-01-28 20:59:42,143 WARN L146 SmtUtils]: Spent 391ms on a formula simplification. DAG size of input: 207 DAG size of output 170 [2018-01-28 20:59:43,466 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 122 DAG size of output 100 [2018-01-28 20:59:43,744 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 124 DAG size of output 106 [2018-01-28 20:59:44,036 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 128 DAG size of output 110 [2018-01-28 20:59:44,308 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 114 DAG size of output 96 [2018-01-28 20:59:44,825 WARN L146 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 193 DAG size of output 161 [2018-01-28 20:59:45,441 WARN L146 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 196 DAG size of output 161 [2018-01-28 20:59:45,749 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 116 DAG size of output 95 [2018-01-28 20:59:46,037 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 118 DAG size of output 101 [2018-01-28 20:59:46,453 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 122 DAG size of output 105 [2018-01-28 20:59:47,169 WARN L146 SmtUtils]: Spent 486ms on a formula simplification. DAG size of input: 108 DAG size of output 91 [2018-01-28 20:59:47,738 WARN L146 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 182 DAG size of output 152 [2018-01-28 20:59:48,328 WARN L146 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 185 DAG size of output 152 [2018-01-28 20:59:48,625 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 110 DAG size of output 90 [2018-01-28 20:59:48,893 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 112 DAG size of output 96 [2018-01-28 20:59:49,172 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 116 DAG size of output 100 [2018-01-28 20:59:49,412 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-01-28 20:59:49,938 WARN L146 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 171 DAG size of output 143 [2018-01-28 20:59:50,489 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 174 DAG size of output 143 [2018-01-28 20:59:50,775 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 104 DAG size of output 85 [2018-01-28 20:59:51,014 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-01-28 20:59:51,263 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-01-28 20:59:51,511 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-01-28 20:59:52,096 WARN L146 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 160 DAG size of output 134 [2018-01-28 20:59:52,636 WARN L146 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 163 DAG size of output 134 [2018-01-28 20:59:52,929 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 98 DAG size of output 80 [2018-01-28 20:59:53,167 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-28 20:59:53,412 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-01-28 20:59:53,618 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 90 DAG size of output 76 [2018-01-28 20:59:54,050 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 149 DAG size of output 125 [2018-01-28 20:59:54,568 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-28 20:59:54,830 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 92 DAG size of output 75 [2018-01-28 20:59:55,052 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 94 DAG size of output 81 [2018-01-28 20:59:55,281 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-01-28 20:59:55,478 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 84 DAG size of output 71 [2018-01-28 20:59:55,854 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-28 20:59:56,332 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-28 20:59:56,706 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-28 20:59:56,933 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-28 20:59:57,150 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-28 20:59:57,688 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-28 20:59:58,114 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-28 20:59:59,325 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-28 20:59:59,839 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-28 21:00:00,122 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 74 DAG size of output 60 [2018-01-28 21:00:00,342 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 76 DAG size of output 66 [2018-01-28 21:00:00,612 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-01-28 21:00:01,099 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-28 21:00:01,472 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-28 21:00:02,547 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-28 21:00:02,944 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-28 21:00:03,900 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-28 21:00:04,218 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-28 21:00:05,128 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 48 DAG size of output 41 [2018-01-28 21:00:05,377 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-28 21:00:07,461 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 46 DAG size of output 41 [2018-01-28 21:00:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:09,280 INFO L93 Difference]: Finished difference Result 666 states and 730 transitions. [2018-01-28 21:00:09,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2018-01-28 21:00:09,280 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 340 [2018-01-28 21:00:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:09,283 INFO L225 Difference]: With dead ends: 666 [2018-01-28 21:00:09,283 INFO L226 Difference]: Without dead ends: 663 [2018-01-28 21:00:09,293 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53388 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=21895, Invalid=114635, Unknown=0, NotChecked=0, Total=136530 [2018-01-28 21:00:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-01-28 21:00:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 659. [2018-01-28 21:00:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-01-28 21:00:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-01-28 21:00:09,335 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 340 [2018-01-28 21:00:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:09,336 INFO L432 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-01-28 21:00:09,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-01-28 21:00:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-01-28 21:00:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-01-28 21:00:09,340 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:09,340 INFO L330 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:09,340 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-28 21:00:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1575254769, now seen corresponding path program 10 times [2018-01-28 21:00:09,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:09,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:09,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:09,341 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:09,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:09,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-28 21:00:20,592 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:00:20,596 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:00:20,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:00:20 BoogieIcfgContainer [2018-01-28 21:00:20,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:00:20,597 INFO L168 Benchmark]: Toolchain (without parser) took 136491.23 ms. Allocated memory was 304.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 263.0 MB in the beginning and 673.5 MB in the end (delta: -410.5 MB). Peak memory consumption was 871.4 MB. Max. memory is 5.3 GB. [2018-01-28 21:00:20,598 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.1 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:00:20,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.38 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:00:20,599 INFO L168 Benchmark]: Boogie Preprocessor took 67.27 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.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 21:00:20,599 INFO L168 Benchmark]: RCFGBuilder took 563.09 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 233.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:00:20,600 INFO L168 Benchmark]: TraceAbstraction took 135582.31 ms. Allocated memory was 304.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 233.9 MB in the beginning and 673.5 MB in the end (delta: -439.6 MB). Peak memory consumption was 842.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:00:20,601 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.21 ms. Allocated memory is still 304.1 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 267.38 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.27 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 563.09 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 233.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 135582.31 ms. Allocated memory was 304.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 233.9 MB in the beginning and 673.5 MB in the end (delta: -439.6 MB). Peak memory consumption was 842.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 649 with TraceHistMax 46, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 647 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 11 error locations. TIMEOUT Result, 135.4s OverallTime, 16 OverallIterations, 46 TraceHistogramMax, 92.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 9441 SDslu, 16765 SDs, 0 SdLazy, 23185 SolverSat, 1376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1982 GetRequests, 954 SyntacticMatches, 38 SemanticMatches, 990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74827 ImplicationChecksByTransitivity, 96.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 65 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2362 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2339 ConstructedInterpolants, 117 QuantifiedInterpolants, 9496084 SizeOfPredicates, 418 NumberOfNonLiveVariables, 3528 ConjunctsInSsa, 763 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 0/11724 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/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-00-20-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-00-20-609.csv Completed graceful shutdown