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/reducercommutativity/max05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:44:03,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:44:03,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:44:03,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:44:03,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:44:03,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:44:03,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:44:03,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:44:03,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:44:03,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:44:03,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:44:03,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:44:03,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:44:03,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:44:03,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:44:03,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:44:03,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:44:03,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:44:03,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:44:03,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:44:03,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:44:03,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:44:03,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:44:03,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:44:03,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:44:03,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:44:03,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:44:03,882 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:44:03,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:44:03,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:44:03,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:44:03,883 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:44:03,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:44:03,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:44:03,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:44:03,896 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:44:03,897 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:44:03,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:44:03,897 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:44:03,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:44:03,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:44:03,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:44:03,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:44:03,898 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:44:03,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:44:03,899 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:44:03,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:44:03,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:44:03,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:44:03,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:44:03,902 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:44:03,902 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:44:03,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:44:03,944 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:44:03,948 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:44:03,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:44:03,949 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:44:03,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-01-30 00:44:04,018 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:44:04,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:44:04,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:44:04,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:44:04,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:44:04,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2292a656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04, skipping insertion in model container [2018-01-30 00:44:04,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,035 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:44:04,044 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:44:04,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:44:04,128 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:44:04,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04 WrapperNode [2018-01-30 00:44:04,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:44:04,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:44:04,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:44:04,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:44:04,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... [2018-01-30 00:44:04,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:44:04,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:44:04,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:44:04,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:44:04,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:44:04,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:44:04,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:44:04,193 INFO L136 BoogieDeclarations]: Found implementation of procedure max [2018-01-30 00:44:04,193 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:44:04,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:44:04,194 INFO L128 BoogieDeclarations]: Found specification of procedure max [2018-01-30 00:44:04,194 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:44:04,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:44:04,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:44:04,551 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:44:04,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:44:04 BoogieIcfgContainer [2018-01-30 00:44:04,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:44:04,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:44:04,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:44:04,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:44:04,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:44:04" (1/3) ... [2018-01-30 00:44:04,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7210c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:44:04, skipping insertion in model container [2018-01-30 00:44:04,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:44:04" (2/3) ... [2018-01-30 00:44:04,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7210c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:44:04, skipping insertion in model container [2018-01-30 00:44:04,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:44:04" (3/3) ... [2018-01-30 00:44:04,556 INFO L107 eAbstractionObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2018-01-30 00:44:04,561 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:44:04,565 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:44:04,592 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:44:04,592 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:44:04,592 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:44:04,593 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:44:04,593 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:44:04,593 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:44:04,593 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:44:04,593 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:44:04,593 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:44:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-30 00:44:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:44:04,608 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:04,608 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-30 00:44:04,608 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 00:44:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1575417866, now seen corresponding path program 1 times [2018-01-30 00:44:04,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:04,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:04,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:04,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:04,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:04,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 00:44:04,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:44:04,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:44:04,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:44:04,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:44:04,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:44:04,730 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-30 00:44:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:04,747 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-01-30 00:44:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:44:04,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 67 [2018-01-30 00:44:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:04,753 INFO L225 Difference]: With dead ends: 148 [2018-01-30 00:44:04,753 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 00:44:04,755 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:44:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 00:44:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-30 00:44:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:44:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 00:44:04,779 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 67 [2018-01-30 00:44:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:04,779 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 00:44:04,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:44:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 00:44:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:44:04,781 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:04,781 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-01-30 00:44:04,781 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 00:44:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1931623505, now seen corresponding path program 1 times [2018-01-30 00:44:04,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:04,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:04,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:04,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:04,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:04,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-30 00:44:04,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:44:04,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:44:04,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:44:04,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:44:04,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:44:04,917 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-01-30 00:44:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:05,007 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-01-30 00:44:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:44:05,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-01-30 00:44:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:05,008 INFO L225 Difference]: With dead ends: 141 [2018-01-30 00:44:05,008 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:44:05,009 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:44:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:44:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-01-30 00:44:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 00:44:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-30 00:44:05,014 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 72 [2018-01-30 00:44:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:05,014 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-30 00:44:05,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:44:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-30 00:44:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:44:05,015 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:05,016 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:05,016 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 00:44:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -636470726, now seen corresponding path program 1 times [2018-01-30 00:44:05,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:05,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:05,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:05,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-30 00:44:05,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:05,094 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:05,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:44:05,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:44:05,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-01-30 00:44:05,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:44:05,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:44:05,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:44:05,240 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-30 00:44:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:05,390 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-01-30 00:44:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:44:05,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-01-30 00:44:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:05,391 INFO L225 Difference]: With dead ends: 162 [2018-01-30 00:44:05,391 INFO L226 Difference]: Without dead ends: 105 [2018-01-30 00:44:05,392 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:44:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-30 00:44:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-01-30 00:44:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:44:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-30 00:44:05,397 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 80 [2018-01-30 00:44:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:05,397 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-30 00:44:05,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:44:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-30 00:44:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-30 00:44:05,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:05,398 INFO L350 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:05,398 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 00:44:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 91073205, now seen corresponding path program 1 times [2018-01-30 00:44:05,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:05,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:05,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:05,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-30 00:44:05,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:05,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:05,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-30 00:44:05,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:44:05,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-01-30 00:44:05,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:44:05,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:44:05,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:44:05,652 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 6 states. [2018-01-30 00:44:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:05,754 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-01-30 00:44:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:44:05,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-01-30 00:44:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:05,755 INFO L225 Difference]: With dead ends: 179 [2018-01-30 00:44:05,755 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 00:44:05,756 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:44:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 00:44:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2018-01-30 00:44:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-30 00:44:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-30 00:44:05,761 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 124 [2018-01-30 00:44:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:05,761 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-30 00:44:05,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:44:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-30 00:44:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-01-30 00:44:05,762 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:05,762 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:05,763 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 00:44:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -116200898, now seen corresponding path program 1 times [2018-01-30 00:44:05,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:05,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:05,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:05,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-01-30 00:44:05,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:05,898 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) [2018-01-30 00:44:05,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:05,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-01-30 00:44:06,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:06,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-30 00:44:06,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:44:06,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:44:06,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:44:06,104 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 10 states. [2018-01-30 00:44:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:06,340 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-01-30 00:44:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:44:06,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 168 [2018-01-30 00:44:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:06,342 INFO L225 Difference]: With dead ends: 206 [2018-01-30 00:44:06,342 INFO L226 Difference]: Without dead ends: 131 [2018-01-30 00:44:06,345 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:44:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-30 00:44:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-01-30 00:44:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 00:44:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-30 00:44:06,353 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 168 [2018-01-30 00:44:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:06,353 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-30 00:44:06,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:44:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-30 00:44:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 00:44:06,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:06,355 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:06,355 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 00:44:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -748089058, now seen corresponding path program 2 times [2018-01-30 00:44:06,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:06,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:06,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:06,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:06,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:06,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-01-30 00:44:06,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:06,503 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:06,507 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:44:06,519 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:06,540 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:06,549 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:44:06,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-01-30 00:44:06,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:06,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-01-30 00:44:06,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:44:06,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:44:06,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:44:06,871 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 14 states. [2018-01-30 00:44:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:07,048 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2018-01-30 00:44:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:44:07,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 184 [2018-01-30 00:44:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:07,049 INFO L225 Difference]: With dead ends: 242 [2018-01-30 00:44:07,049 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:44:07,050 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:44:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:44:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2018-01-30 00:44:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 00:44:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-01-30 00:44:07,054 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 184 [2018-01-30 00:44:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:07,054 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-01-30 00:44:07,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:44:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-01-30 00:44:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 00:44:07,057 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:07,057 INFO L350 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:07,059 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 00:44:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1418241177, now seen corresponding path program 3 times [2018-01-30 00:44:07,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:07,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:07,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,060 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:07,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:07,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2018-01-30 00:44:07,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:07,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:07,284 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:44:07,295 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:44:07,300 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:44:07,307 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:44:07,317 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:44:07,324 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:44:07,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 260 proven. 12 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 00:44:07,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:07,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 00:44:07,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:44:07,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:44:07,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:44:07,381 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 9 states. [2018-01-30 00:44:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:07,448 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2018-01-30 00:44:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:44:07,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 228 [2018-01-30 00:44:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:07,449 INFO L225 Difference]: With dead ends: 216 [2018-01-30 00:44:07,449 INFO L226 Difference]: Without dead ends: 156 [2018-01-30 00:44:07,449 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:44:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-30 00:44:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2018-01-30 00:44:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-30 00:44:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-01-30 00:44:07,453 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 228 [2018-01-30 00:44:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:07,455 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-01-30 00:44:07,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:44:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-01-30 00:44:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-30 00:44:07,456 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:07,457 INFO L350 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-01-30 00:44:07,457 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 00:44:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1712087280, now seen corresponding path program 4 times [2018-01-30 00:44:07,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:07,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:07,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,457 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:07,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:07,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-01-30 00:44:07,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:07,673 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:07,678 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:44:07,709 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:44:07,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-01-30 00:44:07,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:07,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-01-30 00:44:07,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:44:07,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:44:07,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:44:07,764 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 13 states. [2018-01-30 00:44:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:07,890 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2018-01-30 00:44:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:44:07,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 236 [2018-01-30 00:44:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:07,891 INFO L225 Difference]: With dead ends: 264 [2018-01-30 00:44:07,891 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:44:07,892 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:44:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:44:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-30 00:44:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-30 00:44:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-01-30 00:44:07,895 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 236 [2018-01-30 00:44:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:07,895 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-01-30 00:44:07,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:44:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-01-30 00:44:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-30 00:44:07,897 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:07,897 INFO L350 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1] [2018-01-30 00:44:07,897 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 00:44:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1968763783, now seen corresponding path program 5 times [2018-01-30 00:44:07,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:07,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:07,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,898 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:07,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:07,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-01-30 00:44:08,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:08,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:08,014 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:44:08,027 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:08,031 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:08,037 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:08,044 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:44:08,059 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:44:08,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 254 proven. 42 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-01-30 00:44:08,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:08,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-30 00:44:08,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:44:08,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:44:08,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:44:08,113 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 11 states. [2018-01-30 00:44:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:08,180 INFO L93 Difference]: Finished difference Result 288 states and 306 transitions. [2018-01-30 00:44:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:44:08,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2018-01-30 00:44:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:08,181 INFO L225 Difference]: With dead ends: 288 [2018-01-30 00:44:08,181 INFO L226 Difference]: Without dead ends: 184 [2018-01-30 00:44:08,181 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:44:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-30 00:44:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2018-01-30 00:44:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 00:44:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 181 transitions. [2018-01-30 00:44:08,184 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 181 transitions. Word has length 244 [2018-01-30 00:44:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:08,185 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 181 transitions. [2018-01-30 00:44:08,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:44:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2018-01-30 00:44:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-01-30 00:44:08,186 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:08,186 INFO L350 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1] [2018-01-30 00:44:08,186 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 00:44:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash -447323125, now seen corresponding path program 6 times [2018-01-30 00:44:08,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:08,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:08,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:08,187 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:08,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:08,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-01-30 00:44:08,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:08,349 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:08,355 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:44:08,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,368 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,376 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,381 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,392 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,400 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,410 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:44:08,411 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:44:08,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 646 proven. 80 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-30 00:44:08,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:08,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-01-30 00:44:08,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:44:08,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:44:08,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:44:08,518 INFO L87 Difference]: Start difference. First operand 173 states and 181 transitions. Second operand 13 states. [2018-01-30 00:44:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:08,672 INFO L93 Difference]: Finished difference Result 305 states and 324 transitions. [2018-01-30 00:44:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:44:08,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2018-01-30 00:44:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:08,679 INFO L225 Difference]: With dead ends: 305 [2018-01-30 00:44:08,680 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:44:08,680 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:44:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:44:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-30 00:44:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:44:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions. [2018-01-30 00:44:08,683 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 280 [2018-01-30 00:44:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:08,683 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 196 transitions. [2018-01-30 00:44:08,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:44:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 196 transitions. [2018-01-30 00:44:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-01-30 00:44:08,684 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:08,684 INFO L350 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1] [2018-01-30 00:44:08,684 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 00:44:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1507351197, now seen corresponding path program 7 times [2018-01-30 00:44:08,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:08,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:08,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:08,685 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:08,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:08,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2018-01-30 00:44:09,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:09,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:09,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:09,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 660 proven. 30 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2018-01-30 00:44:09,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:09,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-30 00:44:09,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:44:09,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:44:09,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:44:09,276 INFO L87 Difference]: Start difference. First operand 187 states and 196 transitions. Second operand 11 states. [2018-01-30 00:44:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:09,350 INFO L93 Difference]: Finished difference Result 283 states and 298 transitions. [2018-01-30 00:44:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:44:09,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 316 [2018-01-30 00:44:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:09,351 INFO L225 Difference]: With dead ends: 283 [2018-01-30 00:44:09,352 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:44:09,352 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:44:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:44:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-01-30 00:44:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:44:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 204 transitions. [2018-01-30 00:44:09,355 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 204 transitions. Word has length 316 [2018-01-30 00:44:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:09,355 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 204 transitions. [2018-01-30 00:44:09,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:44:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 204 transitions. [2018-01-30 00:44:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 00:44:09,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:09,357 INFO L350 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:09,357 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 00:44:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2084618260, now seen corresponding path program 8 times [2018-01-30 00:44:09,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:09,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:09,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:09,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:09,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:09,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-30 00:44:10,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:44:10,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:44:10,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:44:10,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:44:10,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:44:10,086 INFO L87 Difference]: Start difference. First operand 195 states and 204 transitions. Second operand 11 states. [2018-01-30 00:44:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:44:10,438 INFO L93 Difference]: Finished difference Result 382 states and 403 transitions. [2018-01-30 00:44:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:44:10,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 324 [2018-01-30 00:44:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:44:10,441 INFO L225 Difference]: With dead ends: 382 [2018-01-30 00:44:10,441 INFO L226 Difference]: Without dead ends: 376 [2018-01-30 00:44:10,441 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:44:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-01-30 00:44:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 309. [2018-01-30 00:44:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-30 00:44:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 329 transitions. [2018-01-30 00:44:10,449 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 329 transitions. Word has length 324 [2018-01-30 00:44:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:44:10,449 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 329 transitions. [2018-01-30 00:44:10,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:44:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 329 transitions. [2018-01-30 00:44:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 00:44:10,451 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:44:10,451 INFO L350 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:44:10,451 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 00:44:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash -435264682, now seen corresponding path program 1 times [2018-01-30 00:44:10,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:44:10,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:44:10,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:10,452 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:44:10,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:44:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:10,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:44:11,080 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 00:44:11,253 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 00:44:11,434 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 21 DAG size of output 8 [2018-01-30 00:44:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 1207 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-30 00:44:12,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:44:12,260 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:44:12,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:44:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:44:12,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:44:12,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:44:12,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:44:12,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:12,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:12,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:12,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-01-30 00:44:13,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:44:13,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-30 00:44:13,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-01-30 00:44:13,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:44:13,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:44:13,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-30 00:44:13,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-01-30 00:44:13,413 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:44:13,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 56 [2018-01-30 00:44:13,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-01-30 00:44:13,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-01-30 00:44:13,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,532 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:44:13,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 45 [2018-01-30 00:44:13,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-01-30 00:44:13,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 00:44:13,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-30 00:44:13,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-01-30 00:44:13,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-30 00:44:13,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,676 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 23 [2018-01-30 00:44:13,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-01-30 00:44:13,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-30 00:44:13,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:44:13,687 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 23 [2018-01-30 00:44:13,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:44:13,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-01-30 00:44:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 5 proven. 1157 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-01-30 00:44:14,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:44:14,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 38] total 54 [2018-01-30 00:44:14,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-30 00:44:14,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-30 00:44:14,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2649, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 00:44:14,067 INFO L87 Difference]: Start difference. First operand 309 states and 329 transitions. Second operand 54 states. [2018-01-30 00:45:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:45:14,340 INFO L93 Difference]: Finished difference Result 1002 states and 1074 transitions. [2018-01-30 00:45:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-30 00:45:14,341 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 325 [2018-01-30 00:45:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:45:14,343 INFO L225 Difference]: With dead ends: 1002 [2018-01-30 00:45:14,343 INFO L226 Difference]: Without dead ends: 722 [2018-01-30 00:45:14,347 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 303 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=921, Invalid=12885, Unknown=0, NotChecked=0, Total=13806 [2018-01-30 00:45:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-01-30 00:45:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 589. [2018-01-30 00:45:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-01-30 00:45:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 629 transitions. [2018-01-30 00:45:14,362 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 629 transitions. Word has length 325 [2018-01-30 00:45:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:45:14,362 INFO L432 AbstractCegarLoop]: Abstraction has 589 states and 629 transitions. [2018-01-30 00:45:14,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-30 00:45:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 629 transitions. [2018-01-30 00:45:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 00:45:14,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:45:14,364 INFO L350 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:45:14,364 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 00:45:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1161071374, now seen corresponding path program 2 times [2018-01-30 00:45:14,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:45:14,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:45:14,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:45:14,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:45:14,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:45:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:45:14,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:45:15,238 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 00:45:15,411 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 00:45:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 341 proven. 848 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2018-01-30 00:45:16,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:45:16,331 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:45:16,337 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:45:16,349 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:45:16,377 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:45:16,384 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:45:16,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:45:16,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:45:16,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:45:16,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2018-01-30 00:45:16,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-30 00:45:16,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:45:16,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-30 00:45:16,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-01-30 00:45:16,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-01-30 00:45:16,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:45:16,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 26 [2018-01-30 00:45:16,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:45:16,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2018-01-30 00:45:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 659 proven. 552 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 00:45:17,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:45:17,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 36] total 59 [2018-01-30 00:45:17,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-30 00:45:17,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-30 00:45:17,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3166, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 00:45:17,561 INFO L87 Difference]: Start difference. First operand 589 states and 629 transitions. Second operand 59 states. Received shutdown request... [2018-01-30 00:45:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:45:21,854 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:45:21,858 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:45:21,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:45:21 BoogieIcfgContainer [2018-01-30 00:45:21,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:45:21,859 INFO L168 Benchmark]: Toolchain (without parser) took 77839.74 ms. Allocated memory was 148.9 MB in the beginning and 724.0 MB in the end (delta: 575.1 MB). Free memory was 114.1 MB in the beginning and 217.2 MB in the end (delta: -103.1 MB). Peak memory consumption was 472.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:45:21,859 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 148.9 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:45:21,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 112.52 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 105.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:45:21,859 INFO L168 Benchmark]: Boogie Preprocessor took 19.76 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:45:21,860 INFO L168 Benchmark]: RCFGBuilder took 398.88 ms. Allocated memory is still 148.9 MB. Free memory was 103.4 MB in the beginning and 84.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:45:21,860 INFO L168 Benchmark]: TraceAbstraction took 77306.29 ms. Allocated memory was 148.9 MB in the beginning and 724.0 MB in the end (delta: 575.1 MB). Free memory was 84.1 MB in the beginning and 217.2 MB in the end (delta: -133.1 MB). Peak memory consumption was 442.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:45:21,860 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.11 ms. Allocated memory is still 148.9 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 112.52 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 105.3 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.76 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 398.88 ms. Allocated memory is still 148.9 MB. Free memory was 103.4 MB in the beginning and 84.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 77306.29 ms. Allocated memory was 148.9 MB in the beginning and 724.0 MB in the end (delta: 575.1 MB). Free memory was 84.1 MB in the beginning and 217.2 MB in the end (delta: -133.1 MB). Peak memory consumption was 442.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and interpolant automaton (currently 7 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 1 error locations. TIMEOUT Result, 77.2s OverallTime, 14 OverallIterations, 18 TraceHistogramMax, 66.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1134 SDtfs, 942 SDslu, 8207 SDs, 0 SdLazy, 3640 SolverSat, 110 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 63.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2833 GetRequests, 2484 SyntacticMatches, 31 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6922 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=13, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 279 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 5483 NumberOfCodeBlocks, 5356 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5458 ConstructedInterpolants, 210 QuantifiedInterpolants, 5881246 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3815 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 12547/17655 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/max05_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-45-21-864.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/max05_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-45-21-864.csv Completed graceful shutdown