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-examples/standard_copy9_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-29 23:30:39,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:30:39,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:30:40,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:30:40,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:30:40,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:30:40,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:30:40,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:30:40,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:30:40,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:30:40,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:30:40,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:30:40,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:30:40,013 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:30:40,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:30:40,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:30:40,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:30:40,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:30:40,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:30:40,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:30:40,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:30:40,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:30:40,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:30:40,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:30:40,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:30:40,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:30:40,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:30:40,021 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:30:40,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:30:40,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:30:40,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:30:40,022 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-29 23:30:40,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:30:40,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:30:40,028 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:30:40,028 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:30:40,028 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:30:40,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:30:40,028 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:30:40,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-29 23:30:40,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-29 23:30:40,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:30:40,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:30:40,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:30:40,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:30:40,032 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:30:40,032 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:30:40,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:30:40,058 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:30:40,060 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:30:40,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:30:40,061 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:30:40,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i [2018-01-29 23:30:40,137 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:30:40,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:30:40,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:30:40,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:30:40,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:30:40,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395107c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40, skipping insertion in model container [2018-01-29 23:30:40,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,154 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:30:40,164 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:30:40,235 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:30:40,246 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:30:40,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40 WrapperNode [2018-01-29 23:30:40,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:30:40,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:30:40,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:30:40,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:30:40,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... [2018-01-29 23:30:40,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:30:40,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:30:40,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:30:40,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:30:40,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:30:40,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:30:40,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:30:40,312 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-29 23:30:40,312 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:30:40,312 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:30:40,312 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-29 23:30:40,312 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:30:40,313 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:30:40,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:30:40,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:30:40,710 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:30:40,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:30:40 BoogieIcfgContainer [2018-01-29 23:30:40,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:30:40,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:30:40,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:30:40,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:30:40,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:30:40" (1/3) ... [2018-01-29 23:30:40,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df19d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:30:40, skipping insertion in model container [2018-01-29 23:30:40,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:40" (2/3) ... [2018-01-29 23:30:40,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df19d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:30:40, skipping insertion in model container [2018-01-29 23:30:40,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:30:40" (3/3) ... [2018-01-29 23:30:40,714 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_copy9_true-unreach-call_ground.i [2018-01-29 23:30:40,719 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:30:40,724 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-29 23:30:40,748 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:30:40,749 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:30:40,749 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:30:40,749 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:30:40,749 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:30:40,749 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:30:40,749 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:30:40,749 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:30:40,750 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:30:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-01-29 23:30:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:30:40,764 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:40,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:40,765 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1650771187, now seen corresponding path program 1 times [2018-01-29 23:30:40,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:40,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:40,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:40,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:40,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:40,840 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-29 23:30:40,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:40,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:30:40,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:30:40,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:30:40,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:30:40,862 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-01-29 23:30:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:40,880 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2018-01-29 23:30:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:30:40,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-29 23:30:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:40,887 INFO L225 Difference]: With dead ends: 190 [2018-01-29 23:30:40,887 INFO L226 Difference]: Without dead ends: 102 [2018-01-29 23:30:40,889 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-29 23:30:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-29 23:30:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-01-29 23:30:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 23:30:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-01-29 23:30:40,914 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 44 [2018-01-29 23:30:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:40,914 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-01-29 23:30:40,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:30:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-01-29 23:30:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:30:40,916 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:40,916 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, 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-29 23:30:40,916 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1758502998, now seen corresponding path program 1 times [2018-01-29 23:30:40,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:40,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:40,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:40,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:40,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:40,985 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-29 23:30:40,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:40,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:40,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:30:40,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:30:40,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:40,987 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 3 states. [2018-01-29 23:30:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:41,133 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2018-01-29 23:30:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:30:41,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-29 23:30:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:41,134 INFO L225 Difference]: With dead ends: 187 [2018-01-29 23:30:41,134 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 23:30:41,135 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 23:30:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-01-29 23:30:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 23:30:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-01-29 23:30:41,141 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 54 [2018-01-29 23:30:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:41,141 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-01-29 23:30:41,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:30:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-01-29 23:30:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 23:30:41,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:41,142 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:41,142 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash -857871661, now seen corresponding path program 1 times [2018-01-29 23:30:41,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:41,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:41,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:41,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:41,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:30:41,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:41,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:41,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:30:41,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:30:41,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:41,208 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 3 states. [2018-01-29 23:30:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:41,506 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2018-01-29 23:30:41,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:30:41,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-01-29 23:30:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:41,508 INFO L225 Difference]: With dead ends: 219 [2018-01-29 23:30:41,508 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 23:30:41,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 23:30:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-01-29 23:30:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 23:30:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-29 23:30:41,515 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 62 [2018-01-29 23:30:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:41,515 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-29 23:30:41,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:30:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-29 23:30:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-29 23:30:41,517 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:41,517 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:41,517 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1479936133, now seen corresponding path program 1 times [2018-01-29 23:30:41,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:41,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:41,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:41,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:41,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 23:30:41,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:41,588 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-29 23:30:41,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:41,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 23:30:41,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:41,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:30:41,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:41,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:41,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:41,674 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 5 states. [2018-01-29 23:30:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:41,765 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-01-29 23:30:41,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:41,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-01-29 23:30:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:41,766 INFO L225 Difference]: With dead ends: 231 [2018-01-29 23:30:41,767 INFO L226 Difference]: Without dead ends: 135 [2018-01-29 23:30:41,767 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-29 23:30:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-01-29 23:30:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-29 23:30:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-01-29 23:30:41,772 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 116 [2018-01-29 23:30:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:41,772 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-01-29 23:30:41,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-01-29 23:30:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-29 23:30:41,773 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:41,773 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:41,773 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -272404252, now seen corresponding path program 2 times [2018-01-29 23:30:41,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:41,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:41,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:41,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:41,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-29 23:30:41,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:41,842 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:41,847 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:30:41,857 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:41,873 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:41,881 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:41,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 23:30:41,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:41,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-29 23:30:41,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:30:41,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:30:41,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:41,993 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 10 states. [2018-01-29 23:30:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:42,612 INFO L93 Difference]: Finished difference Result 272 states and 295 transitions. [2018-01-29 23:30:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:30:42,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-01-29 23:30:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:42,613 INFO L225 Difference]: With dead ends: 272 [2018-01-29 23:30:42,613 INFO L226 Difference]: Without dead ends: 176 [2018-01-29 23:30:42,614 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:30:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-29 23:30:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2018-01-29 23:30:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-29 23:30:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-01-29 23:30:42,622 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 124 [2018-01-29 23:30:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:42,622 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-01-29 23:30:42,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:30:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-01-29 23:30:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-29 23:30:42,624 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:42,624 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:42,624 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1773490805, now seen corresponding path program 3 times [2018-01-29 23:30:42,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:42,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:42,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:42,625 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:42,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:42,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-29 23:30:42,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:42,719 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-29 23:30:42,725 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:30:42,738 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:42,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:42,743 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:42,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-29 23:30:42,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:42,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:30:42,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:42,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:42,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:42,785 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-01-29 23:30:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:42,875 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2018-01-29 23:30:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:42,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-01-29 23:30:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:42,876 INFO L225 Difference]: With dead ends: 251 [2018-01-29 23:30:42,876 INFO L226 Difference]: Without dead ends: 174 [2018-01-29 23:30:42,876 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-29 23:30:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2018-01-29 23:30:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:30:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-01-29 23:30:42,882 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 138 [2018-01-29 23:30:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:42,882 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-01-29 23:30:42,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-01-29 23:30:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-29 23:30:42,883 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:42,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:42,883 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -811898291, now seen corresponding path program 4 times [2018-01-29 23:30:42,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:42,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:42,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:42,884 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:42,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:42,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-29 23:30:42,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:42,963 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-29 23:30:42,967 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:30:42,989 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:42,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:43,116 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-29 23:30:43,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:30:43,222 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-29 23:30:43,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-29 23:30:43,347 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-29 23:30:43,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-29 23:30:43,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:30:43,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,391 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 2 case distinctions, treesize of input 29 treesize of output 20 [2018-01-29 23:30:43,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:30:43,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:30:43,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-01-29 23:30:43,459 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-29 23:30:43,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,462 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 15 treesize of output 7 [2018-01-29 23:30:43,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,563 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-29 23:30:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,568 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 15 treesize of output 7 [2018-01-29 23:30:43,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,664 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-29 23:30:43,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,667 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 15 treesize of output 7 [2018-01-29 23:30:43,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,724 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-29 23:30:43,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,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 15 treesize of output 7 [2018-01-29 23:30:43,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,768 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 8 [2018-01-29 23:30:43,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,770 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-29 23:30:43,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,798 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 8 [2018-01-29 23:30:43,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,799 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-29 23:30:43,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,908 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-29 23:30:43,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,911 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 15 treesize of output 7 [2018-01-29 23:30:43,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:43,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:30:44,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:44,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 27] total 30 [2018-01-29 23:30:44,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:30:44,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:30:44,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:30:44,004 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 30 states. [2018-01-29 23:30:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:44,859 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-01-29 23:30:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:30:44,859 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 144 [2018-01-29 23:30:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:44,861 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:30:44,861 INFO L226 Difference]: Without dead ends: 189 [2018-01-29 23:30:44,864 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=2288, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:30:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-29 23:30:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 163. [2018-01-29 23:30:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-29 23:30:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2018-01-29 23:30:44,868 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 144 [2018-01-29 23:30:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:44,869 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2018-01-29 23:30:44,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:30:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2018-01-29 23:30:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-29 23:30:44,870 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:44,870 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:44,871 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:44,871 INFO L82 PathProgramCache]: Analyzing trace with hash -193721738, now seen corresponding path program 1 times [2018-01-29 23:30:44,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:44,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:44,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:44,871 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:44,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:44,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-01-29 23:30:44,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:44,988 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-29 23:30:44,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:45,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-29 23:30:45,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:45,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-01-29 23:30:45,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:30:45,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:30:45,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:30:45,076 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand 12 states. [2018-01-29 23:30:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:45,464 INFO L93 Difference]: Finished difference Result 321 states and 344 transitions. [2018-01-29 23:30:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:30:45,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2018-01-29 23:30:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:45,467 INFO L225 Difference]: With dead ends: 321 [2018-01-29 23:30:45,467 INFO L226 Difference]: Without dead ends: 200 [2018-01-29 23:30:45,467 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:30:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-29 23:30:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 177. [2018-01-29 23:30:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-29 23:30:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2018-01-29 23:30:45,472 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 160 [2018-01-29 23:30:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:45,472 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2018-01-29 23:30:45,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:30:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2018-01-29 23:30:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-29 23:30:45,473 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:45,473 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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-29 23:30:45,473 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1243916151, now seen corresponding path program 2 times [2018-01-29 23:30:45,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:45,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:45,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:45,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:45,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:45,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-01-29 23:30:45,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:45,539 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-29 23:30:45,543 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:30:45,550 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:45,558 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:45,560 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:45,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-01-29 23:30:45,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:45,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2018-01-29 23:30:45,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:30:45,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:30:45,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:30:45,770 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 14 states. [2018-01-29 23:30:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:46,020 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2018-01-29 23:30:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:30:46,021 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 174 [2018-01-29 23:30:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:46,021 INFO L225 Difference]: With dead ends: 338 [2018-01-29 23:30:46,021 INFO L226 Difference]: Without dead ends: 211 [2018-01-29 23:30:46,022 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:30:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-29 23:30:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-01-29 23:30:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-29 23:30:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2018-01-29 23:30:46,026 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 174 [2018-01-29 23:30:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:46,029 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2018-01-29 23:30:46,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:30:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2018-01-29 23:30:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-01-29 23:30:46,031 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:46,031 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-29 23:30:46,031 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1843619512, now seen corresponding path program 3 times [2018-01-29 23:30:46,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:46,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:46,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,031 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:46,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-01-29 23:30:46,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:46,170 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-29 23:30:46,175 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:30:46,191 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:46,203 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:46,204 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:46,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-01-29 23:30:46,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:46,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:30:46,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:46,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:46,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:46,235 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 5 states. [2018-01-29 23:30:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:46,379 INFO L93 Difference]: Finished difference Result 257 states and 273 transitions. [2018-01-29 23:30:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:46,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2018-01-29 23:30:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:46,390 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:30:46,390 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 23:30:46,390 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 23:30:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2018-01-29 23:30:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-29 23:30:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2018-01-29 23:30:46,395 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 188 [2018-01-29 23:30:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:46,396 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2018-01-29 23:30:46,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2018-01-29 23:30:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-01-29 23:30:46,397 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:46,397 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:46,397 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -509433440, now seen corresponding path program 4 times [2018-01-29 23:30:46,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:46,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:46,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,398 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:46,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-01-29 23:30:46,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:46,471 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-29 23:30:46,475 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:30:46,505 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:46,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-01-29 23:30:46,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:46,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2018-01-29 23:30:46,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:30:46,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:30:46,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:30:46,704 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand 16 states. [2018-01-29 23:30:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:46,969 INFO L93 Difference]: Finished difference Result 364 states and 387 transitions. [2018-01-29 23:30:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:30:46,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2018-01-29 23:30:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:46,975 INFO L225 Difference]: With dead ends: 364 [2018-01-29 23:30:46,975 INFO L226 Difference]: Without dead ends: 225 [2018-01-29 23:30:46,976 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:30:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-29 23:30:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2018-01-29 23:30:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:30:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 222 transitions. [2018-01-29 23:30:46,980 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 222 transitions. Word has length 194 [2018-01-29 23:30:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:46,980 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 222 transitions. [2018-01-29 23:30:46,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:30:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 222 transitions. [2018-01-29 23:30:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-29 23:30:46,980 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:46,981 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 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-29 23:30:46,981 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash 453002289, now seen corresponding path program 5 times [2018-01-29 23:30:46,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:46,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:46,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,981 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:46,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-01-29 23:30:47,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:47,073 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-29 23:30:47,078 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:30:47,085 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,086 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,087 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,088 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,092 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,097 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,105 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:47,106 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:47,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-01-29 23:30:47,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:47,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-29 23:30:47,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:30:47,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:30:47,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:47,183 INFO L87 Difference]: Start difference. First operand 211 states and 222 transitions. Second operand 8 states. [2018-01-29 23:30:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:47,341 INFO L93 Difference]: Finished difference Result 316 states and 335 transitions. [2018-01-29 23:30:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:30:47,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 208 [2018-01-29 23:30:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:47,342 INFO L225 Difference]: With dead ends: 316 [2018-01-29 23:30:47,342 INFO L226 Difference]: Without dead ends: 232 [2018-01-29 23:30:47,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:30:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-29 23:30:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2018-01-29 23:30:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-29 23:30:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2018-01-29 23:30:47,350 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 208 [2018-01-29 23:30:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:47,350 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2018-01-29 23:30:47,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:30:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2018-01-29 23:30:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-29 23:30:47,351 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:47,351 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:47,351 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 73868641, now seen corresponding path program 6 times [2018-01-29 23:30:47,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:47,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:47,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,352 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:47,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:47,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-29 23:30:47,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:47,598 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-29 23:30:47,603 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:30:47,611 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:47,623 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:47,637 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:47,646 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:47,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-29 23:30:47,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:47,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:30:47,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:47,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:47,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:47,687 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand 5 states. [2018-01-29 23:30:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:47,803 INFO L93 Difference]: Finished difference Result 253 states and 266 transitions. [2018-01-29 23:30:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:47,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2018-01-29 23:30:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:47,805 INFO L225 Difference]: With dead ends: 253 [2018-01-29 23:30:47,805 INFO L226 Difference]: Without dead ends: 232 [2018-01-29 23:30:47,805 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-29 23:30:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-01-29 23:30:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-29 23:30:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 240 transitions. [2018-01-29 23:30:47,809 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 240 transitions. Word has length 220 [2018-01-29 23:30:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:47,809 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 240 transitions. [2018-01-29 23:30:47,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 240 transitions. [2018-01-29 23:30:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-01-29 23:30:47,810 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:47,810 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 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, 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, 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] [2018-01-29 23:30:47,810 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -998555063, now seen corresponding path program 7 times [2018-01-29 23:30:47,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:47,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:47,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,811 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:47,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:47,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-29 23:30:47,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:47,902 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-29 23:30:47,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:47,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-01-29 23:30:48,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:48,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 20 [2018-01-29 23:30:48,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:30:48,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:30:48,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:30:48,046 INFO L87 Difference]: Start difference. First operand 229 states and 240 transitions. Second operand 20 states. [2018-01-29 23:30:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:49,039 INFO L93 Difference]: Finished difference Result 414 states and 437 transitions. [2018-01-29 23:30:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:30:49,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 226 [2018-01-29 23:30:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:49,040 INFO L225 Difference]: With dead ends: 414 [2018-01-29 23:30:49,040 INFO L226 Difference]: Without dead ends: 251 [2018-01-29 23:30:49,041 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:30:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-29 23:30:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2018-01-29 23:30:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-29 23:30:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 254 transitions. [2018-01-29 23:30:49,045 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 254 transitions. Word has length 226 [2018-01-29 23:30:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:49,045 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 254 transitions. [2018-01-29 23:30:49,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:30:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 254 transitions. [2018-01-29 23:30:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-29 23:30:49,046 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:49,046 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 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, 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, 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] [2018-01-29 23:30:49,046 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1254313674, now seen corresponding path program 8 times [2018-01-29 23:30:49,047 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:49,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:49,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:49,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:49,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-29 23:30:49,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:49,401 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-29 23:30:49,405 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:30:49,413 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:49,426 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:49,429 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:49,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-29 23:30:49,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:49,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 22 [2018-01-29 23:30:49,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:30:49,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:30:49,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:30:49,609 INFO L87 Difference]: Start difference. First operand 243 states and 254 transitions. Second operand 22 states. [2018-01-29 23:30:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:49,925 INFO L93 Difference]: Finished difference Result 434 states and 457 transitions. [2018-01-29 23:30:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:30:49,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 240 [2018-01-29 23:30:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:49,926 INFO L225 Difference]: With dead ends: 434 [2018-01-29 23:30:49,926 INFO L226 Difference]: Without dead ends: 265 [2018-01-29 23:30:49,926 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:30:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-29 23:30:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2018-01-29 23:30:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-01-29 23:30:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 268 transitions. [2018-01-29 23:30:49,934 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 268 transitions. Word has length 240 [2018-01-29 23:30:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:49,934 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 268 transitions. [2018-01-29 23:30:49,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:30:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 268 transitions. [2018-01-29 23:30:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-29 23:30:49,935 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:49,935 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 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, 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, 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] [2018-01-29 23:30:49,935 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2119685093, now seen corresponding path program 9 times [2018-01-29 23:30:49,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:49,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:49,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:49,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:49,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-01-29 23:30:50,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:50,320 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-29 23:30:50,325 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:30:50,338 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:50,343 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:50,348 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:30:50,349 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:50,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-01-29 23:30:50,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:50,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-29 23:30:50,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:30:50,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:30:50,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:30:50,392 INFO L87 Difference]: Start difference. First operand 257 states and 268 transitions. Second operand 9 states. [2018-01-29 23:30:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:50,514 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-01-29 23:30:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:30:50,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2018-01-29 23:30:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:50,515 INFO L225 Difference]: With dead ends: 368 [2018-01-29 23:30:50,515 INFO L226 Difference]: Without dead ends: 275 [2018-01-29 23:30:50,516 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:30:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-29 23:30:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2018-01-29 23:30:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-29 23:30:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 280 transitions. [2018-01-29 23:30:50,531 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 280 transitions. Word has length 254 [2018-01-29 23:30:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:50,531 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 280 transitions. [2018-01-29 23:30:50,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:30:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 280 transitions. [2018-01-29 23:30:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-29 23:30:50,532 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:50,532 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:50,532 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash -668067429, now seen corresponding path program 10 times [2018-01-29 23:30:50,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:50,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:50,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,533 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:50,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:50,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-01-29 23:30:50,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:50,760 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-29 23:30:50,765 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:30:50,788 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:50,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:50,822 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-29 23:30:50,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-29 23:30:50,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, 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-29 23:30:50,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,856 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 15 treesize of output 7 [2018-01-29 23:30:50,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:50,893 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-29 23:30:50,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,902 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 15 treesize of output 7 [2018-01-29 23:30:50,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:50,941 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-29 23:30:50,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:30:50,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:50,983 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-29 23:30:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:50,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:30:50,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:50,992 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-29 23:30:50,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:30:51,047 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-29 23:30:51,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:30:51,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:51,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-29 23:30:51,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:51,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:30:51,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,148 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-29 23:30:51,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:30:51,208 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-29 23:30:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:30:51,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:51,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:30:51,263 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-29 23:30:51,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:51,275 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 14 treesize of output 17 [2018-01-29 23:30:51,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,282 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-29 23:30:51,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:30:51,343 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 8 [2018-01-29 23:30:51,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,345 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-29 23:30:51,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:30:51,411 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-29 23:30:51,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:30:51,480 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-29 23:30:51,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-29 23:30:51,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:30:51,571 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-29 23:30:51,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:30:51,651 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-29 23:30:51,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-29 23:30:51,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:51,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:30:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 2 proven. 163 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-01-29 23:30:51,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:51,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 58] total 63 [2018-01-29 23:30:51,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-29 23:30:51,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-29 23:30:51,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3633, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 23:30:51,887 INFO L87 Difference]: Start difference. First operand 269 states and 280 transitions. Second operand 63 states. [2018-01-29 23:30:52,918 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-29 23:30:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:54,960 INFO L93 Difference]: Finished difference Result 461 states and 483 transitions. [2018-01-29 23:30:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-29 23:30:54,961 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 266 [2018-01-29 23:30:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:54,962 INFO L225 Difference]: With dead ends: 461 [2018-01-29 23:30:54,962 INFO L226 Difference]: Without dead ends: 305 [2018-01-29 23:30:54,964 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1610, Invalid=14392, Unknown=0, NotChecked=0, Total=16002 [2018-01-29 23:30:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-29 23:30:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2018-01-29 23:30:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-29 23:30:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 296 transitions. [2018-01-29 23:30:54,975 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 296 transitions. Word has length 266 [2018-01-29 23:30:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:54,975 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 296 transitions. [2018-01-29 23:30:54,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-29 23:30:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 296 transitions. [2018-01-29 23:30:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-01-29 23:30:54,976 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:54,976 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 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, 3, 3, 3, 3, 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, 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] [2018-01-29 23:30:54,976 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1991838516, now seen corresponding path program 11 times [2018-01-29 23:30:54,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:54,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:54,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:54,977 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:54,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:54,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-29 23:30:55,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:55,079 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-29 23:30:55,083 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:30:55,089 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,090 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,091 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,092 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,093 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,096 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,101 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,108 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,119 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:55,120 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:55,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-01-29 23:30:55,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:55,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-01-29 23:30:55,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:30:55,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:30:55,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:30:55,183 INFO L87 Difference]: Start difference. First operand 285 states and 296 transitions. Second operand 11 states. [2018-01-29 23:30:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:55,413 INFO L93 Difference]: Finished difference Result 454 states and 474 transitions. [2018-01-29 23:30:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:30:55,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-01-29 23:30:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:55,415 INFO L225 Difference]: With dead ends: 454 [2018-01-29 23:30:55,415 INFO L226 Difference]: Without dead ends: 303 [2018-01-29 23:30:55,415 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:30:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-29 23:30:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2018-01-29 23:30:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-29 23:30:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 308 transitions. [2018-01-29 23:30:55,420 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 308 transitions. Word has length 282 [2018-01-29 23:30:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:55,421 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 308 transitions. [2018-01-29 23:30:55,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:30:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 308 transitions. [2018-01-29 23:30:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-01-29 23:30:55,422 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:55,422 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:55,422 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1306773172, now seen corresponding path program 12 times [2018-01-29 23:30:55,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:55,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:55,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:55,423 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:55,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:55,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-01-29 23:30:56,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:56,030 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-29 23:30:56,034 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:30:56,043 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:56,053 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:56,063 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:56,066 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:56,071 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:30:56,072 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:56,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-01-29 23:30:56,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:56,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-01-29 23:30:56,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:30:56,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:30:56,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:30:56,126 INFO L87 Difference]: Start difference. First operand 297 states and 308 transitions. Second operand 11 states. [2018-01-29 23:30:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:56,276 INFO L93 Difference]: Finished difference Result 451 states and 470 transitions. [2018-01-29 23:30:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:30:56,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2018-01-29 23:30:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:56,277 INFO L225 Difference]: With dead ends: 451 [2018-01-29 23:30:56,277 INFO L226 Difference]: Without dead ends: 315 [2018-01-29 23:30:56,277 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:30:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-29 23:30:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2018-01-29 23:30:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-29 23:30:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 320 transitions. [2018-01-29 23:30:56,282 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 320 transitions. Word has length 294 [2018-01-29 23:30:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:56,282 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 320 transitions. [2018-01-29 23:30:56,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:30:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 320 transitions. [2018-01-29 23:30:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-29 23:30:56,283 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:56,283 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:56,283 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1032481740, now seen corresponding path program 13 times [2018-01-29 23:30:56,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:56,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:56,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:56,284 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:30:56,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:56,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-01-29 23:30:56,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:56,969 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-29 23:30:56,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:57,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-29 23:30:58,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:58,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 26 [2018-01-29 23:30:58,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:30:58,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:30:58,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:30:58,341 INFO L87 Difference]: Start difference. First operand 309 states and 320 transitions. Second operand 26 states. [2018-01-29 23:30:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:58,677 INFO L93 Difference]: Finished difference Result 558 states and 581 transitions. [2018-01-29 23:30:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:30:58,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 306 [2018-01-29 23:30:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:58,678 INFO L225 Difference]: With dead ends: 558 [2018-01-29 23:30:58,679 INFO L226 Difference]: Without dead ends: 331 [2018-01-29 23:30:58,679 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=480, Invalid=1776, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:30:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-29 23:30:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 323. [2018-01-29 23:30:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-29 23:30:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2018-01-29 23:30:58,684 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 306 [2018-01-29 23:30:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:58,684 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2018-01-29 23:30:58,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:30:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2018-01-29 23:30:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-29 23:30:58,685 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:58,685 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 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, 3, 3, 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, 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] [2018-01-29 23:30:58,685 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:30:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1838583429, now seen corresponding path program 14 times [2018-01-29 23:30:58,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:58,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:58,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:58,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:58,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:58,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-01-29 23:30:59,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:59,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-29 23:30:59,388 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:59,397 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:59,423 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:30:59,433 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:30:59,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-01-29 23:30:59,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:59,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21] total 28 [2018-01-29 23:30:59,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:30:59,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:30:59,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:30:59,727 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand 28 states. [2018-01-29 23:31:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:00,142 INFO L93 Difference]: Finished difference Result 578 states and 601 transitions. [2018-01-29 23:31:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-29 23:31:00,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 320 [2018-01-29 23:31:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:00,143 INFO L225 Difference]: With dead ends: 578 [2018-01-29 23:31:00,143 INFO L226 Difference]: Without dead ends: 345 [2018-01-29 23:31:00,144 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=575, Invalid=2077, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:31:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-29 23:31:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2018-01-29 23:31:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-29 23:31:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 348 transitions. [2018-01-29 23:31:00,152 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 348 transitions. Word has length 320 [2018-01-29 23:31:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:00,152 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 348 transitions. [2018-01-29 23:31:00,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:31:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 348 transitions. [2018-01-29 23:31:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-01-29 23:31:00,153 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:00,153 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 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, 3, 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, 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] [2018-01-29 23:31:00,153 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -107112698, now seen corresponding path program 15 times [2018-01-29 23:31:00,154 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:00,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:00,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:00,154 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:00,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:00,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2018-01-29 23:31:00,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:00,386 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-29 23:31:00,390 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:31:00,399 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:00,413 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:00,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:00,436 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:00,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-01-29 23:31:00,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:00,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2018-01-29 23:31:00,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:31:00,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:31:00,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:31:00,690 INFO L87 Difference]: Start difference. First operand 337 states and 348 transitions. Second operand 13 states. [2018-01-29 23:31:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:00,874 INFO L93 Difference]: Finished difference Result 578 states and 600 transitions. [2018-01-29 23:31:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:31:00,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 334 [2018-01-29 23:31:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:00,876 INFO L225 Difference]: With dead ends: 578 [2018-01-29 23:31:00,876 INFO L226 Difference]: Without dead ends: 355 [2018-01-29 23:31:00,877 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:31:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-29 23:31:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2018-01-29 23:31:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-29 23:31:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 360 transitions. [2018-01-29 23:31:00,882 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 360 transitions. Word has length 334 [2018-01-29 23:31:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:00,882 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 360 transitions. [2018-01-29 23:31:00,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:31:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 360 transitions. [2018-01-29 23:31:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-29 23:31:00,883 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:00,883 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 6, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:00,883 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1372476202, now seen corresponding path program 16 times [2018-01-29 23:31:00,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:00,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:00,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:00,884 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:00,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:00,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-29 23:31:01,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:01,045 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-29 23:31:01,056 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:31:01,091 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:01,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:01,135 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-29 23:31:01,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-29 23:31:01,187 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-29 23:31:01,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,191 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 15 treesize of output 7 [2018-01-29 23:31:01,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:01,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:31:01,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,261 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 15 treesize of output 7 [2018-01-29 23:31:01,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:01,346 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-29 23:31:01,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:01,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:01,415 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-29 23:31:01,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:01,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:01,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,426 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-29 23:31:01,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:01,540 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-29 23:31:01,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,552 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 15 treesize of output 7 [2018-01-29 23:31:01,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:01,660 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-29 23:31:01,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:01,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:01,728 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-29 23:31:01,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:01,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,738 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-29 23:31:01,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:01,872 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 8 [2018-01-29 23:31:01,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,874 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-29 23:31:01,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:01,996 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-29 23:31:01,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:01,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:02,081 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-29 23:31:02,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-29 23:31:02,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:31:02,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:31:02,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:02,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:02,332 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-29 23:31:02,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:31:02,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2018-01-29 23:31:02,433 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-29 23:31:02,437 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 14 treesize of output 13 [2018-01-29 23:31:02,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:02,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-01-29 23:31:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 3 proven. 338 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-01-29 23:31:02,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:02,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 81] total 88 [2018-01-29 23:31:02,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-01-29 23:31:02,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-01-29 23:31:02,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=7263, Unknown=0, NotChecked=0, Total=7656 [2018-01-29 23:31:02,880 INFO L87 Difference]: Start difference. First operand 349 states and 360 transitions. Second operand 88 states. [2018-01-29 23:31:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:07,083 INFO L93 Difference]: Finished difference Result 481 states and 498 transitions. [2018-01-29 23:31:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-01-29 23:31:07,084 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-01-29 23:31:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:07,085 INFO L225 Difference]: With dead ends: 481 [2018-01-29 23:31:07,085 INFO L226 Difference]: Without dead ends: 390 [2018-01-29 23:31:07,090 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11592 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2511, Invalid=31529, Unknown=0, NotChecked=0, Total=34040 [2018-01-29 23:31:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-01-29 23:31:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 365. [2018-01-29 23:31:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-01-29 23:31:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 376 transitions. [2018-01-29 23:31:07,097 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 376 transitions. Word has length 346 [2018-01-29 23:31:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:07,097 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 376 transitions. [2018-01-29 23:31:07,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-01-29 23:31:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 376 transitions. [2018-01-29 23:31:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-01-29 23:31:07,098 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:07,098 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:07,098 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash 814837887, now seen corresponding path program 17 times [2018-01-29 23:31:07,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:07,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:07,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:07,099 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:07,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:07,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-01-29 23:31:07,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:07,262 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-29 23:31:07,268 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:31:07,280 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,281 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,282 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,283 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,284 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,285 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,288 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,293 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,300 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,307 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,320 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:07,321 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:07,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-01-29 23:31:07,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:07,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-29 23:31:07,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:31:07,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:31:07,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:31:07,392 INFO L87 Difference]: Start difference. First operand 365 states and 376 transitions. Second operand 9 states. [2018-01-29 23:31:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:07,530 INFO L93 Difference]: Finished difference Result 598 states and 618 transitions. [2018-01-29 23:31:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:31:07,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 362 [2018-01-29 23:31:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:07,531 INFO L225 Difference]: With dead ends: 598 [2018-01-29 23:31:07,531 INFO L226 Difference]: Without dead ends: 374 [2018-01-29 23:31:07,532 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:31:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-29 23:31:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-01-29 23:31:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-29 23:31:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 382 transitions. [2018-01-29 23:31:07,538 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 382 transitions. Word has length 362 [2018-01-29 23:31:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:07,539 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 382 transitions. [2018-01-29 23:31:07,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:31:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 382 transitions. [2018-01-29 23:31:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-01-29 23:31:07,540 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:07,540 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:07,540 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 8478999, now seen corresponding path program 18 times [2018-01-29 23:31:07,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:07,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:07,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:07,541 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:07,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:07,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-01-29 23:31:07,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:07,742 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-29 23:31:07,747 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:31:07,757 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,758 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,762 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,765 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,769 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,773 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,778 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:07,779 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:07,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-01-29 23:31:07,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:07,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-01-29 23:31:07,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:31:07,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:31:07,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:31:07,870 INFO L87 Difference]: Start difference. First operand 371 states and 382 transitions. Second operand 17 states. [2018-01-29 23:31:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:08,182 INFO L93 Difference]: Finished difference Result 613 states and 634 transitions. [2018-01-29 23:31:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:31:08,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 368 [2018-01-29 23:31:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:08,184 INFO L225 Difference]: With dead ends: 613 [2018-01-29 23:31:08,184 INFO L226 Difference]: Without dead ends: 389 [2018-01-29 23:31:08,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:31:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-29 23:31:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 383. [2018-01-29 23:31:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-01-29 23:31:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 394 transitions. [2018-01-29 23:31:08,191 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 394 transitions. Word has length 368 [2018-01-29 23:31:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:08,192 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 394 transitions. [2018-01-29 23:31:08,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:31:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 394 transitions. [2018-01-29 23:31:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-01-29 23:31:08,193 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:08,193 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:08,193 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1930737047, now seen corresponding path program 19 times [2018-01-29 23:31:08,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:08,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:08,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:08,194 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:08,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:08,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-01-29 23:31:08,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:08,514 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-29 23:31:08,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:08,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-01-29 23:31:08,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:08,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 23] total 32 [2018-01-29 23:31:08,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:31:08,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:31:08,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:31:08,754 INFO L87 Difference]: Start difference. First operand 383 states and 394 transitions. Second operand 32 states. [2018-01-29 23:31:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:09,226 INFO L93 Difference]: Finished difference Result 690 states and 713 transitions. [2018-01-29 23:31:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 23:31:09,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 380 [2018-01-29 23:31:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:09,227 INFO L225 Difference]: With dead ends: 690 [2018-01-29 23:31:09,227 INFO L226 Difference]: Without dead ends: 405 [2018-01-29 23:31:09,228 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=725, Invalid=2815, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 23:31:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-29 23:31:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 397. [2018-01-29 23:31:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-01-29 23:31:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 408 transitions. [2018-01-29 23:31:09,236 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 408 transitions. Word has length 380 [2018-01-29 23:31:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:09,236 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 408 transitions. [2018-01-29 23:31:09,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:31:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 408 transitions. [2018-01-29 23:31:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-01-29 23:31:09,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:09,237 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:09,238 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash -478331432, now seen corresponding path program 20 times [2018-01-29 23:31:09,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:09,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:09,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:09,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:09,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:09,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2018-01-29 23:31:09,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:09,549 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-29 23:31:09,553 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:31:09,564 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:09,583 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:09,593 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:09,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-01-29 23:31:09,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:09,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25] total 34 [2018-01-29 23:31:09,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:31:09,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:31:09,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:31:09,980 INFO L87 Difference]: Start difference. First operand 397 states and 408 transitions. Second operand 34 states. [2018-01-29 23:31:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:11,018 INFO L93 Difference]: Finished difference Result 710 states and 733 transitions. [2018-01-29 23:31:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:31:11,018 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 394 [2018-01-29 23:31:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:11,019 INFO L225 Difference]: With dead ends: 710 [2018-01-29 23:31:11,019 INFO L226 Difference]: Without dead ends: 419 [2018-01-29 23:31:11,020 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=840, Invalid=3192, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 23:31:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-29 23:31:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2018-01-29 23:31:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-01-29 23:31:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 422 transitions. [2018-01-29 23:31:11,030 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 422 transitions. Word has length 394 [2018-01-29 23:31:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:11,030 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 422 transitions. [2018-01-29 23:31:11,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:31:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 422 transitions. [2018-01-29 23:31:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-29 23:31:11,031 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:11,032 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:11,032 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 482535321, now seen corresponding path program 21 times [2018-01-29 23:31:11,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:11,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:11,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:11,032 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:11,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:11,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2018-01-29 23:31:11,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:11,259 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:11,263 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:31:11,273 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:11,278 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:11,287 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:11,295 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:11,297 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:11,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2018-01-29 23:31:11,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:11,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-29 23:31:11,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:31:11,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:31:11,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:31:11,443 INFO L87 Difference]: Start difference. First operand 411 states and 422 transitions. Second operand 12 states. [2018-01-29 23:31:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:11,608 INFO L93 Difference]: Finished difference Result 704 states and 726 transitions. [2018-01-29 23:31:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:31:11,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 408 [2018-01-29 23:31:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:11,610 INFO L225 Difference]: With dead ends: 704 [2018-01-29 23:31:11,610 INFO L226 Difference]: Without dead ends: 429 [2018-01-29 23:31:11,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:31:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-01-29 23:31:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2018-01-29 23:31:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-29 23:31:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 434 transitions. [2018-01-29 23:31:11,617 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 434 transitions. Word has length 408 [2018-01-29 23:31:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:11,617 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 434 transitions. [2018-01-29 23:31:11,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:31:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 434 transitions. [2018-01-29 23:31:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-01-29 23:31:11,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:11,618 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:11,618 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1492862569, now seen corresponding path program 22 times [2018-01-29 23:31:11,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:11,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:11,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:11,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:11,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:11,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-01-29 23:31:11,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:11,829 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:11,834 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:31:11,865 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:11,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:11,996 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-29 23:31:11,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:11,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:11,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-29 23:31:12,073 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-29 23:31:12,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:12,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,120 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-29 23:31:12,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:12,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,129 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-29 23:31:12,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:12,229 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-29 23:31:12,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,232 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 15 treesize of output 7 [2018-01-29 23:31:12,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:12,386 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-29 23:31:12,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:12,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:31:12,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-29 23:31:12,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,457 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 14 treesize of output 17 [2018-01-29 23:31:12,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,461 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-29 23:31:12,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:12,605 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-29 23:31:12,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,608 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 15 treesize of output 7 [2018-01-29 23:31:12,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:12,775 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-29 23:31:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:12,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,858 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-29 23:31:12,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:12,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:12,867 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-29 23:31:12,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:13,062 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-29 23:31:13,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,065 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 15 treesize of output 7 [2018-01-29 23:31:13,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:13,338 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 8 [2018-01-29 23:31:13,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,340 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-29 23:31:13,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:13,569 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-29 23:31:13,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:13,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-29 23:31:13,677 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-29 23:31:13,681 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 14 treesize of output 13 [2018-01-29 23:31:13,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:31:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 5 proven. 534 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:31:14,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:14,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 98] total 107 [2018-01-29 23:31:14,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-01-29 23:31:14,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-01-29 23:31:14,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=10838, Unknown=0, NotChecked=0, Total=11342 [2018-01-29 23:31:14,316 INFO L87 Difference]: Start difference. First operand 423 states and 434 transitions. Second operand 107 states. [2018-01-29 23:31:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:20,262 INFO L93 Difference]: Finished difference Result 562 states and 579 transitions. [2018-01-29 23:31:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-01-29 23:31:20,262 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 420 [2018-01-29 23:31:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:20,263 INFO L225 Difference]: With dead ends: 562 [2018-01-29 23:31:20,263 INFO L226 Difference]: Without dead ends: 461 [2018-01-29 23:31:20,265 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17909 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3010, Invalid=47840, Unknown=0, NotChecked=0, Total=50850 [2018-01-29 23:31:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-01-29 23:31:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 439. [2018-01-29 23:31:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-29 23:31:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 450 transitions. [2018-01-29 23:31:20,292 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 450 transitions. Word has length 420 [2018-01-29 23:31:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:20,292 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 450 transitions. [2018-01-29 23:31:20,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-01-29 23:31:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 450 transitions. [2018-01-29 23:31:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-01-29 23:31:20,294 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:20,294 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:20,294 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1849465134, now seen corresponding path program 23 times [2018-01-29 23:31:20,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:20,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:20,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:20,295 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:20,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:20,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2018-01-29 23:31:20,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:20,559 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:20,565 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:31:20,574 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,575 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,576 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,577 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,578 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,579 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,580 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,583 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,591 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,598 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,606 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,615 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,635 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:20,636 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:20,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-01-29 23:31:20,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:20,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2018-01-29 23:31:20,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:31:20,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:31:20,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:31:20,740 INFO L87 Difference]: Start difference. First operand 439 states and 450 transitions. Second operand 17 states. [2018-01-29 23:31:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:20,927 INFO L93 Difference]: Finished difference Result 541 states and 556 transitions. [2018-01-29 23:31:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:31:20,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 436 [2018-01-29 23:31:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:20,928 INFO L225 Difference]: With dead ends: 541 [2018-01-29 23:31:20,928 INFO L226 Difference]: Without dead ends: 457 [2018-01-29 23:31:20,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:31:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-01-29 23:31:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451. [2018-01-29 23:31:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-01-29 23:31:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 462 transitions. [2018-01-29 23:31:20,937 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 462 transitions. Word has length 436 [2018-01-29 23:31:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:20,937 INFO L432 AbstractCegarLoop]: Abstraction has 451 states and 462 transitions. [2018-01-29 23:31:20,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:31:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 462 transitions. [2018-01-29 23:31:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-01-29 23:31:20,939 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:20,939 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:31:20,939 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash -984888238, now seen corresponding path program 24 times [2018-01-29 23:31:20,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:20,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:20,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:20,940 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:20,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:20,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2018-01-29 23:31:21,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:21,325 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:21,331 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:31:21,343 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,344 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,349 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,352 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,356 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,360 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,365 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,369 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,376 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:21,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:21,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 136 proven. 44 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2018-01-29 23:31:21,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:21,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 26 [2018-01-29 23:31:21,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:31:21,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:31:21,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:31:21,533 INFO L87 Difference]: Start difference. First operand 451 states and 462 transitions. Second operand 26 states. [2018-01-29 23:31:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:22,090 INFO L93 Difference]: Finished difference Result 718 states and 738 transitions. [2018-01-29 23:31:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-29 23:31:22,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 448 [2018-01-29 23:31:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:22,091 INFO L225 Difference]: With dead ends: 718 [2018-01-29 23:31:22,092 INFO L226 Difference]: Without dead ends: 469 [2018-01-29 23:31:22,092 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=775, Invalid=3131, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 23:31:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-01-29 23:31:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2018-01-29 23:31:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-01-29 23:31:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 474 transitions. [2018-01-29 23:31:22,101 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 474 transitions. Word has length 448 [2018-01-29 23:31:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:22,101 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 474 transitions. [2018-01-29 23:31:22,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:31:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 474 transitions. [2018-01-29 23:31:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-01-29 23:31:22,103 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:22,103 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:22,103 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2010077474, now seen corresponding path program 25 times [2018-01-29 23:31:22,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:22,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:22,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:22,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:22,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:22,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2018-01-29 23:31:22,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:22,457 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:22,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:22,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-01-29 23:31:22,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:22,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27] total 38 [2018-01-29 23:31:22,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:31:22,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:31:22,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:31:22,771 INFO L87 Difference]: Start difference. First operand 463 states and 474 transitions. Second operand 38 states. [2018-01-29 23:31:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:23,383 INFO L93 Difference]: Finished difference Result 834 states and 857 transitions. [2018-01-29 23:31:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-29 23:31:23,384 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 460 [2018-01-29 23:31:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:23,385 INFO L225 Difference]: With dead ends: 834 [2018-01-29 23:31:23,385 INFO L226 Difference]: Without dead ends: 485 [2018-01-29 23:31:23,385 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1020, Invalid=4092, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 23:31:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-29 23:31:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 477. [2018-01-29 23:31:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-01-29 23:31:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 488 transitions. [2018-01-29 23:31:23,394 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 488 transitions. Word has length 460 [2018-01-29 23:31:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:23,394 INFO L432 AbstractCegarLoop]: Abstraction has 477 states and 488 transitions. [2018-01-29 23:31:23,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:31:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 488 transitions. [2018-01-29 23:31:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-01-29 23:31:23,396 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:23,396 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:23,396 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -88535581, now seen corresponding path program 26 times [2018-01-29 23:31:23,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:23,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:23,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:23,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:23,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:23,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-01-29 23:31:23,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:23,749 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:23,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:31:23,764 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:23,787 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:23,791 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:23,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-01-29 23:31:24,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:24,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 29] total 40 [2018-01-29 23:31:24,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:31:24,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:31:24,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1289, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:31:24,088 INFO L87 Difference]: Start difference. First operand 477 states and 488 transitions. Second operand 40 states. [2018-01-29 23:31:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:24,775 INFO L93 Difference]: Finished difference Result 854 states and 877 transitions. [2018-01-29 23:31:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-29 23:31:24,775 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 474 [2018-01-29 23:31:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:24,777 INFO L225 Difference]: With dead ends: 854 [2018-01-29 23:31:24,777 INFO L226 Difference]: Without dead ends: 499 [2018-01-29 23:31:24,777 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1155, Invalid=4545, Unknown=0, NotChecked=0, Total=5700 [2018-01-29 23:31:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-29 23:31:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 491. [2018-01-29 23:31:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-01-29 23:31:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 502 transitions. [2018-01-29 23:31:24,787 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 502 transitions. Word has length 474 [2018-01-29 23:31:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:24,787 INFO L432 AbstractCegarLoop]: Abstraction has 491 states and 502 transitions. [2018-01-29 23:31:24,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 23:31:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 502 transitions. [2018-01-29 23:31:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-01-29 23:31:24,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:24,789 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:24,789 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1892231204, now seen corresponding path program 27 times [2018-01-29 23:31:24,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:24,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:24,790 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:24,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 1496 trivial. 0 not checked. [2018-01-29 23:31:25,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:25,170 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:25,175 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:31:25,185 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:25,195 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:25,202 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:25,209 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:25,217 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:25,219 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:25,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-01-29 23:31:25,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:25,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-29 23:31:25,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:31:25,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:31:25,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:31:25,297 INFO L87 Difference]: Start difference. First operand 491 states and 502 transitions. Second operand 11 states. [2018-01-29 23:31:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:25,466 INFO L93 Difference]: Finished difference Result 707 states and 724 transitions. [2018-01-29 23:31:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:31:25,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 488 [2018-01-29 23:31:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:25,468 INFO L225 Difference]: With dead ends: 707 [2018-01-29 23:31:25,468 INFO L226 Difference]: Without dead ends: 500 [2018-01-29 23:31:25,468 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:31:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-01-29 23:31:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2018-01-29 23:31:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-01-29 23:31:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 508 transitions. [2018-01-29 23:31:25,477 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 508 transitions. Word has length 488 [2018-01-29 23:31:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:25,477 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 508 transitions. [2018-01-29 23:31:25,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:31:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 508 transitions. [2018-01-29 23:31:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-01-29 23:31:25,479 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:25,479 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:25,479 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1968902924, now seen corresponding path program 28 times [2018-01-29 23:31:25,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:25,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:25,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:25,480 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:25,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:25,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1496 trivial. 0 not checked. [2018-01-29 23:31:25,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:25,775 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:25,780 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:31:25,853 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:25,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2018-01-29 23:31:26,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:26,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 42 [2018-01-29 23:31:26,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 23:31:26,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 23:31:26,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 23:31:26,206 INFO L87 Difference]: Start difference. First operand 497 states and 508 transitions. Second operand 42 states. [2018-01-29 23:31:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:26,889 INFO L93 Difference]: Finished difference Result 886 states and 909 transitions. [2018-01-29 23:31:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-29 23:31:26,899 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 494 [2018-01-29 23:31:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:26,901 INFO L225 Difference]: With dead ends: 886 [2018-01-29 23:31:26,901 INFO L226 Difference]: Without dead ends: 519 [2018-01-29 23:31:26,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1300, Invalid=5020, Unknown=0, NotChecked=0, Total=6320 [2018-01-29 23:31:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-01-29 23:31:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 511. [2018-01-29 23:31:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-01-29 23:31:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 522 transitions. [2018-01-29 23:31:26,916 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 522 transitions. Word has length 494 [2018-01-29 23:31:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:26,916 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 522 transitions. [2018-01-29 23:31:26,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 23:31:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 522 transitions. [2018-01-29 23:31:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-01-29 23:31:26,924 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:26,924 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:26,924 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1912135843, now seen corresponding path program 29 times [2018-01-29 23:31:26,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:26,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:26,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:26,925 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:26,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:26,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1642 trivial. 0 not checked. [2018-01-29 23:31:27,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:27,464 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:27,469 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:31:27,478 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,481 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,482 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,483 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,484 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,485 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,487 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,488 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,490 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,493 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,497 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,504 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,512 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,521 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,532 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,555 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:27,557 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:27,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-01-29 23:31:27,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:27,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-29 23:31:27,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:31:27,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:31:27,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:31:27,685 INFO L87 Difference]: Start difference. First operand 511 states and 522 transitions. Second operand 18 states. [2018-01-29 23:31:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:27,970 INFO L93 Difference]: Finished difference Result 775 states and 794 transitions. [2018-01-29 23:31:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:31:27,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 508 [2018-01-29 23:31:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:27,971 INFO L225 Difference]: With dead ends: 775 [2018-01-29 23:31:27,971 INFO L226 Difference]: Without dead ends: 529 [2018-01-29 23:31:27,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:31:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-01-29 23:31:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 523. [2018-01-29 23:31:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-01-29 23:31:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 534 transitions. [2018-01-29 23:31:27,980 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 534 transitions. Word has length 508 [2018-01-29 23:31:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:27,980 INFO L432 AbstractCegarLoop]: Abstraction has 523 states and 534 transitions. [2018-01-29 23:31:27,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:31:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 534 transitions. [2018-01-29 23:31:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-01-29 23:31:27,982 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:27,982 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:27,982 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -927741859, now seen corresponding path program 30 times [2018-01-29 23:31:27,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:27,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:27,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:27,983 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:27,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:27,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2018-01-29 23:31:28,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:28,679 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:28,683 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:31:28,695 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,696 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,704 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,708 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,711 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,717 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,721 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,727 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:31:28,729 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:28,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-01-29 23:31:28,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:28,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2018-01-29 23:31:28,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:31:28,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:31:28,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:31:28,841 INFO L87 Difference]: Start difference. First operand 523 states and 534 transitions. Second operand 21 states. [2018-01-29 23:31:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:29,145 INFO L93 Difference]: Finished difference Result 898 states and 920 transitions. [2018-01-29 23:31:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:31:29,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 520 [2018-01-29 23:31:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:29,146 INFO L225 Difference]: With dead ends: 898 [2018-01-29 23:31:29,146 INFO L226 Difference]: Without dead ends: 541 [2018-01-29 23:31:29,146 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:31:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-29 23:31:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2018-01-29 23:31:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-01-29 23:31:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 546 transitions. [2018-01-29 23:31:29,155 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 546 transitions. Word has length 520 [2018-01-29 23:31:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:29,155 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 546 transitions. [2018-01-29 23:31:29,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:31:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 546 transitions. [2018-01-29 23:31:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-01-29 23:31:29,157 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:29,158 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:29,158 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1077444947, now seen corresponding path program 31 times [2018-01-29 23:31:29,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:29,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:29,158 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:29,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2018-01-29 23:31:29,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:29,651 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:29,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:29,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 984 trivial. 0 not checked. [2018-01-29 23:31:30,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:30,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 33] total 46 [2018-01-29 23:31:30,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 23:31:30,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 23:31:30,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:31:30,084 INFO L87 Difference]: Start difference. First operand 535 states and 546 transitions. Second operand 46 states. [2018-01-29 23:31:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:30,841 INFO L93 Difference]: Finished difference Result 954 states and 977 transitions. [2018-01-29 23:31:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-29 23:31:30,841 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 532 [2018-01-29 23:31:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:30,842 INFO L225 Difference]: With dead ends: 954 [2018-01-29 23:31:30,842 INFO L226 Difference]: Without dead ends: 557 [2018-01-29 23:31:30,843 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1520, Invalid=6136, Unknown=0, NotChecked=0, Total=7656 [2018-01-29 23:31:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-01-29 23:31:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 549. [2018-01-29 23:31:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-01-29 23:31:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 560 transitions. [2018-01-29 23:31:30,853 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 560 transitions. Word has length 532 [2018-01-29 23:31:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:30,853 INFO L432 AbstractCegarLoop]: Abstraction has 549 states and 560 transitions. [2018-01-29 23:31:30,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 23:31:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 560 transitions. [2018-01-29 23:31:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-01-29 23:31:30,855 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:30,855 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:30,855 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 601567278, now seen corresponding path program 32 times [2018-01-29 23:31:30,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:30,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:30,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:30,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:31:30,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:30,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2018-01-29 23:31:31,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:31,418 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:31,427 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:31:31,439 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:31,465 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:31:31,471 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:31,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2018-01-29 23:31:31,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:31,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 35] total 48 [2018-01-29 23:31:31,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-29 23:31:31,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-29 23:31:31,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1871, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:31:31,892 INFO L87 Difference]: Start difference. First operand 549 states and 560 transitions. Second operand 48 states. [2018-01-29 23:31:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:32,744 INFO L93 Difference]: Finished difference Result 974 states and 997 transitions. [2018-01-29 23:31:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-29 23:31:32,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 546 [2018-01-29 23:31:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:32,745 INFO L225 Difference]: With dead ends: 974 [2018-01-29 23:31:32,746 INFO L226 Difference]: Without dead ends: 571 [2018-01-29 23:31:32,747 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1685, Invalid=6687, Unknown=0, NotChecked=0, Total=8372 [2018-01-29 23:31:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-29 23:31:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2018-01-29 23:31:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-01-29 23:31:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 574 transitions. [2018-01-29 23:31:32,768 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 574 transitions. Word has length 546 [2018-01-29 23:31:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:32,768 INFO L432 AbstractCegarLoop]: Abstraction has 563 states and 574 transitions. [2018-01-29 23:31:32,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-29 23:31:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 574 transitions. [2018-01-29 23:31:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-01-29 23:31:32,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:32,779 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:32,780 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash 895970431, now seen corresponding path program 33 times [2018-01-29 23:31:32,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:32,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:32,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:32,780 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:32,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:32,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 2034 trivial. 0 not checked. [2018-01-29 23:31:33,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:33,404 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:33,408 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:31:33,421 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,425 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,431 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,439 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,447 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,455 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:31:33,456 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:33,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 130 proven. 70 refuted. 0 times theorem prover too weak. 1982 trivial. 0 not checked. [2018-01-29 23:31:33,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:33,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2018-01-29 23:31:33,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:31:33,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:31:33,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:31:33,600 INFO L87 Difference]: Start difference. First operand 563 states and 574 transitions. Second operand 25 states. [2018-01-29 23:31:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:31:34,085 INFO L93 Difference]: Finished difference Result 956 states and 978 transitions. [2018-01-29 23:31:34,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 23:31:34,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 560 [2018-01-29 23:31:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:31:34,086 INFO L225 Difference]: With dead ends: 956 [2018-01-29 23:31:34,086 INFO L226 Difference]: Without dead ends: 581 [2018-01-29 23:31:34,087 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=735, Invalid=2687, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:31:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-01-29 23:31:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 575. [2018-01-29 23:31:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-01-29 23:31:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 586 transitions. [2018-01-29 23:31:34,096 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 586 transitions. Word has length 560 [2018-01-29 23:31:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:31:34,097 INFO L432 AbstractCegarLoop]: Abstraction has 575 states and 586 transitions. [2018-01-29 23:31:34,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:31:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 586 transitions. [2018-01-29 23:31:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-01-29 23:31:34,099 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:31:34,099 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:31:34,099 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:31:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash 685446783, now seen corresponding path program 34 times [2018-01-29 23:31:34,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:31:34,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:31:34,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:34,100 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:31:34,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:31:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:31:34,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:31:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-01-29 23:31:34,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:31:34,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:31:34,530 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:31:34,577 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:31:34,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:31:34,648 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-29 23:31:34,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:31:34,681 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-29 23:31:34,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-29 23:31:34,826 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-29 23:31:34,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-29 23:31:34,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:31:34,991 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-29 23:31:34,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,994 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 15 treesize of output 7 [2018-01-29 23:31:34,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:34,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-01-29 23:31:35,187 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-29 23:31:35,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:35,266 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-29 23:31:35,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-29 23:31:35,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-29 23:31:35,496 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-29 23:31:35,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:35,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:35,646 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-29 23:31:35,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:35,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:35,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:35,889 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-29 23:31:35,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:36,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:31:36,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:36,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:36,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:36,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:36,883 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-29 23:31:36,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:36,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:36,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-29 23:31:36,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:36,894 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-29 23:31:36,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-29 23:31:37,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 8 treesize of output 7 [2018-01-29 23:31:37,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:37,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:37,307 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-29 23:31:37,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:31:37,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2018-01-29 23:31:37,436 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-29 23:31:37,439 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 14 treesize of output 13 [2018-01-29 23:31:37,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-01-29 23:31:37,790 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-29 23:31:37,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:37,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:37,918 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-29 23:31:37,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:37,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:31:38,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:38,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:38,070 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 23 treesize of output 30 [2018-01-29 23:31:38,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:31:38,235 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 30 treesize of output 29 [2018-01-29 23:31:38,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-01-29 23:31:38,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:7 [2018-01-29 23:31:38,664 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-29 23:31:38,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:31:38,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:38,811 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-29 23:31:38,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:31:38,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:38,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:31:38,975 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 23 treesize of output 30 [2018-01-29 23:31:38,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:38,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:31:39,156 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 30 treesize of output 29 [2018-01-29 23:31:39,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:39,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-01-29 23:31:39,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:39,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:39,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:7 [2018-01-29 23:31:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 7 proven. 1114 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2018-01-29 23:31:40,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:40,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 142] total 155 [2018-01-29 23:31:40,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-01-29 23:31:40,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-01-29 23:31:40,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=23028, Unknown=0, NotChecked=0, Total=23870 [2018-01-29 23:31:40,299 INFO L87 Difference]: Start difference. First operand 575 states and 586 transitions. Second operand 155 states. Received shutdown request... [2018-01-29 23:31:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-01-29 23:31:47,757 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:31:47,760 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:31:47,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:31:47 BoogieIcfgContainer [2018-01-29 23:31:47,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:31:47,761 INFO L168 Benchmark]: Toolchain (without parser) took 67624.05 ms. Allocated memory was 149.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 115.7 MB in the beginning and 747.8 MB in the end (delta: -632.2 MB). Peak memory consumption was 408.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:31:47,762 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:31:47,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 111.41 ms. Allocated memory is still 149.4 MB. Free memory was 115.4 MB in the beginning and 106.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:31:47,762 INFO L168 Benchmark]: Boogie Preprocessor took 19.53 ms. Allocated memory is still 149.4 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:31:47,762 INFO L168 Benchmark]: RCFGBuilder took 440.79 ms. Allocated memory is still 149.4 MB. Free memory was 105.1 MB in the beginning and 84.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:31:47,762 INFO L168 Benchmark]: TraceAbstraction took 67049.91 ms. Allocated memory was 149.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 83.9 MB in the beginning and 747.8 MB in the end (delta: -664.0 MB). Peak memory consumption was 376.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:31:47,769 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 149.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 111.41 ms. Allocated memory is still 149.4 MB. Free memory was 115.4 MB in the beginning and 106.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.53 ms. Allocated memory is still 149.4 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 440.79 ms. Allocated memory is still 149.4 MB. Free memory was 105.1 MB in the beginning and 84.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67049.91 ms. Allocated memory was 149.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 83.9 MB in the beginning and 747.8 MB in the end (delta: -664.0 MB). Peak memory consumption was 376.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (575states) and interpolant automaton (currently 132 states, 155 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 272 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 1 error locations. TIMEOUT Result, 67.0s OverallTime, 41 OverallIterations, 18 TraceHistogramMax, 34.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3681 SDtfs, 9699 SDslu, 48162 SDs, 0 SdLazy, 49364 SolverSat, 2568 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14269 GetRequests, 12227 SyntacticMatches, 0 SemanticMatches, 2041 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75386 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 427 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 25968 NumberOfCodeBlocks, 24454 NumberOfCodeBlocksAsserted, 185 NumberOfCheckSat, 25889 ConstructedInterpolants, 0 QuantifiedInterpolants, 17245257 SizeOfPredicates, 773 NumberOfNonLiveVariables, 15727 ConjunctsInSsa, 1204 ConjunctsInUnsatCore, 79 InterpolantComputations, 3 PerfectInterpolantSequences, 52773/62642 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/standard_copy9_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-31-47-783.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy9_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-31-47-783.csv Completed graceful shutdown