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-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-tiling/nr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:09:33,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:09:33,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:09:33,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:09:33,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:09:33,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:09:33,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:09:33,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:09:33,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:09:33,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:09:33,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:09:33,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:09:33,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:09:33,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:09:33,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:09:33,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:09:33,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:09:33,631 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:09:33,632 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:09:33,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:09:33,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:09:33,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:09:33,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:09:33,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:09:33,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:09:33,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:09:33,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:09:33,636 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:09:33,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:09:33,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:09:33,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:09:33,637 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:09:33,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:09:33,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:09:33,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:09:33,642 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:09:33,642 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:09:33,642 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:09:33,642 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:09:33,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:09:33,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:09:33,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:09:33,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:09:33,644 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:09:33,645 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:09:33,645 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:09:33,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:09:33,670 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:09:33,672 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:09:33,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:09:33,673 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:09:33,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4_true-unreach-call.i [2018-01-30 01:09:33,736 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:09:33,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:09:33,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:09:33,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:09:33,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:09:33,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e72f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33, skipping insertion in model container [2018-01-30 01:09:33,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:09:33,762 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:09:33,837 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:09:33,848 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:09:33,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33 WrapperNode [2018-01-30 01:09:33,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:09:33,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:09:33,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:09:33,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:09:33,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... [2018-01-30 01:09:33,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:09:33,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:09:33,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:09:33,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:09:33,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (1/1) ... No working directory specified, using /home/daniel/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-30 01:09:33,921 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:09:33,921 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:09:33,922 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:09:33,922 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:09:33,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:09:34,223 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:09:34,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:09:34 BoogieIcfgContainer [2018-01-30 01:09:34,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:09:34,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:09:34,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:09:34,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:09:34,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:09:33" (1/3) ... [2018-01-30 01:09:34,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45557584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:09:34, skipping insertion in model container [2018-01-30 01:09:34,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:09:33" (2/3) ... [2018-01-30 01:09:34,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45557584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:09:34, skipping insertion in model container [2018-01-30 01:09:34,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:09:34" (3/3) ... [2018-01-30 01:09:34,228 INFO L107 eAbstractionObserver]: Analyzing ICFG nr4_true-unreach-call.i [2018-01-30 01:09:34,233 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:09:34,237 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:09:34,261 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:09:34,261 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:09:34,261 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:09:34,261 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:09:34,261 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:09:34,262 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:09:34,262 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:09:34,262 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:09:34,262 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:09:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-30 01:09:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:09:34,274 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:34,275 INFO L350 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] [2018-01-30 01:09:34,275 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:34,278 INFO L82 PathProgramCache]: Analyzing trace with hash -146207416, now seen corresponding path program 1 times [2018-01-30 01:09:34,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:34,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:34,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:34,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:34,358 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-30 01:09:34,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:09:34,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:09:34,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:09:34,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:09:34,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:09:34,369 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-30 01:09:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:34,382 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-01-30 01:09:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:09:34,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 01:09:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:34,388 INFO L225 Difference]: With dead ends: 81 [2018-01-30 01:09:34,388 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 01:09:34,390 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:09:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 01:09:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-30 01:09:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 01:09:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-30 01:09:34,411 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-30 01:09:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:34,411 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-30 01:09:34,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:09:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-30 01:09:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:09:34,412 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:34,412 INFO L350 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] [2018-01-30 01:09:34,412 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -16250492, now seen corresponding path program 1 times [2018-01-30 01:09:34,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:34,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:34,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:34,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:34,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:34,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:34,843 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 33 DAG size of output 9 [2018-01-30 01:09:34,960 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 40 DAG size of output 20 [2018-01-30 01:09:34,972 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-30 01:09:34,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:09:34,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:09:34,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:09:34,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:09:34,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:09:34,974 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-30 01:09:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:35,132 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-01-30 01:09:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:09:35,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-30 01:09:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:35,134 INFO L225 Difference]: With dead ends: 74 [2018-01-30 01:09:35,134 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 01:09:35,135 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:09:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 01:09:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-01-30 01:09:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 01:09:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-30 01:09:35,141 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2018-01-30 01:09:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:35,142 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-30 01:09:35,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:09:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-30 01:09:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:09:35,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:35,142 INFO L350 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, 1] [2018-01-30 01:09:35,142 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1651825929, now seen corresponding path program 1 times [2018-01-30 01:09:35,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:35,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:35,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:35,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:35,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:35,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:09:35,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:09:35,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:09:35,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:09:35,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:09:35,171 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2018-01-30 01:09:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:35,212 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-01-30 01:09:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:09:35,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-30 01:09:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:35,213 INFO L225 Difference]: With dead ends: 79 [2018-01-30 01:09:35,213 INFO L226 Difference]: Without dead ends: 52 [2018-01-30 01:09:35,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:09:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-30 01:09:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-01-30 01:09:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 01:09:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-30 01:09:35,217 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2018-01-30 01:09:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:35,218 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-30 01:09:35,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:09:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-30 01:09:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 01:09:35,218 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:35,218 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:35,218 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1500859485, now seen corresponding path program 1 times [2018-01-30 01:09:35,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:35,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:35,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:35,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:35,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:35,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:35,306 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:35,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:35,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:35,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:35,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:09:35,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:09:35,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:09:35,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:09:35,367 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-30 01:09:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:35,432 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-01-30 01:09:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:09:35,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-30 01:09:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:35,432 INFO L225 Difference]: With dead ends: 89 [2018-01-30 01:09:35,432 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 01:09:35,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:09:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 01:09:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-30 01:09:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 01:09:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-30 01:09:35,437 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 40 [2018-01-30 01:09:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:35,437 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-30 01:09:35,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:09:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-30 01:09:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 01:09:35,437 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:35,438 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:35,438 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 986494601, now seen corresponding path program 2 times [2018-01-30 01:09:35,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:35,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:35,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:35,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:35,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 01:09:35,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:35,538 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) [2018-01-30 01:09:35,565 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:09:35,575 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:09:35,588 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:09:35,599 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:09:35,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:35,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:35,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-01-30 01:09:35,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:09:35,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:09:35,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:09:35,840 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 10 states. [2018-01-30 01:09:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:36,038 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-30 01:09:36,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:09:36,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-01-30 01:09:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:36,038 INFO L225 Difference]: With dead ends: 107 [2018-01-30 01:09:36,039 INFO L226 Difference]: Without dead ends: 70 [2018-01-30 01:09:36,039 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:09:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-30 01:09:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-30 01:09:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 01:09:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-30 01:09:36,043 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 47 [2018-01-30 01:09:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:36,043 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-30 01:09:36,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:09:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-30 01:09:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 01:09:36,044 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:36,044 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:36,044 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -799097943, now seen corresponding path program 1 times [2018-01-30 01:09:36,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:36,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:36,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:36,045 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:09:36,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:36,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:36,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:36,530 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:36,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:36,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:36,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:09:36,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:36,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:09:36,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 01:09:36,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 01:09:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:36,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:09:36,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:09:36,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 106 [2018-01-30 01:09:36,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:36,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:09:36,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:41 [2018-01-30 01:09:36,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:36,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 81 [2018-01-30 01:09:36,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-01-30 01:09:36,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-01-30 01:09:36,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:114 [2018-01-30 01:09:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:37,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:37,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2018-01-30 01:09:37,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 01:09:37,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 01:09:37,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-01-30 01:09:37,344 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 28 states. [2018-01-30 01:09:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:39,082 INFO L93 Difference]: Finished difference Result 276 states and 314 transitions. [2018-01-30 01:09:39,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 01:09:39,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-01-30 01:09:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:39,087 INFO L225 Difference]: With dead ends: 276 [2018-01-30 01:09:39,087 INFO L226 Difference]: Without dead ends: 224 [2018-01-30 01:09:39,088 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=652, Invalid=2318, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 01:09:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-30 01:09:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 141. [2018-01-30 01:09:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-30 01:09:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2018-01-30 01:09:39,098 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 61 [2018-01-30 01:09:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:39,098 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2018-01-30 01:09:39,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 01:09:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2018-01-30 01:09:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-30 01:09:39,099 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:39,099 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:39,099 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1995663993, now seen corresponding path program 1 times [2018-01-30 01:09:39,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:39,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:39,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:39,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:39,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:39,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:39,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:39,579 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:39,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:39,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:39,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:09:39,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:39,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:09:39,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:09:39,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:39,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:39,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 01:09:39,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:39,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:09:39,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-30 01:09:39,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:39,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:39,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:39,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 56 [2018-01-30 01:09:39,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 01:09:39,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-30 01:09:39,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:73 [2018-01-30 01:09:47,173 WARN L146 SmtUtils]: Spent 6937ms on a formula simplification. DAG size of input: 54 DAG size of output 54 [2018-01-30 01:09:47,473 WARN L143 SmtUtils]: Spent 252ms on a formula simplification that was a NOOP. DAG size: 78 [2018-01-30 01:09:47,903 WARN L143 SmtUtils]: Spent 300ms on a formula simplification that was a NOOP. DAG size: 79 [2018-01-30 01:09:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:09:47,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:47,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2018-01-30 01:09:47,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 01:09:47,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 01:09:47,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 01:09:47,993 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand 36 states. [2018-01-30 01:09:48,582 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 66 DAG size of output 40 [2018-01-30 01:09:48,809 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 68 DAG size of output 42 [2018-01-30 01:09:49,165 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 81 DAG size of output 49 [2018-01-30 01:09:49,668 WARN L146 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 57 DAG size of output 38 [2018-01-30 01:09:50,485 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 59 DAG size of output 46 [2018-01-30 01:09:50,954 WARN L146 SmtUtils]: Spent 352ms on a formula simplification. DAG size of input: 95 DAG size of output 64 [2018-01-30 01:09:51,460 WARN L146 SmtUtils]: Spent 442ms on a formula simplification. DAG size of input: 108 DAG size of output 71 [2018-01-30 01:09:51,897 WARN L146 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-01-30 01:09:52,431 WARN L146 SmtUtils]: Spent 477ms on a formula simplification. DAG size of input: 95 DAG size of output 69 [2018-01-30 01:09:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:52,782 INFO L93 Difference]: Finished difference Result 265 states and 300 transitions. [2018-01-30 01:09:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:09:52,782 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-01-30 01:09:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:52,785 INFO L225 Difference]: With dead ends: 265 [2018-01-30 01:09:52,785 INFO L226 Difference]: Without dead ends: 253 [2018-01-30 01:09:52,786 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=663, Invalid=4029, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 01:09:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-30 01:09:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 154. [2018-01-30 01:09:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-30 01:09:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-01-30 01:09:52,798 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 71 [2018-01-30 01:09:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:52,798 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-01-30 01:09:52,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 01:09:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-01-30 01:09:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 01:09:52,799 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:52,799 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:52,799 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 122827237, now seen corresponding path program 2 times [2018-01-30 01:09:52,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:52,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:52,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:52,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:09:52,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:52,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 01:09:53,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:53,106 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:53,111 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:09:53,122 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:09:53,129 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:09:53,131 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:09:53,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:53,245 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-30 01:09:53,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:53,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:09:53,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:09:53,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:09:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 01:09:53,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:09:53,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 01:09:53,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:34 [2018-01-30 01:09:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:09:53,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:53,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2018-01-30 01:09:53,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:09:53,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:09:53,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:09:53,909 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 34 states. [2018-01-30 01:09:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:56,265 INFO L93 Difference]: Finished difference Result 398 states and 450 transitions. [2018-01-30 01:09:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-30 01:09:56,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 81 [2018-01-30 01:09:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:56,268 INFO L225 Difference]: With dead ends: 398 [2018-01-30 01:09:56,268 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 01:09:56,270 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=798, Invalid=6008, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 01:09:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 01:09:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 171. [2018-01-30 01:09:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-30 01:09:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-01-30 01:09:56,307 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 81 [2018-01-30 01:09:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:56,308 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-01-30 01:09:56,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:09:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-01-30 01:09:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-30 01:09:56,308 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:56,309 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:56,309 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1010725059, now seen corresponding path program 3 times [2018-01-30 01:09:56,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:56,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:56,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:56,313 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:09:56,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:56,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 01:09:56,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:56,617 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:56,623 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:09:56,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:09:56,640 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:09:56,653 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:09:56,667 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:09:56,679 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:09:56,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:09:56,891 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-30 01:09:56,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:09:56,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:09:56,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-01-30 01:09:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 01:09:58,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:09:58,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 36 [2018-01-30 01:09:58,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 01:09:58,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 01:09:58,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 01:09:58,147 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 36 states. [2018-01-30 01:09:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:09:59,368 INFO L93 Difference]: Finished difference Result 341 states and 387 transitions. [2018-01-30 01:09:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-30 01:09:59,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 91 [2018-01-30 01:09:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:09:59,370 INFO L225 Difference]: With dead ends: 341 [2018-01-30 01:09:59,370 INFO L226 Difference]: Without dead ends: 329 [2018-01-30 01:09:59,371 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=563, Invalid=4267, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 01:09:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-30 01:09:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 234. [2018-01-30 01:09:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 01:09:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 259 transitions. [2018-01-30 01:09:59,391 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 259 transitions. Word has length 91 [2018-01-30 01:09:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:09:59,392 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 259 transitions. [2018-01-30 01:09:59,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 01:09:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 259 transitions. [2018-01-30 01:09:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 01:09:59,393 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:09:59,393 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:09:59,393 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:09:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1144507871, now seen corresponding path program 4 times [2018-01-30 01:09:59,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:09:59,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:09:59,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:59,394 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:09:59,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:09:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:09:59,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:09:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 39 proven. 19 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-01-30 01:09:59,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:09:59,726 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:09:59,730 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:09:59,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:09:59,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:10:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-01-30 01:10:00,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:10:00,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-01-30 01:10:00,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 01:10:00,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 01:10:00,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:10:00,035 INFO L87 Difference]: Start difference. First operand 234 states and 259 transitions. Second operand 31 states. [2018-01-30 01:10:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:10:00,465 INFO L93 Difference]: Finished difference Result 400 states and 442 transitions. [2018-01-30 01:10:00,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 01:10:00,465 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 101 [2018-01-30 01:10:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:10:00,466 INFO L225 Difference]: With dead ends: 400 [2018-01-30 01:10:00,466 INFO L226 Difference]: Without dead ends: 345 [2018-01-30 01:10:00,467 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 01:10:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-30 01:10:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 239. [2018-01-30 01:10:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-30 01:10:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 264 transitions. [2018-01-30 01:10:00,486 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 264 transitions. Word has length 101 [2018-01-30 01:10:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:10:00,486 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 264 transitions. [2018-01-30 01:10:00,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 01:10:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-01-30 01:10:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-30 01:10:00,487 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:10:00,487 INFO L350 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:10:00,487 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:10:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1224343730, now seen corresponding path program 2 times [2018-01-30 01:10:00,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:10:00,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:10:00,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:10:00,488 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:10:00,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:10:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:10:00,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:10:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 17 proven. 209 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:10:01,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:10:01,121 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:10:01,130 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:10:01,137 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:10:01,143 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:10:01,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:10:01,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:10:01,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:10:01,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:01,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:10:01,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 01:10:01,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 01:10:01,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:01,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:10:01,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:10:01,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 106 [2018-01-30 01:10:01,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:01,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:10:01,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:41 [2018-01-30 01:10:01,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:01,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 133 [2018-01-30 01:10:01,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-01-30 01:10:01,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-01-30 01:10:01,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:176 [2018-01-30 01:10:01,937 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-30 01:10:02,291 WARN L143 SmtUtils]: Spent 303ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-30 01:10:03,524 WARN L143 SmtUtils]: Spent 755ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-30 01:10:03,848 WARN L143 SmtUtils]: Spent 280ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-30 01:10:03,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 107 [2018-01-30 01:10:03,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:10:03,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:03,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 113 [2018-01-30 01:10:03,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:10:04,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 107 [2018-01-30 01:10:04,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-30 01:10:04,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:04,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 180 [2018-01-30 01:10:04,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-01-30 01:10:04,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-01-30 01:10:04,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:186, output treesize:451 [2018-01-30 01:10:04,777 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 102 DAG size of output 28 [2018-01-30 01:10:04,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 129 [2018-01-30 01:10:05,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:05,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 123 [2018-01-30 01:10:05,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:05,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 129 [2018-01-30 01:10:05,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:05,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-30 01:10:05,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:145, output treesize:142 [2018-01-30 01:10:05,432 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 55 [2018-01-30 01:10:05,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 243 [2018-01-30 01:10:05,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:05,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 249 [2018-01-30 01:10:05,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:05,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:05,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 229 [2018-01-30 01:10:05,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:10:06,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-01-30 01:10:06,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:193, output treesize:190 [2018-01-30 01:10:06,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 75 treesize of output 256 [2018-01-30 01:10:06,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2018-01-30 01:10:06,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:06,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 75 treesize of output 260 [2018-01-30 01:10:06,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-01-30 01:10:07,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:10:07,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 274 [2018-01-30 01:10:07,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 32 xjuncts. [2018-01-30 01:10:07,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 67 dim-0 vars, and 16 xjuncts. [2018-01-30 01:10:07,793 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:226, output treesize:1042 Received shutdown request... [2018-01-30 01:10:53,543 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 01:10:53,544 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:10:53,546 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:10:53,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:10:53 BoogieIcfgContainer [2018-01-30 01:10:53,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:10:53,547 INFO L168 Benchmark]: Toolchain (without parser) took 79810.60 ms. Allocated memory was 148.9 MB in the beginning and 403.2 MB in the end (delta: 254.3 MB). Free memory was 114.0 MB in the beginning and 239.3 MB in the end (delta: -125.3 MB). Peak memory consumption was 128.9 MB. Max. memory is 5.3 GB. [2018-01-30 01:10:53,548 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:10:53,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 115.83 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:10:53,548 INFO L168 Benchmark]: Boogie Preprocessor took 20.67 ms. Allocated memory is still 148.9 MB. Free memory was 105.5 MB in the beginning and 103.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:10:53,548 INFO L168 Benchmark]: RCFGBuilder took 349.55 ms. Allocated memory is still 148.9 MB. Free memory was 103.9 MB in the beginning and 90.1 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:10:53,549 INFO L168 Benchmark]: TraceAbstraction took 79322.29 ms. Allocated memory was 148.9 MB in the beginning and 403.2 MB in the end (delta: 254.3 MB). Free memory was 89.9 MB in the beginning and 239.3 MB in the end (delta: -149.4 MB). Peak memory consumption was 104.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:10:53,551 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.12 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 115.83 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.67 ms. Allocated memory is still 148.9 MB. Free memory was 105.5 MB in the beginning and 103.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.55 ms. Allocated memory is still 148.9 MB. Free memory was 103.9 MB in the beginning and 90.1 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 79322.29 ms. Allocated memory was 148.9 MB in the beginning and 403.2 MB in the end (delta: 254.3 MB). Free memory was 89.9 MB in the beginning and 239.3 MB in the end (delta: -149.4 MB). Peak memory consumption was 104.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 98 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 447. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. TIMEOUT Result, 79.2s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 452 SDtfs, 1395 SDslu, 3571 SDs, 0 SdLazy, 4557 SolverSat, 469 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 424 SyntacticMatches, 13 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6163 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=10, 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, 10 MinimizatonAttempts, 511 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1049 ConstructedInterpolants, 106 QuantifiedInterpolants, 1237885 SizeOfPredicates, 67 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 344/826 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr4_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-10-53-555.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr4_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-10-53-555.csv Completed graceful shutdown