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/revcpyswp2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:15:35,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:15:35,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:15:35,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:15:35,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:15:35,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:15:35,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:15:35,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:15:35,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:15:35,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:15:35,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:15:35,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:15:35,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:15:35,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:15:35,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:15:35,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:15:35,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:15:35,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:15:35,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:15:35,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:15:35,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:15:35,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:15:35,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:15:35,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:15:35,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:15:35,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:15:35,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:15:35,078 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:15:35,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:15:35,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:15:35,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:15:35,078 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:15:35,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:15:35,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:15:35,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:15:35,084 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:15:35,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:15:35,084 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:15:35,084 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:15:35,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:15:35,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:15:35,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:15:35,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:15:35,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:15:35,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:15:35,087 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:15:35,087 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:15:35,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:15:35,114 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:15:35,116 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:15:35,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:15:35,117 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:15:35,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i [2018-01-30 01:15:35,186 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:15:35,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:15:35,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:15:35,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:15:35,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:15:35,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21792193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35, skipping insertion in model container [2018-01-30 01:15:35,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,207 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:15:35,218 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:15:35,305 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:15:35,316 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:15:35,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35 WrapperNode [2018-01-30 01:15:35,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:15:35,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:15:35,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:15:35,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:15:35,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (1/1) ... [2018-01-30 01:15:35,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:15:35,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:15:35,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:15:35,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:15:35,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (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:15:35,380 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:15:35,380 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:15:35,380 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:15:35,380 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:15:35,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:15:35,648 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:15:35,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:15:35 BoogieIcfgContainer [2018-01-30 01:15:35,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:15:35,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:15:35,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:15:35,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:15:35,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:15:35" (1/3) ... [2018-01-30 01:15:35,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113e23a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:15:35, skipping insertion in model container [2018-01-30 01:15:35,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:15:35" (2/3) ... [2018-01-30 01:15:35,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113e23a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:15:35, skipping insertion in model container [2018-01-30 01:15:35,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:15:35" (3/3) ... [2018-01-30 01:15:35,652 INFO L107 eAbstractionObserver]: Analyzing ICFG revcpyswp2_true-unreach-call.i [2018-01-30 01:15:35,657 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:15:35,662 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:15:35,686 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:15:35,686 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:15:35,686 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:15:35,686 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:15:35,686 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:15:35,686 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:15:35,686 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:15:35,686 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:15:35,687 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:15:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-30 01:15:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 01:15:35,699 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:35,700 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:35,700 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 510841721, now seen corresponding path program 1 times [2018-01-30 01:15:35,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:35,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:35,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:35,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:35,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:35,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:35,776 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:15:35,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:15:35,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:15:35,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:15:35,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:15:35,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:15:35,788 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-30 01:15:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:35,801 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-01-30 01:15:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:15:35,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-30 01:15:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:35,808 INFO L225 Difference]: With dead ends: 95 [2018-01-30 01:15:35,808 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 01:15:35,810 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:15:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 01:15:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-30 01:15:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 01:15:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-30 01:15:35,832 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2018-01-30 01:15:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:35,832 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-30 01:15:35,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:15:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-30 01:15:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 01:15:35,842 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:35,842 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:35,843 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1374766130, now seen corresponding path program 1 times [2018-01-30 01:15:35,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:35,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:35,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:35,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:35,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:35,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:35,989 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:15:35,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:15:35,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:15:35,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:15:35,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:15:35,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:15:35,991 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-30 01:15:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:36,336 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-30 01:15:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:15:36,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-30 01:15:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:36,340 INFO L225 Difference]: With dead ends: 110 [2018-01-30 01:15:36,340 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 01:15:36,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:15:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 01:15:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-01-30 01:15:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 01:15:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-30 01:15:36,348 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2018-01-30 01:15:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:36,348 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-30 01:15:36,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:15:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-30 01:15:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 01:15:36,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:36,349 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:36,349 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1580492751, now seen corresponding path program 1 times [2018-01-30 01:15:36,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:36,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:36,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:36,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:36,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:36,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:15:36,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:36,449 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:15:36,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:36,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:15:36,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:36,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 01:15:36,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:15:36,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:15:36,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:15:36,558 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2018-01-30 01:15:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:36,930 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-01-30 01:15:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:15:36,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-30 01:15:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:36,932 INFO L225 Difference]: With dead ends: 121 [2018-01-30 01:15:36,932 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:15:36,932 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:15:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:15:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2018-01-30 01:15:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 01:15:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-30 01:15:36,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 54 [2018-01-30 01:15:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:36,941 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-30 01:15:36,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:15:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-30 01:15:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 01:15:36,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:36,942 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:36,942 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1219632078, now seen corresponding path program 2 times [2018-01-30 01:15:36,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:36,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:36,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:36,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:36,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:36,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 01:15:37,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:37,036 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 01:15:37,046 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:15:37,057 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:37,072 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:37,082 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:37,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 01:15:37,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:37,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 01:15:37,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:15:37,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:15:37,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:15:37,165 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 9 states. [2018-01-30 01:15:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:37,430 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-01-30 01:15:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:15:37,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-01-30 01:15:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:37,431 INFO L225 Difference]: With dead ends: 114 [2018-01-30 01:15:37,431 INFO L226 Difference]: Without dead ends: 90 [2018-01-30 01:15:37,431 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:15:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-30 01:15:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-01-30 01:15:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 01:15:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-30 01:15:37,438 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 61 [2018-01-30 01:15:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:37,438 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-30 01:15:37,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:15:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-30 01:15:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 01:15:37,439 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:37,439 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:37,439 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash 977048859, now seen corresponding path program 3 times [2018-01-30 01:15:37,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:37,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:37,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:37,440 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:37,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:37,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 01:15:37,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:37,519 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:15:37,523 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:15:37,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:15:37,547 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:15:37,554 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:37,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 01:15:37,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:37,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 01:15:37,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:15:37,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:15:37,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:15:37,621 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-01-30 01:15:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:37,847 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-30 01:15:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:15:37,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-01-30 01:15:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:37,848 INFO L225 Difference]: With dead ends: 106 [2018-01-30 01:15:37,848 INFO L226 Difference]: Without dead ends: 93 [2018-01-30 01:15:37,848 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:15:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-30 01:15:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-01-30 01:15:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:15:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-30 01:15:37,853 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 69 [2018-01-30 01:15:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:37,854 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-30 01:15:37,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:15:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-30 01:15:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 01:15:37,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:37,854 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:37,854 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1041606446, now seen corresponding path program 4 times [2018-01-30 01:15:37,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:37,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:37,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:37,855 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:37,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:37,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:38,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:38,491 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:15:38,496 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:15:38,509 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:38,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:38,544 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 13 treesize of output 12 [2018-01-30 01:15:38,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:15:38,594 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 20 treesize of output 19 [2018-01-30 01:15:38,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:15:38,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-01-30 01:15:38,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-01-30 01:15:38,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:15:38,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-30 01:15:38,711 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 16 treesize of output 15 [2018-01-30 01:15:38,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 01:15:38,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 01:15:38,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:15:38,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-01-30 01:15:38,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:15:38,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:38,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:38,834 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 16 treesize of output 19 [2018-01-30 01:15:38,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:38,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-01-30 01:15:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:38,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:38,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 36 [2018-01-30 01:15:38,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 01:15:38,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 01:15:38,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 01:15:38,896 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 36 states. [2018-01-30 01:15:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:39,981 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-01-30 01:15:39,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:15:39,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-01-30 01:15:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:39,982 INFO L225 Difference]: With dead ends: 158 [2018-01-30 01:15:39,982 INFO L226 Difference]: Without dead ends: 146 [2018-01-30 01:15:39,983 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=614, Invalid=3418, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 01:15:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-30 01:15:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2018-01-30 01:15:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-30 01:15:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-30 01:15:39,989 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 77 [2018-01-30 01:15:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:39,989 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-30 01:15:39,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 01:15:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-30 01:15:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 01:15:39,990 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:39,990 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:39,991 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1383404336, now seen corresponding path program 1 times [2018-01-30 01:15:39,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:39,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:39,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:39,991 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:39,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:40,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:41,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:41,011 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:15:41,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:41,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:41,097 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 13 treesize of output 12 [2018-01-30 01:15:41,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:15:41,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:15:41,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:41,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:41,187 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 23 treesize of output 33 [2018-01-30 01:15:41,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 01:15:41,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 01:15:41,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-30 01:15:41,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:15:41,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:15:41,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:41,319 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 25 treesize of output 37 [2018-01-30 01:15:41,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:22 [2018-01-30 01:15:41,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 01:15:41,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:15:41,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:9 [2018-01-30 01:15:41,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 01:15:41,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:41,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:1 [2018-01-30 01:15:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:41,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:41,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18] total 40 [2018-01-30 01:15:41,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 01:15:41,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 01:15:41,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:15:41,554 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 40 states. [2018-01-30 01:15:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:43,496 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2018-01-30 01:15:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-30 01:15:43,496 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 87 [2018-01-30 01:15:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:43,499 INFO L225 Difference]: With dead ends: 214 [2018-01-30 01:15:43,501 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 01:15:43,503 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=822, Invalid=5820, Unknown=0, NotChecked=0, Total=6642 [2018-01-30 01:15:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 01:15:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 159. [2018-01-30 01:15:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-30 01:15:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2018-01-30 01:15:43,524 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 87 [2018-01-30 01:15:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:43,524 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2018-01-30 01:15:43,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 01:15:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2018-01-30 01:15:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 01:15:43,525 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:43,529 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:43,529 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2045304228, now seen corresponding path program 5 times [2018-01-30 01:15:43,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:43,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:43,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:43,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:43,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:43,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 01:15:43,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:43,687 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:15:43,697 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:15:43,704 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:43,705 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:43,707 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:43,710 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:43,720 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:43,726 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:43,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-30 01:15:43,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:43,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-30 01:15:43,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 01:15:43,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 01:15:43,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-30 01:15:43,870 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 24 states. [2018-01-30 01:15:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:44,506 INFO L93 Difference]: Finished difference Result 388 states and 413 transitions. [2018-01-30 01:15:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 01:15:44,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-01-30 01:15:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:44,507 INFO L225 Difference]: With dead ends: 388 [2018-01-30 01:15:44,507 INFO L226 Difference]: Without dead ends: 313 [2018-01-30 01:15:44,508 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=2404, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 01:15:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-30 01:15:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 210. [2018-01-30 01:15:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-30 01:15:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-01-30 01:15:44,516 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 93 [2018-01-30 01:15:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:44,516 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-01-30 01:15:44,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 01:15:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-01-30 01:15:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-30 01:15:44,517 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:44,517 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:44,517 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1362743495, now seen corresponding path program 2 times [2018-01-30 01:15:44,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:44,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:44,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:44,518 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:44,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:44,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:15:44,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:44,623 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:15:44,629 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:15:44,634 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:44,639 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:44,640 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:44,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 01:15:44,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:44,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 01:15:44,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 01:15:44,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 01:15:44,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:15:44,733 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 18 states. [2018-01-30 01:15:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:44,997 INFO L93 Difference]: Finished difference Result 299 states and 316 transitions. [2018-01-30 01:15:45,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 01:15:45,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-01-30 01:15:45,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:45,002 INFO L225 Difference]: With dead ends: 299 [2018-01-30 01:15:45,002 INFO L226 Difference]: Without dead ends: 271 [2018-01-30 01:15:45,003 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:15:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-30 01:15:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 237. [2018-01-30 01:15:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 01:15:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 248 transitions. [2018-01-30 01:15:45,011 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 248 transitions. Word has length 95 [2018-01-30 01:15:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:45,011 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 248 transitions. [2018-01-30 01:15:45,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 01:15:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 248 transitions. [2018-01-30 01:15:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-30 01:15:45,012 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:45,012 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:45,012 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1632036018, now seen corresponding path program 3 times [2018-01-30 01:15:45,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:45,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:45,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:45,013 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:45,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:45,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 01:15:45,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:45,152 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:15:45,158 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:15:45,165 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:15:45,168 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:15:45,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:15:45,172 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:45,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 01:15:45,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:45,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-30 01:15:45,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 01:15:45,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 01:15:45,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:15:45,286 INFO L87 Difference]: Start difference. First operand 237 states and 248 transitions. Second operand 20 states. [2018-01-30 01:15:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:45,576 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2018-01-30 01:15:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 01:15:45,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-01-30 01:15:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:45,577 INFO L225 Difference]: With dead ends: 289 [2018-01-30 01:15:45,577 INFO L226 Difference]: Without dead ends: 208 [2018-01-30 01:15:45,578 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 01:15:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-30 01:15:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 149. [2018-01-30 01:15:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 01:15:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-01-30 01:15:45,584 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 97 [2018-01-30 01:15:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:45,584 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-01-30 01:15:45,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 01:15:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-01-30 01:15:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-30 01:15:45,585 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:45,585 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:45,585 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash 706699204, now seen corresponding path program 4 times [2018-01-30 01:15:45,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:45,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:45,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:45,586 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:45,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:45,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 01:15:45,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:45,713 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:15:45,718 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:15:45,728 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:45,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-30 01:15:45,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:45,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 01:15:45,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 01:15:45,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 01:15:45,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:15:45,794 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 18 states. [2018-01-30 01:15:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:46,060 INFO L93 Difference]: Finished difference Result 201 states and 211 transitions. [2018-01-30 01:15:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 01:15:46,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2018-01-30 01:15:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:46,061 INFO L225 Difference]: With dead ends: 201 [2018-01-30 01:15:46,061 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 01:15:46,061 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:15:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 01:15:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2018-01-30 01:15:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 01:15:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-01-30 01:15:46,066 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 102 [2018-01-30 01:15:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:46,066 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-01-30 01:15:46,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 01:15:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-01-30 01:15:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 01:15:46,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:46,067 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:46,067 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 49915288, now seen corresponding path program 6 times [2018-01-30 01:15:46,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:46,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:46,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:46,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:46,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:46,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 01:15:46,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:46,383 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:15:46,388 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:15:46,394 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:46,395 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:46,398 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:46,400 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:46,403 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:46,404 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:46,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 01:15:46,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:46,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 01:15:46,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 01:15:46,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 01:15:46,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-01-30 01:15:46,485 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 24 states. [2018-01-30 01:15:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:47,153 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-01-30 01:15:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 01:15:47,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-01-30 01:15:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:47,154 INFO L225 Difference]: With dead ends: 194 [2018-01-30 01:15:47,154 INFO L226 Difference]: Without dead ends: 181 [2018-01-30 01:15:47,154 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 01:15:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-30 01:15:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 157. [2018-01-30 01:15:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 01:15:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2018-01-30 01:15:47,159 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 108 [2018-01-30 01:15:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:47,160 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2018-01-30 01:15:47,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 01:15:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2018-01-30 01:15:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 01:15:47,160 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:47,160 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:47,160 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -656651923, now seen corresponding path program 5 times [2018-01-30 01:15:47,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:47,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:47,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:47,161 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:47,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:47,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:47,754 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-30 01:15:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:48,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:48,268 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:15:48,273 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:15:48,279 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:48,281 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:48,284 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:48,290 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:15:48,292 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:48,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:48,382 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 13 treesize of output 12 [2018-01-30 01:15:48,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:48,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:48,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:15:48,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:48,523 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 26 treesize of output 29 [2018-01-30 01:15:48,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:48,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:48,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:36 [2018-01-30 01:15:48,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:48,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:48,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-01-30 01:15:48,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:48,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:15:48,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:48,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:48,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-01-30 01:15:49,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:49,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:49,064 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:15:49,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-01-30 01:15:49,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:17 [2018-01-30 01:15:49,095 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 13 treesize of output 12 [2018-01-30 01:15:49,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:15:49,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:49,170 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 20 treesize of output 25 [2018-01-30 01:15:49,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 01:15:49,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:49,360 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 21 treesize of output 26 [2018-01-30 01:15:49,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,366 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:15:49,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:24 [2018-01-30 01:15:49,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:15:49,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 01:15:49,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-30 01:15:49,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:15:49,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:49,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:49,550 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 20 treesize of output 25 [2018-01-30 01:15:49,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,555 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 1 xjuncts. [2018-01-30 01:15:49,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-01-30 01:15:49,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:15:49,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:49,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 01:15:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:15:49,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:49,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 56 [2018-01-30 01:15:49,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-30 01:15:49,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-30 01:15:49,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2769, Unknown=0, NotChecked=0, Total=3080 [2018-01-30 01:15:49,944 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 56 states. [2018-01-30 01:15:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:55,594 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-01-30 01:15:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-30 01:15:55,594 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-01-30 01:15:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:55,595 INFO L225 Difference]: With dead ends: 275 [2018-01-30 01:15:55,595 INFO L226 Difference]: Without dead ends: 263 [2018-01-30 01:15:55,597 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1309, Invalid=9821, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 01:15:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-30 01:15:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 234. [2018-01-30 01:15:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 01:15:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 246 transitions. [2018-01-30 01:15:55,605 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 246 transitions. Word has length 110 [2018-01-30 01:15:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:55,605 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 246 transitions. [2018-01-30 01:15:55,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-30 01:15:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 246 transitions. [2018-01-30 01:15:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-30 01:15:55,606 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:55,606 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:55,606 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash 704748623, now seen corresponding path program 7 times [2018-01-30 01:15:55,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:55,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:55,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:55,607 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:15:55,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:55,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 01:15:55,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:55,753 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:15:55,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:55,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 01:15:55,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:55,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 01:15:55,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 01:15:55,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 01:15:55,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-30 01:15:55,880 INFO L87 Difference]: Start difference. First operand 234 states and 246 transitions. Second operand 24 states. [2018-01-30 01:15:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:15:56,386 INFO L93 Difference]: Finished difference Result 475 states and 501 transitions. [2018-01-30 01:15:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:15:56,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-01-30 01:15:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:15:56,388 INFO L225 Difference]: With dead ends: 475 [2018-01-30 01:15:56,388 INFO L226 Difference]: Without dead ends: 334 [2018-01-30 01:15:56,389 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=417, Invalid=2235, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 01:15:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-30 01:15:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2018-01-30 01:15:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-30 01:15:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 339 transitions. [2018-01-30 01:15:56,407 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 339 transitions. Word has length 116 [2018-01-30 01:15:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:15:56,407 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 339 transitions. [2018-01-30 01:15:56,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 01:15:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 339 transitions. [2018-01-30 01:15:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-30 01:15:56,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:15:56,408 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:15:56,408 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:15:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash 424220587, now seen corresponding path program 6 times [2018-01-30 01:15:56,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:15:56,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:15:56,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:56,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:15:56,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:15:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:15:56,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:15:56,839 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 01:15:57,287 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 7 DAG size of output 5 [2018-01-30 01:15:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:15:58,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:15:58,317 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:15:58,321 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:15:58,327 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:58,329 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:58,332 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:58,335 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:15:58,338 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:15:58,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:15:58,488 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 13 treesize of output 12 [2018-01-30 01:15:58,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:15:58,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:15:58,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:58,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:58,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 01:15:58,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-30 01:15:58,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:15:58,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:15:58,729 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 16 treesize of output 15 [2018-01-30 01:15:58,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 01:15:58,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 01:15:58,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:15:58,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:15:58,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:32 [2018-01-30 01:15:58,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 01:15:58,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 01:15:58,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:58,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:15:58,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-01-30 01:15:59,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:59,203 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 16 treesize of output 19 [2018-01-30 01:15:59,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,211 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:15:59,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:27 [2018-01-30 01:15:59,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:15:59,330 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 16 treesize of output 19 [2018-01-30 01:15:59,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,338 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:15:59,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:27 [2018-01-30 01:15:59,490 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:15:59,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-30 01:15:59,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:15:59,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:19 [2018-01-30 01:15:59,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 01:15:59,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-30 01:15:59,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 01:15:59,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:15:59,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-30 01:15:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 5 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:15:59,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:15:59,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 74 [2018-01-30 01:15:59,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-01-30 01:15:59,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-01-30 01:15:59,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=4929, Unknown=0, NotChecked=0, Total=5402 [2018-01-30 01:15:59,958 INFO L87 Difference]: Start difference. First operand 324 states and 339 transitions. Second operand 74 states. [2018-01-30 01:16:01,532 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 58 DAG size of output 32 [2018-01-30 01:16:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:05,466 INFO L93 Difference]: Finished difference Result 396 states and 423 transitions. [2018-01-30 01:16:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-01-30 01:16:05,466 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 120 [2018-01-30 01:16:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:05,467 INFO L225 Difference]: With dead ends: 396 [2018-01-30 01:16:05,467 INFO L226 Difference]: Without dead ends: 286 [2018-01-30 01:16:05,471 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6678 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2006, Invalid=19750, Unknown=0, NotChecked=0, Total=21756 [2018-01-30 01:16:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-30 01:16:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 261. [2018-01-30 01:16:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-30 01:16:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 275 transitions. [2018-01-30 01:16:05,482 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 275 transitions. Word has length 120 [2018-01-30 01:16:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:05,482 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 275 transitions. [2018-01-30 01:16:05,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-01-30 01:16:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 275 transitions. [2018-01-30 01:16:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 01:16:05,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:05,483 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:05,483 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1642741106, now seen corresponding path program 8 times [2018-01-30 01:16:05,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:05,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:05,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:05,484 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:05,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:05,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:16:06,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:06,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:06,303 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:16:06,308 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:06,314 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:06,317 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:06,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:06,322 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 13 treesize of output 12 [2018-01-30 01:16:06,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:06,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,367 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 27 treesize of output 32 [2018-01-30 01:16:06,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:16:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 01:16:06,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 01:16:06,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 96 [2018-01-30 01:16:06,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,570 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:16:06,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-01-30 01:16:06,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,770 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:16:06,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-01-30 01:16:06,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:14 [2018-01-30 01:16:06,824 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 13 treesize of output 12 [2018-01-30 01:16:06,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:16:06,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,890 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 16 treesize of output 19 [2018-01-30 01:16:06,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:06,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,938 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 16 treesize of output 19 [2018-01-30 01:16:06,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:06,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:06,989 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 16 treesize of output 19 [2018-01-30 01:16:06,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:06,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-01-30 01:16:07,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:16:07,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 01:16:07,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 01:16:07,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:07,095 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 22 treesize of output 27 [2018-01-30 01:16:07,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:07,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 01:16:07,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:07,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:07,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:07,209 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 20 treesize of output 25 [2018-01-30 01:16:07,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,214 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 1 xjuncts. [2018-01-30 01:16:07,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-01-30 01:16:07,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:07,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:07,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:07,551 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 20 treesize of output 25 [2018-01-30 01:16:07,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:07,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:07,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-01-30 01:16:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 13 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:16:08,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:08,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31] total 62 [2018-01-30 01:16:08,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-30 01:16:08,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-30 01:16:08,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 01:16:08,192 INFO L87 Difference]: Start difference. First operand 261 states and 275 transitions. Second operand 62 states. [2018-01-30 01:16:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:09,861 INFO L93 Difference]: Finished difference Result 296 states and 314 transitions. [2018-01-30 01:16:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 01:16:09,861 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-01-30 01:16:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:09,862 INFO L225 Difference]: With dead ends: 296 [2018-01-30 01:16:09,862 INFO L226 Difference]: Without dead ends: 274 [2018-01-30 01:16:09,863 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 95 SyntacticMatches, 16 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1061, Invalid=7495, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 01:16:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-30 01:16:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2018-01-30 01:16:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-30 01:16:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2018-01-30 01:16:09,875 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 123 [2018-01-30 01:16:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:09,876 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2018-01-30 01:16:09,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-30 01:16:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2018-01-30 01:16:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 01:16:09,876 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:09,876 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:09,876 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1237638722, now seen corresponding path program 7 times [2018-01-30 01:16:09,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:09,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:09,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:09,877 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:09,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:09,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 29 proven. 53 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 01:16:10,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:10,099 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:10,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:16:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:10,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 27 proven. 53 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-01-30 01:16:10,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:10,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 01:16:10,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 01:16:10,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 01:16:10,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-01-30 01:16:10,196 INFO L87 Difference]: Start difference. First operand 268 states and 282 transitions. Second operand 24 states. [2018-01-30 01:16:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:10,510 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2018-01-30 01:16:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 01:16:10,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2018-01-30 01:16:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:10,511 INFO L225 Difference]: With dead ends: 292 [2018-01-30 01:16:10,511 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 01:16:10,511 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 01:16:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 01:16:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-01-30 01:16:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 01:16:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2018-01-30 01:16:10,518 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 133 [2018-01-30 01:16:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:10,518 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2018-01-30 01:16:10,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 01:16:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2018-01-30 01:16:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 01:16:10,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:10,519 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:10,519 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -653931161, now seen corresponding path program 8 times [2018-01-30 01:16:10,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:10,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:10,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:10,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:16:10,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:10,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 56 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 01:16:10,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:10,706 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:10,711 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:16:10,716 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:10,724 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:10,725 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:10,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-01-30 01:16:10,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:10,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 01:16:10,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:16:10,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:16:10,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:16:10,889 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand 34 states. [2018-01-30 01:16:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:11,525 INFO L93 Difference]: Finished difference Result 339 states and 353 transitions. [2018-01-30 01:16:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 01:16:11,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-01-30 01:16:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:11,526 INFO L225 Difference]: With dead ends: 339 [2018-01-30 01:16:11,526 INFO L226 Difference]: Without dead ends: 311 [2018-01-30 01:16:11,527 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=736, Invalid=4814, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 01:16:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-30 01:16:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2018-01-30 01:16:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 01:16:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 288 transitions. [2018-01-30 01:16:11,550 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 288 transitions. Word has length 141 [2018-01-30 01:16:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:11,551 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 288 transitions. [2018-01-30 01:16:11,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:16:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 288 transitions. [2018-01-30 01:16:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 01:16:11,551 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:11,551 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:11,551 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2075669785, now seen corresponding path program 9 times [2018-01-30 01:16:11,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:11,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:11,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:11,552 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:11,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:11,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 50 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-01-30 01:16:11,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:11,772 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:11,778 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:16:11,784 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,787 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,789 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,795 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,800 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:11,801 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:11,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-01-30 01:16:11,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:11,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-01-30 01:16:11,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 01:16:11,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 01:16:11,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-01-30 01:16:11,936 INFO L87 Difference]: Start difference. First operand 279 states and 288 transitions. Second operand 30 states. [2018-01-30 01:16:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:12,315 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2018-01-30 01:16:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 01:16:12,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2018-01-30 01:16:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:12,323 INFO L225 Difference]: With dead ends: 369 [2018-01-30 01:16:12,323 INFO L226 Difference]: Without dead ends: 306 [2018-01-30 01:16:12,323 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=2305, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 01:16:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-30 01:16:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 232. [2018-01-30 01:16:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-30 01:16:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 238 transitions. [2018-01-30 01:16:12,333 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 238 transitions. Word has length 141 [2018-01-30 01:16:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:12,333 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 238 transitions. [2018-01-30 01:16:12,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 01:16:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 238 transitions. [2018-01-30 01:16:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-30 01:16:12,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:12,333 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:12,333 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1668837358, now seen corresponding path program 10 times [2018-01-30 01:16:12,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:12,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:12,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:12,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:12,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:12,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:16:14,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:14,220 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:14,225 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:16:14,242 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:14,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:14,272 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 13 treesize of output 12 [2018-01-30 01:16:14,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:16:14,359 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 20 treesize of output 19 [2018-01-30 01:16:14,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:14,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:14,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:14,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-01-30 01:16:14,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-30 01:16:14,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:14,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:14,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-01-30 01:16:14,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-30 01:16:14,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-01-30 01:16:14,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-01-30 01:16:14,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:16:14,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-30 01:16:14,722 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 16 treesize of output 15 [2018-01-30 01:16:14,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 01:16:14,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,789 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 16 treesize of output 19 [2018-01-30 01:16:14,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:14,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:14,861 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 16 treesize of output 19 [2018-01-30 01:16:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:14,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 01:16:14,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:16:14,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:14,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-01-30 01:16:15,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:15,032 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 18 treesize of output 21 [2018-01-30 01:16:15,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:15,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-01-30 01:16:15,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2018-01-30 01:16:15,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:1 [2018-01-30 01:16:15,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2018-01-30 01:16:15,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:15,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:1 [2018-01-30 01:16:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 174 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:16:15,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:15,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 34] total 71 [2018-01-30 01:16:15,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-01-30 01:16:15,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-01-30 01:16:15,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4574, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 01:16:15,388 INFO L87 Difference]: Start difference. First operand 232 states and 238 transitions. Second operand 71 states. [2018-01-30 01:16:19,191 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 108 DAG size of output 46 [2018-01-30 01:16:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:20,333 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2018-01-30 01:16:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-01-30 01:16:20,334 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2018-01-30 01:16:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:20,335 INFO L225 Difference]: With dead ends: 278 [2018-01-30 01:16:20,335 INFO L226 Difference]: Without dead ends: 266 [2018-01-30 01:16:20,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 115 SyntacticMatches, 15 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6670 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2021, Invalid=20629, Unknown=0, NotChecked=0, Total=22650 [2018-01-30 01:16:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-30 01:16:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 245. [2018-01-30 01:16:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-30 01:16:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 252 transitions. [2018-01-30 01:16:20,347 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 252 transitions. Word has length 143 [2018-01-30 01:16:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:20,347 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 252 transitions. [2018-01-30 01:16:20,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-01-30 01:16:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 252 transitions. [2018-01-30 01:16:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-30 01:16:20,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:20,348 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:20,348 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1724715350, now seen corresponding path program 11 times [2018-01-30 01:16:20,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:20,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:20,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:20,348 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:20,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:20,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 52 proven. 86 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 01:16:20,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:20,809 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:20,813 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:16:20,818 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,820 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,823 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,825 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,829 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,836 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:20,837 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:20,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 56 proven. 90 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-01-30 01:16:21,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:21,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 01:16:21,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:16:21,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:16:21,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:16:21,024 INFO L87 Difference]: Start difference. First operand 245 states and 252 transitions. Second operand 34 states. [2018-01-30 01:16:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:21,868 INFO L93 Difference]: Finished difference Result 355 states and 365 transitions. [2018-01-30 01:16:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-30 01:16:21,868 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 148 [2018-01-30 01:16:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:21,869 INFO L225 Difference]: With dead ends: 355 [2018-01-30 01:16:21,869 INFO L226 Difference]: Without dead ends: 276 [2018-01-30 01:16:21,870 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=891, Invalid=5915, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 01:16:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-30 01:16:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 250. [2018-01-30 01:16:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-30 01:16:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 255 transitions. [2018-01-30 01:16:21,883 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 255 transitions. Word has length 148 [2018-01-30 01:16:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:21,883 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 255 transitions. [2018-01-30 01:16:21,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:16:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 255 transitions. [2018-01-30 01:16:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-30 01:16:21,884 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:21,884 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:21,884 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 179032300, now seen corresponding path program 12 times [2018-01-30 01:16:21,884 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:21,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:21,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:21,885 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:21,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:21,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 5 proven. 188 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 01:16:23,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:23,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:23,331 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:16:23,338 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:16:23,340 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:16:23,343 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:16:23,347 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:16:23,350 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:16:23,353 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:23,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:23,632 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 13 treesize of output 12 [2018-01-30 01:16:23,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:23,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:23,771 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 20 treesize of output 25 [2018-01-30 01:16:23,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:23,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 01:16:23,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:23,841 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 20 treesize of output 25 [2018-01-30 01:16:23,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:23,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:23,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 01:16:24,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:24,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:24,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:24,069 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 18 treesize of output 23 [2018-01-30 01:16:24,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 01:16:24,211 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:16:24,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 01:16:24,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:14 [2018-01-30 01:16:24,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:16:24,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:16:24,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:24,397 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 20 treesize of output 27 [2018-01-30 01:16:24,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 01:16:24,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:24,473 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 20 treesize of output 27 [2018-01-30 01:16:24,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-01-30 01:16:24,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:24,586 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 20 treesize of output 27 [2018-01-30 01:16:24,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:17 [2018-01-30 01:16:24,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2018-01-30 01:16:24,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 01:16:24,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 01:16:24,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-01-30 01:16:24,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:16:24,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:32 [2018-01-30 01:16:24,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:16:24,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 01:16:24,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:16:24,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 01:16:24,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:16:24,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:24,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-30 01:16:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:16:25,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:25,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 43] total 87 [2018-01-30 01:16:25,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-30 01:16:25,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-30 01:16:25,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=6780, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 01:16:25,124 INFO L87 Difference]: Start difference. First operand 250 states and 255 transitions. Second operand 87 states. [2018-01-30 01:16:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:28,441 INFO L93 Difference]: Finished difference Result 307 states and 316 transitions. [2018-01-30 01:16:28,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-01-30 01:16:28,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 153 [2018-01-30 01:16:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:28,444 INFO L225 Difference]: With dead ends: 307 [2018-01-30 01:16:28,444 INFO L226 Difference]: Without dead ends: 295 [2018-01-30 01:16:28,445 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 116 SyntacticMatches, 13 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7851 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2374, Invalid=20882, Unknown=0, NotChecked=0, Total=23256 [2018-01-30 01:16:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-30 01:16:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-01-30 01:16:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-30 01:16:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 265 transitions. [2018-01-30 01:16:28,468 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 265 transitions. Word has length 153 [2018-01-30 01:16:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:28,468 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 265 transitions. [2018-01-30 01:16:28,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-01-30 01:16:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 265 transitions. [2018-01-30 01:16:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-01-30 01:16:28,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:28,475 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:28,475 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -471199923, now seen corresponding path program 13 times [2018-01-30 01:16:28,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:28,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:28,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:28,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:28,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:28,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:29,055 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 01:16:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 12 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:16:30,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:30,481 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:30,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:16:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:30,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:30,509 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 13 treesize of output 12 [2018-01-30 01:16:30,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:30,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,569 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 27 treesize of output 32 [2018-01-30 01:16:30,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:16:30,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 01:16:30,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 01:16:30,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 96 [2018-01-30 01:16:30,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,812 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:16:30,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-01-30 01:16:30,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:30,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:30,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:30,963 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 60 treesize of output 123 [2018-01-30 01:16:30,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:30,982 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 1 xjuncts. [2018-01-30 01:16:30,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:63 [2018-01-30 01:16:31,129 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:16:31,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-30 01:16:31,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:17 [2018-01-30 01:16:31,194 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 13 treesize of output 12 [2018-01-30 01:16:31,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:31,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,304 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 19 treesize of output 22 [2018-01-30 01:16:31,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-01-30 01:16:31,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,374 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 19 treesize of output 22 [2018-01-30 01:16:31,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-01-30 01:16:31,446 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 19 treesize of output 18 [2018-01-30 01:16:31,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-01-30 01:16:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,464 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 21 treesize of output 26 [2018-01-30 01:16:31,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-01-30 01:16:31,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:16:31,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-30 01:16:31,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 01:16:31,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,548 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 22 treesize of output 27 [2018-01-30 01:16:31,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:31,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 01:16:31,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,630 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 23 treesize of output 28 [2018-01-30 01:16:31,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:31,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-30 01:16:31,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:31,716 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 23 treesize of output 28 [2018-01-30 01:16:31,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:31,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,726 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 1 xjuncts. [2018-01-30 01:16:31,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-01-30 01:16:31,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-30 01:16:31,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:31,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:1 [2018-01-30 01:16:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 2 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:16:31,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:31,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 39] total 79 [2018-01-30 01:16:31,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-01-30 01:16:31,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-01-30 01:16:31,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5761, Unknown=0, NotChecked=0, Total=6162 [2018-01-30 01:16:31,959 INFO L87 Difference]: Start difference. First operand 260 states and 265 transitions. Second operand 79 states. [2018-01-30 01:16:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:36,518 INFO L93 Difference]: Finished difference Result 368 states and 382 transitions. [2018-01-30 01:16:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-01-30 01:16:36,519 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-01-30 01:16:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:36,520 INFO L225 Difference]: With dead ends: 368 [2018-01-30 01:16:36,520 INFO L226 Difference]: Without dead ends: 356 [2018-01-30 01:16:36,521 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 124 SyntacticMatches, 20 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9072 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1952, Invalid=23170, Unknown=0, NotChecked=0, Total=25122 [2018-01-30 01:16:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-01-30 01:16:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 325. [2018-01-30 01:16:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-30 01:16:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 333 transitions. [2018-01-30 01:16:36,537 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 333 transitions. Word has length 156 [2018-01-30 01:16:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:36,537 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 333 transitions. [2018-01-30 01:16:36,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-01-30 01:16:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 333 transitions. [2018-01-30 01:16:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-30 01:16:36,538 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:36,538 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:36,538 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 202411114, now seen corresponding path program 14 times [2018-01-30 01:16:36,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:36,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:36,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:36,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:16:36,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:36,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-01-30 01:16:36,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:36,799 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:36,808 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:16:36,814 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:36,822 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:16:36,824 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:36,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 56 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-30 01:16:37,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:37,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-01-30 01:16:37,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:16:37,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:16:37,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:16:37,063 INFO L87 Difference]: Start difference. First operand 325 states and 333 transitions. Second operand 34 states. [2018-01-30 01:16:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:37,553 INFO L93 Difference]: Finished difference Result 365 states and 374 transitions. [2018-01-30 01:16:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-30 01:16:37,554 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 163 [2018-01-30 01:16:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:37,555 INFO L225 Difference]: With dead ends: 365 [2018-01-30 01:16:37,555 INFO L226 Difference]: Without dead ends: 240 [2018-01-30 01:16:37,556 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=747, Invalid=4953, Unknown=0, NotChecked=0, Total=5700 [2018-01-30 01:16:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-30 01:16:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2018-01-30 01:16:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-30 01:16:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 231 transitions. [2018-01-30 01:16:37,568 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 231 transitions. Word has length 163 [2018-01-30 01:16:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:37,569 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 231 transitions. [2018-01-30 01:16:37,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:16:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 231 transitions. [2018-01-30 01:16:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 01:16:37,569 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:37,569 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:37,569 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1515078666, now seen corresponding path program 15 times [2018-01-30 01:16:37,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:37,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:37,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:37,570 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:37,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:37,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 134 proven. 80 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 01:16:38,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:38,458 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:38,463 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:16:38,470 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,480 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,483 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,486 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,490 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,494 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,498 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:16:38,499 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:38,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 90 proven. 132 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-01-30 01:16:38,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:38,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-30 01:16:38,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 01:16:38,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 01:16:38,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2031, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 01:16:38,802 INFO L87 Difference]: Start difference. First operand 224 states and 231 transitions. Second operand 48 states. [2018-01-30 01:16:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:16:39,779 INFO L93 Difference]: Finished difference Result 453 states and 468 transitions. [2018-01-30 01:16:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-30 01:16:39,779 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 164 [2018-01-30 01:16:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:16:39,780 INFO L225 Difference]: With dead ends: 453 [2018-01-30 01:16:39,780 INFO L226 Difference]: Without dead ends: 382 [2018-01-30 01:16:39,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1216, Invalid=10126, Unknown=0, NotChecked=0, Total=11342 [2018-01-30 01:16:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-01-30 01:16:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 279. [2018-01-30 01:16:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 01:16:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 286 transitions. [2018-01-30 01:16:39,807 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 286 transitions. Word has length 164 [2018-01-30 01:16:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:16:39,807 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 286 transitions. [2018-01-30 01:16:39,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 01:16:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 286 transitions. [2018-01-30 01:16:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-30 01:16:39,808 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:16:39,808 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:16:39,808 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:16:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1111423605, now seen corresponding path program 16 times [2018-01-30 01:16:39,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:16:39,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:16:39,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:39,819 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:16:39,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:16:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:16:39,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:16:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 16 proven. 263 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:16:42,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:16:42,107 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:16:42,112 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:16:42,129 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:16:42,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:16:42,196 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 13 treesize of output 12 [2018-01-30 01:16:42,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:16:42,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,293 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 27 treesize of output 32 [2018-01-30 01:16:42,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:16:42,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-01-30 01:16:42,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,419 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:16:42,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-01-30 01:16:42,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:42,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:42,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 81 [2018-01-30 01:16:42,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,619 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 1 xjuncts. [2018-01-30 01:16:42,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-01-30 01:16:42,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:42,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:42,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 81 [2018-01-30 01:16:42,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,789 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 1 xjuncts. [2018-01-30 01:16:42,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-01-30 01:16:42,935 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 01:16:42,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:42,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-30 01:16:42,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:14 [2018-01-30 01:16:42,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 01:16:42,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:42,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:16:43,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:43,085 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 16 treesize of output 19 [2018-01-30 01:16:43,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:43,161 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 16 treesize of output 15 [2018-01-30 01:16:43,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-01-30 01:16:43,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:43,230 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 16 treesize of output 19 [2018-01-30 01:16:43,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:43,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:43,306 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 16 treesize of output 19 [2018-01-30 01:16:43,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-01-30 01:16:43,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-30 01:16:43,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,381 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 13 treesize of output 12 [2018-01-30 01:16:43,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2018-01-30 01:16:43,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 01:16:43,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:16:43,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:43,458 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 20 treesize of output 25 [2018-01-30 01:16:43,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-01-30 01:16:43,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:16:43,556 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 23 treesize of output 28 [2018-01-30 01:16:43,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 01:16:43,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,565 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 1 xjuncts. [2018-01-30 01:16:43,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-01-30 01:16:43,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:16:43,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 01:16:43,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 01:16:43,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:16:43,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-30 01:16:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 4 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:16:43,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:16:43,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 40] total 86 [2018-01-30 01:16:43,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-01-30 01:16:43,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-01-30 01:16:43,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=6805, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 01:16:43,920 INFO L87 Difference]: Start difference. First operand 279 states and 286 transitions. Second operand 86 states. Received shutdown request... [2018-01-30 01:16:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 01:16:46,349 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:16:46,351 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:16:46,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:16:46 BoogieIcfgContainer [2018-01-30 01:16:46,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:16:46,352 INFO L168 Benchmark]: Toolchain (without parser) took 71165.48 ms. Allocated memory was 148.9 MB in the beginning and 699.4 MB in the end (delta: 550.5 MB). Free memory was 114.0 MB in the beginning and 427.3 MB in the end (delta: -313.4 MB). Peak memory consumption was 237.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:16:46,353 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:16:46,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.18 ms. Allocated memory is still 148.9 MB. Free memory was 113.7 MB in the beginning and 105.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:16:46,353 INFO L168 Benchmark]: Boogie Preprocessor took 18.78 ms. Allocated memory is still 148.9 MB. Free memory was 105.4 MB in the beginning and 103.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:16:46,353 INFO L168 Benchmark]: RCFGBuilder took 309.02 ms. Allocated memory is still 148.9 MB. Free memory was 103.8 MB in the beginning and 88.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:16:46,353 INFO L168 Benchmark]: TraceAbstraction took 70703.20 ms. Allocated memory was 148.9 MB in the beginning and 699.4 MB in the end (delta: 550.5 MB). Free memory was 88.5 MB in the beginning and 427.3 MB in the end (delta: -338.8 MB). Peak memory consumption was 211.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:16:46,354 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 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 132.18 ms. Allocated memory is still 148.9 MB. Free memory was 113.7 MB in the beginning and 105.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.78 ms. Allocated memory is still 148.9 MB. Free memory was 105.4 MB in the beginning and 103.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 309.02 ms. Allocated memory is still 148.9 MB. Free memory was 103.8 MB in the beginning and 88.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70703.20 ms. Allocated memory was 148.9 MB in the beginning and 699.4 MB in the end (delta: 550.5 MB). Free memory was 88.5 MB in the beginning and 427.3 MB in the end (delta: -338.8 MB). Peak memory consumption was 211.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 43 states, 86 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 121 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 1 error locations. TIMEOUT Result, 70.6s OverallTime, 26 OverallIterations, 7 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1316 SDtfs, 7613 SDslu, 20275 SDs, 0 SdLazy, 36623 SolverSat, 3357 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4370 GetRequests, 2486 SyntacticMatches, 119 SemanticMatches, 1764 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58325 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=23, 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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 761 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 5699 NumberOfCodeBlocks, 5680 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 5649 ConstructedInterpolants, 131 QuantifiedInterpolants, 6255104 SizeOfPredicates, 505 NumberOfNonLiveVariables, 4106 ConjunctsInSsa, 789 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 2826/6582 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/revcpyswp2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-16-46-358.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/revcpyswp2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-16-46-358.csv Completed graceful shutdown