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/rewnifrev_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:20:39,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:20:39,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:20:39,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:20:39,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:20:39,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:20:39,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:20:39,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:20:39,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:20:39,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:20:39,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:20:39,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:20:39,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:20:39,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:20:39,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:20:39,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:20:39,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:20:39,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:20:39,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:20:39,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:20:39,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:20:39,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:20:39,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:20:39,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:20:39,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:20:39,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:20:39,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:20:39,800 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:20:39,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:20:39,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:20:39,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:20:39,801 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:20:39,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:20:39,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:20:39,807 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:20:39,807 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:20:39,807 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:20:39,807 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:20:39,807 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:20:39,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:20:39,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:20:39,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:20:39,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:20:39,809 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:20:39,810 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:20:39,810 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:20:39,811 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:20:39,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:20:39,835 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:20:39,837 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:20:39,838 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:20:39,838 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:20:39,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev_true-unreach-call.i [2018-01-30 01:20:39,900 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:20:39,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:20:39,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:39,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:20:39,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:20:39,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:39" (1/1) ... [2018-01-30 01:20:39,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563b4aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:39, skipping insertion in model container [2018-01-30 01:20:39,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:39" (1/1) ... [2018-01-30 01:20:39,916 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:39,924 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:40,005 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:40,013 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:40,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40 WrapperNode [2018-01-30 01:20:40,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:40,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:20:40,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:20:40,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:20:40,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (1/1) ... [2018-01-30 01:20:40,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:20:40,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:20:40,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:20:40,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:20:40,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (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:20:40,073 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:20:40,073 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:20:40,073 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:20:40,073 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:20:40,073 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:20:40,074 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:20:40,074 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:20:40,074 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:20:40,074 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:20:40,074 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:20:40,356 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:20:40,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:40 BoogieIcfgContainer [2018-01-30 01:20:40,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:20:40,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:20:40,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:20:40,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:20:40,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:20:39" (1/3) ... [2018-01-30 01:20:40,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3c451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:20:40, skipping insertion in model container [2018-01-30 01:20:40,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:40" (2/3) ... [2018-01-30 01:20:40,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3c451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:20:40, skipping insertion in model container [2018-01-30 01:20:40,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:40" (3/3) ... [2018-01-30 01:20:40,362 INFO L107 eAbstractionObserver]: Analyzing ICFG rewnifrev_true-unreach-call.i [2018-01-30 01:20:40,367 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:20:40,371 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:20:40,395 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:20:40,395 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:20:40,395 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:20:40,395 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:20:40,396 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:20:40,396 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:20:40,396 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:20:40,396 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:20:40,396 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:20:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 01:20:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 01:20:40,409 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:40,409 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] [2018-01-30 01:20:40,409 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash 726012185, now seen corresponding path program 1 times [2018-01-30 01:20:40,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:40,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:40,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:40,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:40,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:40,484 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:20:40,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:40,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:20:40,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:20:40,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:20:40,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:20:40,495 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 01:20:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:40,507 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-30 01:20:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:20:40,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-30 01:20:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:40,513 INFO L225 Difference]: With dead ends: 56 [2018-01-30 01:20:40,514 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 01:20:40,515 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:20:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 01:20:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 01:20:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 01:20:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 01:20:40,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2018-01-30 01:20:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:40,536 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 01:20:40,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:20:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 01:20:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 01:20:40,536 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:40,537 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] [2018-01-30 01:20:40,537 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash 283091420, now seen corresponding path program 1 times [2018-01-30 01:20:40,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:40,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:40,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:40,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:40,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:40,597 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:20:40,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:40,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:20:40,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:20:40,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:20:40,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:20:40,598 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-01-30 01:20:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:40,779 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-01-30 01:20:40,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:20:40,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-30 01:20:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:40,780 INFO L225 Difference]: With dead ends: 60 [2018-01-30 01:20:40,780 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 01:20:40,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:20:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 01:20:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-01-30 01:20:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-30 01:20:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-30 01:20:40,784 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 21 [2018-01-30 01:20:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:40,784 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-30 01:20:40,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:20:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-30 01:20:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 01:20:40,784 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:40,785 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] [2018-01-30 01:20:40,785 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash 433486483, now seen corresponding path program 1 times [2018-01-30 01:20:40,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:40,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:40,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:40,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:40,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:40,845 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:20:40,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:40,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:20:40,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:20:40,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:20:40,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:20:40,846 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-30 01:20:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:41,073 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-30 01:20:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:20:41,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-30 01:20:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:41,075 INFO L225 Difference]: With dead ends: 60 [2018-01-30 01:20:41,075 INFO L226 Difference]: Without dead ends: 47 [2018-01-30 01:20:41,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:20:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-30 01:20:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2018-01-30 01:20:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-30 01:20:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-30 01:20:41,082 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2018-01-30 01:20:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:41,082 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-30 01:20:41,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:20:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-30 01:20:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 01:20:41,082 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:41,083 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:41,083 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash -100943511, now seen corresponding path program 1 times [2018-01-30 01:20:41,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:41,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:41,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:41,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:41,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:41,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:20:41,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:41,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 01:20:41,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:20:41,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:20:41,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:20:41,413 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-01-30 01:20:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:41,708 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-01-30 01:20:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:20:41,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-30 01:20:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:41,709 INFO L225 Difference]: With dead ends: 66 [2018-01-30 01:20:41,709 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 01:20:41,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:20:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 01:20:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2018-01-30 01:20:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 01:20:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-30 01:20:41,714 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 36 [2018-01-30 01:20:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:41,714 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-30 01:20:41,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:20:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-30 01:20:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:20:41,715 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:41,715 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:41,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1935702809, now seen corresponding path program 1 times [2018-01-30 01:20:41,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:41,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:41,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:41,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:41,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:41,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:42,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:20:42,136 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) [2018-01-30 01:20:42,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:20:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:42,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:20:42,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:20:42,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:42,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:20:42,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:20:42,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:20:42,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:42,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:20:42,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:20:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:42,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:20:42,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2018-01-30 01:20:42,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:20:42,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:20:42,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:20:42,482 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 25 states. [2018-01-30 01:20:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:43,056 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:20:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 01:20:43,057 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-30 01:20:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:43,059 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:20:43,059 INFO L226 Difference]: Without dead ends: 73 [2018-01-30 01:20:43,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 01:20:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-30 01:20:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-01-30 01:20:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-30 01:20:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-30 01:20:43,064 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 46 [2018-01-30 01:20:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:43,064 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-30 01:20:43,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:20:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-30 01:20:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 01:20:43,065 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:43,065 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:43,066 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash 298945253, now seen corresponding path program 2 times [2018-01-30 01:20:43,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:43,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:43,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:43,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:43,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:43,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:20:43,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:20:43,179 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:20:43,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:20:43,191 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:20:43,194 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:20:43,195 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:20:43,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:20:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:20:43,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:20:43,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-01-30 01:20:43,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 01:20:43,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 01:20:43,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:20:43,271 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 14 states. [2018-01-30 01:20:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:43,488 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-30 01:20:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 01:20:43,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-01-30 01:20:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:43,489 INFO L225 Difference]: With dead ends: 123 [2018-01-30 01:20:43,489 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 01:20:43,489 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-01-30 01:20:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 01:20:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-01-30 01:20:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 01:20:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-01-30 01:20:43,493 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 56 [2018-01-30 01:20:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:43,494 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-01-30 01:20:43,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 01:20:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-01-30 01:20:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 01:20:43,495 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:43,495 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:43,495 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:20:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1512243506, now seen corresponding path program 3 times [2018-01-30 01:20:43,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:43,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:43,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:43,496 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:20:43,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:43,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:20:43,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:20:43,868 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:20:43,882 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:20:43,887 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:20:43,901 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:20:43,904 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:20:43,906 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:20:43,907 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:20:43,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:20:43,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:20:43,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:43,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:20:43,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:20:44,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 21 [2018-01-30 01:20:44,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:20:44,074 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:20:44,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:39 [2018-01-30 01:20:44,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,137 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 19 treesize of output 32 [2018-01-30 01:20:44,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:44,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 50 [2018-01-30 01:20:44,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:44,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 01:20:44,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:49 [2018-01-30 01:20:44,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 55 [2018-01-30 01:20:44,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:20:44,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-30 01:20:44,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:87 [2018-01-30 01:20:44,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2018-01-30 01:20:44,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:44,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:44,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2018-01-30 01:20:44,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:45,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:20:45,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:87, output treesize:11 [2018-01-30 01:20:45,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2018-01-30 01:20:45,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:45,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:20:45,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2018-01-30 01:20:45,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:45,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:20:45,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:87, output treesize:11 [2018-01-30 01:20:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:20:45,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:20:45,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-01-30 01:20:45,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 01:20:45,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 01:20:45,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:20:45,927 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 40 states. [2018-01-30 01:21:14,791 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 79 DAG size of output 33 [2018-01-30 01:21:15,027 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 66 DAG size of output 61 [2018-01-30 01:21:15,437 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 58 [2018-01-30 01:21:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:16,097 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-01-30 01:21:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-30 01:21:16,097 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 64 [2018-01-30 01:21:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:16,098 INFO L225 Difference]: With dead ends: 167 [2018-01-30 01:21:16,098 INFO L226 Difference]: Without dead ends: 155 [2018-01-30 01:21:16,100 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1078, Invalid=9022, Unknown=0, NotChecked=0, Total=10100 [2018-01-30 01:21:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-30 01:21:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 77. [2018-01-30 01:21:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:21:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-30 01:21:16,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 64 [2018-01-30 01:21:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:16,107 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-30 01:21:16,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 01:21:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-30 01:21:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 01:21:16,108 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:16,108 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:16,108 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash -173469684, now seen corresponding path program 4 times [2018-01-30 01:21:16,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:16,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:16,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:16,109 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:16,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:16,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:21:16,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:16,245 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:21:16,259 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:21:16,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:16,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:21:16,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:16,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 19 [2018-01-30 01:21:16,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:21:16,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:21:16,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:21:16,418 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 19 states. [2018-01-30 01:21:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:16,644 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-01-30 01:21:16,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 01:21:16,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-01-30 01:21:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:16,645 INFO L225 Difference]: With dead ends: 151 [2018-01-30 01:21:16,645 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 01:21:16,645 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2018-01-30 01:21:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 01:21:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-01-30 01:21:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:21:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-01-30 01:21:16,653 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 74 [2018-01-30 01:21:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:16,653 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-01-30 01:21:16,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:21:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-01-30 01:21:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 01:21:16,654 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:16,654 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:16,654 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1995488181, now seen corresponding path program 5 times [2018-01-30 01:21:16,654 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:16,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:16,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:16,655 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:16,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:16,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 28 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 01:21:17,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:17,259 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:21:17,265 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:21:17,269 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:17,287 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:17,297 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:17,299 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:17,303 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:17,304 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:17,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:17,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:21:17,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:21:17,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,344 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 20 treesize of output 37 [2018-01-30 01:21:17,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:21:17,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 64 [2018-01-30 01:21:17,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:21:17,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 105 [2018-01-30 01:21:17,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2018-01-30 01:21:17,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 117 [2018-01-30 01:21:17,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-01-30 01:21:17,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:17,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2018-01-30 01:21:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:17,651 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:21:17,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-30 01:21:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:21:18,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:18,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-30 01:21:18,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 01:21:18,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 01:21:18,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2053, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 01:21:18,024 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 48 states. [2018-01-30 01:21:20,702 WARN L143 SmtUtils]: Spent 140ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-30 01:21:21,739 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 46 DAG size of output 27 [2018-01-30 01:21:22,512 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 43 DAG size of output 41 [2018-01-30 01:21:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:23,576 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-01-30 01:21:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-01-30 01:21:23,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-01-30 01:21:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:23,578 INFO L225 Difference]: With dead ends: 263 [2018-01-30 01:21:23,578 INFO L226 Difference]: Without dead ends: 197 [2018-01-30 01:21:23,583 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8379 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2275, Invalid=20677, Unknown=0, NotChecked=0, Total=22952 [2018-01-30 01:21:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-30 01:21:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2018-01-30 01:21:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-30 01:21:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-30 01:21:23,594 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 82 [2018-01-30 01:21:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:23,594 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-30 01:21:23,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 01:21:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-30 01:21:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 01:21:23,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:23,595 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:23,595 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 183274396, now seen corresponding path program 6 times [2018-01-30 01:21:23,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:23,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:23,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:23,596 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:23,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:23,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:23,932 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 01:21:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 35 proven. 116 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:21:24,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:24,387 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:21:24,397 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:21:24,404 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,411 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,418 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,420 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,423 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,426 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:24,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:24,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:24,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:21:24,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:21:24,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,488 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 20 treesize of output 37 [2018-01-30 01:21:24,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:21:24,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 64 [2018-01-30 01:21:24,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:21:24,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,594 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 36 treesize of output 105 [2018-01-30 01:21:24,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2018-01-30 01:21:24,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 117 [2018-01-30 01:21:24,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-01-30 01:21:24,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 154 [2018-01-30 01:21:24,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-01-30 01:21:24,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:24,811 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 0 case distinctions, treesize of input 50 treesize of output 168 [2018-01-30 01:21:24,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:24,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2018-01-30 01:21:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:25,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 0 case distinctions, treesize of input 50 treesize of output 160 [2018-01-30 01:21:25,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:25,381 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:21:25,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-01-30 01:21:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 71 proven. 71 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 01:21:26,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:26,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 54 [2018-01-30 01:21:26,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-30 01:21:26,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-30 01:21:26,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=2535, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 01:21:26,179 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 54 states. [2018-01-30 01:21:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:29,171 INFO L93 Difference]: Finished difference Result 273 states and 299 transitions. [2018-01-30 01:21:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-30 01:21:29,171 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 100 [2018-01-30 01:21:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:29,172 INFO L225 Difference]: With dead ends: 273 [2018-01-30 01:21:29,172 INFO L226 Difference]: Without dead ends: 261 [2018-01-30 01:21:29,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5666 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2050, Invalid=16040, Unknown=0, NotChecked=0, Total=18090 [2018-01-30 01:21:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-30 01:21:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 219. [2018-01-30 01:21:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-30 01:21:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 236 transitions. [2018-01-30 01:21:29,193 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 236 transitions. Word has length 100 [2018-01-30 01:21:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:29,193 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 236 transitions. [2018-01-30 01:21:29,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-30 01:21:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 236 transitions. [2018-01-30 01:21:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 01:21:29,195 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:29,195 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:29,195 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash 81051, now seen corresponding path program 7 times [2018-01-30 01:21:29,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:29,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:29,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:29,196 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:29,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:29,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-30 01:21:29,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:21:29,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:21:29,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:21:29,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:21:29,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:21:29,249 INFO L87 Difference]: Start difference. First operand 219 states and 236 transitions. Second operand 5 states. [2018-01-30 01:21:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:29,279 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2018-01-30 01:21:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:21:29,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-01-30 01:21:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:29,280 INFO L225 Difference]: With dead ends: 299 [2018-01-30 01:21:29,280 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 01:21:29,281 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:21:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 01:21:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-30 01:21:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 01:21:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-30 01:21:29,288 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 105 [2018-01-30 01:21:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:29,288 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-30 01:21:29,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:21:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-30 01:21:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 01:21:29,290 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:29,290 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:29,290 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1975612250, now seen corresponding path program 8 times [2018-01-30 01:21:29,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:29,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:29,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:29,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:21:29,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:29,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 01:21:29,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:29,503 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:21:29,508 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:21:29,513 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:29,520 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:29,521 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:29,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 01:21:29,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:29,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 29 [2018-01-30 01:21:29,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:21:29,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:21:29,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:21:29,707 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 29 states. [2018-01-30 01:21:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:30,002 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-01-30 01:21:30,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 01:21:30,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-01-30 01:21:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:30,003 INFO L225 Difference]: With dead ends: 196 [2018-01-30 01:21:30,003 INFO L226 Difference]: Without dead ends: 125 [2018-01-30 01:21:30,003 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 01:21:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-30 01:21:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-01-30 01:21:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 01:21:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-01-30 01:21:30,012 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 110 [2018-01-30 01:21:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:30,012 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-01-30 01:21:30,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:21:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-01-30 01:21:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-01-30 01:21:30,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:30,014 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:30,014 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 865746563, now seen corresponding path program 9 times [2018-01-30 01:21:30,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:30,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:30,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:30,015 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:30,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:30,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 38 proven. 186 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 01:21:30,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:30,900 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:21:30,904 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:21:30,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,911 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,913 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,915 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,918 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,921 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,923 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:21:30,924 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:30,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:30,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:21:30,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:30,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:30,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:21:30,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:30,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:30,991 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 20 treesize of output 37 [2018-01-30 01:21:30,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:30,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:30,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:21:31,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 64 [2018-01-30 01:21:31,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:21:31,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,118 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 36 treesize of output 105 [2018-01-30 01:21:31,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2018-01-30 01:21:31,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 117 [2018-01-30 01:21:31,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-01-30 01:21:31,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 154 [2018-01-30 01:21:31,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-01-30 01:21:31,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,362 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 0 case distinctions, treesize of input 50 treesize of output 168 [2018-01-30 01:21:31,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2018-01-30 01:21:31,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 211 [2018-01-30 01:21:31,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:21:31,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 227 [2018-01-30 01:21:31,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:51 [2018-01-30 01:21:31,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:31,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 217 [2018-01-30 01:21:31,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:31,877 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:21:31,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-30 01:21:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 108 proven. 104 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-30 01:21:33,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:33,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 37] total 62 [2018-01-30 01:21:33,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-30 01:21:33,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-30 01:21:33,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3411, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 01:21:33,779 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 62 states. [2018-01-30 01:21:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:35,638 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-01-30 01:21:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 01:21:35,639 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2018-01-30 01:21:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:35,640 INFO L225 Difference]: With dead ends: 153 [2018-01-30 01:21:35,640 INFO L226 Difference]: Without dead ends: 141 [2018-01-30 01:21:35,641 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 88 SyntacticMatches, 13 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2723 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1199, Invalid=9721, Unknown=0, NotChecked=0, Total=10920 [2018-01-30 01:21:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-30 01:21:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-01-30 01:21:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-30 01:21:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-01-30 01:21:35,650 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 118 [2018-01-30 01:21:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:35,650 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-01-30 01:21:35,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-30 01:21:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-01-30 01:21:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-30 01:21:35,651 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:35,651 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:35,651 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:35,651 INFO L82 PathProgramCache]: Analyzing trace with hash -925503103, now seen corresponding path program 10 times [2018-01-30 01:21:35,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:35,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:35,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:35,652 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:35,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:35,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 120 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 01:21:36,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:36,018 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:21:36,023 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:21:36,036 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:36,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 120 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 01:21:36,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:36,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 34 [2018-01-30 01:21:36,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:21:36,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:21:36,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:21:36,204 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 34 states. [2018-01-30 01:21:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:36,561 INFO L93 Difference]: Finished difference Result 224 states and 228 transitions. [2018-01-30 01:21:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:21:36,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2018-01-30 01:21:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:36,562 INFO L225 Difference]: With dead ends: 224 [2018-01-30 01:21:36,562 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 01:21:36,563 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=644, Invalid=2548, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 01:21:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 01:21:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-01-30 01:21:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 01:21:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-01-30 01:21:36,573 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 128 [2018-01-30 01:21:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:36,573 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-01-30 01:21:36,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:21:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-01-30 01:21:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-30 01:21:36,574 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:36,574 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:36,574 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -864312214, now seen corresponding path program 11 times [2018-01-30 01:21:36,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:36,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:36,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:36,575 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:36,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:36,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 45 proven. 266 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 01:21:37,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:37,736 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:21:37,742 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:21:37,746 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,755 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,763 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,766 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,771 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:21:37,774 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:37,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:37,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:21:37,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:21:37,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,821 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 20 treesize of output 37 [2018-01-30 01:21:37,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:21:37,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 64 [2018-01-30 01:21:37,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:21:37,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:37,955 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 36 treesize of output 105 [2018-01-30 01:21:37,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:37,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2018-01-30 01:21:38,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 117 [2018-01-30 01:21:38,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-01-30 01:21:38,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 154 [2018-01-30 01:21:38,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-01-30 01:21:38,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,187 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 0 case distinctions, treesize of input 50 treesize of output 168 [2018-01-30 01:21:38,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2018-01-30 01:21:38,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 211 [2018-01-30 01:21:38,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:21:38,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 227 [2018-01-30 01:21:38,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:51 [2018-01-30 01:21:38,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 276 [2018-01-30 01:21:38,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:62 [2018-01-30 01:21:38,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:38,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 294 [2018-01-30 01:21:38,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:38,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:60 [2018-01-30 01:21:39,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:39,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 282 [2018-01-30 01:21:39,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:39,136 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:21:39,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-01-30 01:21:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 153 proven. 143 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 01:21:40,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:40,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 71 [2018-01-30 01:21:40,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-01-30 01:21:40,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-01-30 01:21:40,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=4501, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 01:21:40,305 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 71 states. [2018-01-30 01:21:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:44,113 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-01-30 01:21:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-01-30 01:21:44,113 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 136 [2018-01-30 01:21:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:44,114 INFO L225 Difference]: With dead ends: 171 [2018-01-30 01:21:44,114 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 01:21:44,115 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3671 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1509, Invalid=13011, Unknown=0, NotChecked=0, Total=14520 [2018-01-30 01:21:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 01:21:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-01-30 01:21:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 01:21:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-01-30 01:21:44,124 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 136 [2018-01-30 01:21:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:44,125 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-01-30 01:21:44,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-01-30 01:21:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-01-30 01:21:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-30 01:21:44,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:44,126 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:44,126 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash 291136168, now seen corresponding path program 12 times [2018-01-30 01:21:44,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:44,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:44,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:44,126 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:44,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:44,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 161 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 01:21:44,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:44,549 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:21:44,555 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:21:44,560 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,562 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,563 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,565 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,568 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,570 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,573 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,577 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:21:44,577 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:21:44,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 161 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 01:21:44,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:44,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 39 [2018-01-30 01:21:44,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 01:21:44,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 01:21:44,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 01:21:44,788 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 39 states. [2018-01-30 01:21:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:21:45,340 INFO L93 Difference]: Finished difference Result 252 states and 256 transitions. [2018-01-30 01:21:45,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 01:21:45,340 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 146 [2018-01-30 01:21:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:21:45,341 INFO L225 Difference]: With dead ends: 252 [2018-01-30 01:21:45,341 INFO L226 Difference]: Without dead ends: 161 [2018-01-30 01:21:45,341 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=844, Invalid=3446, Unknown=0, NotChecked=0, Total=4290 [2018-01-30 01:21:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-30 01:21:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-01-30 01:21:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 01:21:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-01-30 01:21:45,351 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 146 [2018-01-30 01:21:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:21:45,351 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-01-30 01:21:45,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 01:21:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-01-30 01:21:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-30 01:21:45,352 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:21:45,352 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:21:45,352 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:21:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -37057199, now seen corresponding path program 13 times [2018-01-30 01:21:45,353 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:21:45,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:21:45,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:45,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:21:45,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:21:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:45,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:21:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 136 proven. 276 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-30 01:21:46,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:21:46,509 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:21:46,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:21:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:21:46,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:21:46,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:21:46,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:21:46,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,581 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 20 treesize of output 37 [2018-01-30 01:21:46,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:21:46,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 64 [2018-01-30 01:21:46,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:21:46,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,693 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 36 treesize of output 105 [2018-01-30 01:21:46,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2018-01-30 01:21:46,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 117 [2018-01-30 01:21:46,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-01-30 01:21:46,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 154 [2018-01-30 01:21:46,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-01-30 01:21:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:46,910 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 0 case distinctions, treesize of input 50 treesize of output 168 [2018-01-30 01:21:46,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:46,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2018-01-30 01:21:47,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 211 [2018-01-30 01:21:47,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:21:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 227 [2018-01-30 01:21:47,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:51 [2018-01-30 01:21:47,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 276 [2018-01-30 01:21:47,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:62 [2018-01-30 01:21:47,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 294 [2018-01-30 01:21:47,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:60 [2018-01-30 01:21:47,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 35 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 349 [2018-01-30 01:21:47,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-30 01:21:47,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:47,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 369 [2018-01-30 01:21:47,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:21:47,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:72 [2018-01-30 01:21:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,276 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:21:48,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:21:48,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 384 [2018-01-30 01:21:48,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:21:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:21:48,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:75 [2018-01-30 01:21:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 176 proven. 218 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 01:21:49,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:21:49,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 49] total 83 [2018-01-30 01:21:49,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-01-30 01:21:49,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-01-30 01:21:49,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=6331, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 01:21:49,828 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 83 states. Received shutdown request... [2018-01-30 01:21:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 01:21:55,628 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:21:55,630 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:21:55,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:21:55 BoogieIcfgContainer [2018-01-30 01:21:55,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:21:55,631 INFO L168 Benchmark]: Toolchain (without parser) took 75730.94 ms. Allocated memory was 148.9 MB in the beginning and 559.4 MB in the end (delta: 410.5 MB). Free memory was 115.1 MB in the beginning and 371.6 MB in the end (delta: -256.5 MB). Peak memory consumption was 154.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:21:55,632 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:21:55,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 115.18 ms. Allocated memory is still 148.9 MB. Free memory was 114.9 MB in the beginning and 106.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:21:55,632 INFO L168 Benchmark]: Boogie Preprocessor took 17.59 ms. Allocated memory is still 148.9 MB. Free memory was 106.9 MB in the beginning and 105.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:21:55,632 INFO L168 Benchmark]: RCFGBuilder took 322.62 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 93.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:21:55,632 INFO L168 Benchmark]: TraceAbstraction took 75273.27 ms. Allocated memory was 148.9 MB in the beginning and 559.4 MB in the end (delta: 410.5 MB). Free memory was 92.8 MB in the beginning and 371.6 MB in the end (delta: -278.8 MB). Peak memory consumption was 131.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:21:55,633 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.09 ms. Allocated memory is still 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 115.18 ms. Allocated memory is still 148.9 MB. Free memory was 114.9 MB in the beginning and 106.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.59 ms. Allocated memory is still 148.9 MB. Free memory was 106.9 MB in the beginning and 105.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 322.62 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 93.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 75273.27 ms. Allocated memory was 148.9 MB in the beginning and 559.4 MB in the end (delta: 410.5 MB). Free memory was 92.8 MB in the beginning and 371.6 MB in the end (delta: -278.8 MB). Peak memory consumption was 131.7 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 constructing difference of abstraction (157states) and interpolant automaton (currently 35 states, 83 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 113 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 75.2s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 53.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 656 SDtfs, 2026 SDslu, 7851 SDs, 0 SdLazy, 14263 SolverSat, 1227 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 36.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2111 GetRequests, 1054 SyntacticMatches, 69 SemanticMatches, 987 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31018 ImplicationChecksByTransitivity, 31.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred 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, 16 MinimizatonAttempts, 257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2637 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2610 ConstructedInterpolants, 236 QuantifiedInterpolants, 4137952 SizeOfPredicates, 232 NumberOfNonLiveVariables, 1872 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 2714/5143 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/rewnifrev_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-21-55-637.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rewnifrev_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-21-55-637.csv Completed graceful shutdown