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/sep05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e-m [2018-01-31 09:08:08,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:08:08,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:08:08,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:08:08,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:08:08,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:08:08,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:08:08,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:08:08,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:08:08,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:08:08,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:08:08,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:08:08,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:08:08,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:08:08,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:08:08,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:08:08,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:08:08,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:08:08,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:08:08,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:08:08,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:08:08,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:08:08,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:08:08,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:08:08,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:08:08,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:08:08,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:08:08,095 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:08:08,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:08:08,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:08:08,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:08:08,095 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-31 09:08:08,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:08:08,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:08:08,107 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:08:08,107 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:08:08,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:08:08,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:08:08,107 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:08:08,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-31 09:08:08,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-31 09:08:08,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:08:08,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:08:08,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:08:08,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:08:08,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:08:08,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:08:08,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:08:08,112 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:08:08,112 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:08:08,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:08:08,142 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:08:08,144 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:08:08,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:08:08,145 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:08:08,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-01-31 09:08:08,216 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:08:08,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:08:08,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:08:08,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:08:08,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:08:08,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3bf5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08, skipping insertion in model container [2018-01-31 09:08:08,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,234 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:08:08,243 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:08:08,315 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:08:08,328 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:08:08,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08 WrapperNode [2018-01-31 09:08:08,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:08:08,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:08:08,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:08:08,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:08:08,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (1/1) ... [2018-01-31 09:08:08,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:08:08,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:08:08,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:08:08,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:08:08,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (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-31 09:08:08,396 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:08:08,396 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:08:08,397 INFO L136 BoogieDeclarations]: Found implementation of procedure sep [2018-01-31 09:08:08,397 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure sep [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:08:08,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:08:08,791 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:08:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:08:08 BoogieIcfgContainer [2018-01-31 09:08:08,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:08:08,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:08:08,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:08:08,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:08:08,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:08:08" (1/3) ... [2018-01-31 09:08:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c169f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:08:08, skipping insertion in model container [2018-01-31 09:08:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:08" (2/3) ... [2018-01-31 09:08:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c169f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:08:08, skipping insertion in model container [2018-01-31 09:08:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:08:08" (3/3) ... [2018-01-31 09:08:08,796 INFO L107 eAbstractionObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-01-31 09:08:08,801 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:08:08,805 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-31 09:08:08,833 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:08:08,833 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:08:08,833 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:08:08,833 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:08:08,833 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:08:08,833 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:08:08,833 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:08:08,833 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:08:08,834 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:08:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-01-31 09:08:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 09:08:08,848 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:08,849 INFO L351 BasicCegarLoop]: trace histogram [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-31 09:08:08,849 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-31 09:08:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1329501872, now seen corresponding path program 1 times [2018-01-31 09:08:08,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:08,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:08,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:08,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:08,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:08,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 09:08:08,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:08,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:08:08,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:08:08,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:08:08,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:08:08,971 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-01-31 09:08:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:08,988 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2018-01-31 09:08:08,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:08:08,988 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 61 [2018-01-31 09:08:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:08,993 INFO L225 Difference]: With dead ends: 146 [2018-01-31 09:08:08,993 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:08:08,996 INFO L554 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-31 09:08:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:08:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:08:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:08:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-31 09:08:09,025 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 61 [2018-01-31 09:08:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:09,025 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-31 09:08:09,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:08:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-31 09:08:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 09:08:09,027 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:09,027 INFO L351 BasicCegarLoop]: trace histogram [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-31 09:08:09,027 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-31 09:08:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 695991780, now seen corresponding path program 1 times [2018-01-31 09:08:09,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:09,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:09,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:09,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:09,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:08:09,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:09,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:08:09,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:08:09,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:08:09,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:08:09,143 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 3 states. [2018-01-31 09:08:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:09,196 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-31 09:08:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:08:09,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-01-31 09:08:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:09,197 INFO L225 Difference]: With dead ends: 139 [2018-01-31 09:08:09,197 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:08:09,198 INFO L554 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-31 09:08:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:08:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-01-31 09:08:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:08:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 09:08:09,205 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 66 [2018-01-31 09:08:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:09,205 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 09:08:09,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:08:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 09:08:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 09:08:09,208 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:09,208 INFO L351 BasicCegarLoop]: trace histogram [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-31 09:08:09,208 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-31 09:08:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2128927245, now seen corresponding path program 1 times [2018-01-31 09:08:09,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:09,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:09,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:09,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:09,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:08:09,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:09,344 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-31 09:08:09,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:09,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 09:08:09,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:08:09,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-01-31 09:08:09,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:08:09,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:08:09,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:08:09,483 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-31 09:08:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:09,734 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2018-01-31 09:08:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:08:09,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-01-31 09:08:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:09,735 INFO L225 Difference]: With dead ends: 161 [2018-01-31 09:08:09,735 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 09:08:09,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:08:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 09:08:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-31 09:08:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:08:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-31 09:08:09,740 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 74 [2018-01-31 09:08:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:09,740 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-31 09:08:09,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:08:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-31 09:08:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 09:08:09,741 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:09,741 INFO L351 BasicCegarLoop]: trace histogram [6, 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-31 09:08:09,741 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-31 09:08:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash -365635734, now seen corresponding path program 1 times [2018-01-31 09:08:09,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:09,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:09,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:09,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:09,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 09:08:09,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:09,874 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-31 09:08:09,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:09,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-31 09:08:09,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:08:09,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-01-31 09:08:09,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:08:09,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:08:09,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:08:09,957 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 6 states. [2018-01-31 09:08:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:10,051 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-01-31 09:08:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:08:10,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-01-31 09:08:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:10,052 INFO L225 Difference]: With dead ends: 179 [2018-01-31 09:08:10,052 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 09:08:10,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 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-31 09:08:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 09:08:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2018-01-31 09:08:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 09:08:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 09:08:10,057 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 115 [2018-01-31 09:08:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:10,057 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 09:08:10,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:08:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 09:08:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-01-31 09:08:10,058 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:10,058 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-31 09:08:10,059 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-31 09:08:10,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1829682989, now seen corresponding path program 1 times [2018-01-31 09:08:10,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:10,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:10,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:10,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:10,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:10,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-31 09:08:10,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:10,162 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:10,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:10,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-01-31 09:08:10,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:10,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-31 09:08:10,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:08:10,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:08:10,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:08:10,445 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 10 states. [2018-01-31 09:08:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:10,617 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-01-31 09:08:10,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:08:10,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2018-01-31 09:08:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:10,618 INFO L225 Difference]: With dead ends: 206 [2018-01-31 09:08:10,619 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 09:08:10,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 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-31 09:08:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 09:08:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-01-31 09:08:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-31 09:08:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-31 09:08:10,624 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 156 [2018-01-31 09:08:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:10,624 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-31 09:08:10,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:08:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-31 09:08:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-31 09:08:10,626 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:10,626 INFO L351 BasicCegarLoop]: trace histogram [9, 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, 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-31 09:08:10,626 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-31 09:08:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1061902835, now seen corresponding path program 2 times [2018-01-31 09:08:10,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:10,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:10,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:10,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:10,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:10,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-31 09:08:10,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:10,798 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-31 09:08:10,807 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:10,818 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:10,840 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:10,851 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:10,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-31 09:08:11,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:11,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-01-31 09:08:11,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:08:11,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:08:11,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:08:11,121 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 14 states. [2018-01-31 09:08:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:11,269 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-01-31 09:08:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:08:11,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2018-01-31 09:08:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:11,270 INFO L225 Difference]: With dead ends: 244 [2018-01-31 09:08:11,270 INFO L226 Difference]: Without dead ends: 161 [2018-01-31 09:08:11,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-01-31 09:08:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-31 09:08:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-01-31 09:08:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-31 09:08:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2018-01-31 09:08:11,275 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 172 [2018-01-31 09:08:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:11,276 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2018-01-31 09:08:11,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:08:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2018-01-31 09:08:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-01-31 09:08:11,277 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:11,278 INFO L351 BasicCegarLoop]: trace histogram [12, 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, 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-31 09:08:11,279 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-31 09:08:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1386807338, now seen corresponding path program 3 times [2018-01-31 09:08:11,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:11,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:11,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:11,280 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:11,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:11,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-01-31 09:08:11,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:11,526 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-31 09:08:11,531 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:08:11,541 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:11,547 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:11,553 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:11,564 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:11,565 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:11,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 238 proven. 12 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-01-31 09:08:11,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:11,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 09:08:11,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:08:11,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:08:11,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:08:11,634 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 9 states. [2018-01-31 09:08:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:11,719 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-01-31 09:08:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:08:11,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2018-01-31 09:08:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:11,720 INFO L225 Difference]: With dead ends: 218 [2018-01-31 09:08:11,720 INFO L226 Difference]: Without dead ends: 157 [2018-01-31 09:08:11,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:08:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-31 09:08:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2018-01-31 09:08:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 09:08:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-01-31 09:08:11,727 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 213 [2018-01-31 09:08:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:11,729 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-01-31 09:08:11,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:08:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-01-31 09:08:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-01-31 09:08:11,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:11,730 INFO L351 BasicCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:08:11,730 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-31 09:08:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash 670583251, now seen corresponding path program 4 times [2018-01-31 09:08:11,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:11,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:11,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:11,731 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:11,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:11,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-31 09:08:11,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:11,966 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-31 09:08:11,971 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:08:12,007 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:12,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-31 09:08:12,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:12,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-01-31 09:08:12,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:08:12,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:08:12,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:08:12,098 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 13 states. [2018-01-31 09:08:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:12,214 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-31 09:08:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:08:12,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 221 [2018-01-31 09:08:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:12,221 INFO L225 Difference]: With dead ends: 266 [2018-01-31 09:08:12,221 INFO L226 Difference]: Without dead ends: 160 [2018-01-31 09:08:12,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 220 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-31 09:08:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-31 09:08:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-01-31 09:08:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-31 09:08:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-01-31 09:08:12,231 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 221 [2018-01-31 09:08:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:12,232 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-01-31 09:08:12,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:08:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-01-31 09:08:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-01-31 09:08:12,233 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:12,233 INFO L351 BasicCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:08:12,233 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-31 09:08:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash 71674890, now seen corresponding path program 5 times [2018-01-31 09:08:12,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:12,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:12,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:12,234 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:12,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:12,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2018-01-31 09:08:12,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:12,361 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-31 09:08:12,366 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:08:12,376 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:12,379 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:12,387 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:12,395 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:12,396 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:12,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 232 proven. 39 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2018-01-31 09:08:12,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:12,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-31 09:08:12,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:08:12,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:08:12,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:08:12,445 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 11 states. [2018-01-31 09:08:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:12,535 INFO L93 Difference]: Finished difference Result 292 states and 310 transitions. [2018-01-31 09:08:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:08:12,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 229 [2018-01-31 09:08:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:12,547 INFO L225 Difference]: With dead ends: 292 [2018-01-31 09:08:12,548 INFO L226 Difference]: Without dead ends: 187 [2018-01-31 09:08:12,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 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-31 09:08:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-31 09:08:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2018-01-31 09:08:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-31 09:08:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 183 transitions. [2018-01-31 09:08:12,552 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 183 transitions. Word has length 229 [2018-01-31 09:08:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:12,552 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 183 transitions. [2018-01-31 09:08:12,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:08:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 183 transitions. [2018-01-31 09:08:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-01-31 09:08:12,554 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:12,554 INFO L351 BasicCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:08:12,554 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-31 09:08:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1042543446, now seen corresponding path program 6 times [2018-01-31 09:08:12,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:12,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:12,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:12,555 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:12,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:12,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-01-31 09:08:12,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:12,717 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-31 09:08:12,722 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:08:12,733 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,734 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,745 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,750 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,758 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,775 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,791 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:12,797 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:12,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 628 proven. 74 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-01-31 09:08:12,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:12,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 15 [2018-01-31 09:08:12,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:08:12,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:08:12,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:08:12,878 INFO L87 Difference]: Start difference. First operand 175 states and 183 transitions. Second operand 15 states. [2018-01-31 09:08:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:13,069 INFO L93 Difference]: Finished difference Result 310 states and 329 transitions. [2018-01-31 09:08:13,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:08:13,069 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 262 [2018-01-31 09:08:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:13,070 INFO L225 Difference]: With dead ends: 310 [2018-01-31 09:08:13,070 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 09:08:13,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:08:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 09:08:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-01-31 09:08:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-31 09:08:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 199 transitions. [2018-01-31 09:08:13,075 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 199 transitions. Word has length 262 [2018-01-31 09:08:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:13,075 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 199 transitions. [2018-01-31 09:08:13,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:08:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 199 transitions. [2018-01-31 09:08:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-01-31 09:08:13,077 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:13,077 INFO L351 BasicCegarLoop]: trace histogram [18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:08:13,077 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-31 09:08:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1817536630, now seen corresponding path program 7 times [2018-01-31 09:08:13,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:13,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:13,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:13,078 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:13,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:13,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1389 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1359 trivial. 0 not checked. [2018-01-31 09:08:13,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:13,246 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-31 09:08:13,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:13,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1389 backedges. 606 proven. 30 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-01-31 09:08:13,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:13,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-31 09:08:13,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:08:13,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:08:13,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:08:13,605 INFO L87 Difference]: Start difference. First operand 190 states and 199 transitions. Second operand 11 states. [2018-01-31 09:08:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:13,747 INFO L93 Difference]: Finished difference Result 289 states and 304 transitions. [2018-01-31 09:08:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:08:13,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 295 [2018-01-31 09:08:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:13,749 INFO L225 Difference]: With dead ends: 289 [2018-01-31 09:08:13,749 INFO L226 Difference]: Without dead ends: 198 [2018-01-31 09:08:13,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:08:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-31 09:08:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-01-31 09:08:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-31 09:08:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 207 transitions. [2018-01-31 09:08:13,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 207 transitions. Word has length 295 [2018-01-31 09:08:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:13,753 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 207 transitions. [2018-01-31 09:08:13,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:08:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 207 transitions. [2018-01-31 09:08:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-31 09:08:13,754 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:13,754 INFO L351 BasicCegarLoop]: trace histogram [18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:08:13,754 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-31 09:08:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -214455181, now seen corresponding path program 8 times [2018-01-31 09:08:13,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:13,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:13,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:13,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:13,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:13,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-01-31 09:08:15,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:15,419 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-31 09:08:15,424 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:15,436 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:15,466 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:15,507 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:15,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 108 proven. 1080 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-01-31 09:08:16,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:16,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 40] total 46 [2018-01-31 09:08:16,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 09:08:16,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 09:08:16,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1947, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 09:08:16,823 INFO L87 Difference]: Start difference. First operand 198 states and 207 transitions. Second operand 46 states. [2018-01-31 09:08:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:17,670 INFO L93 Difference]: Finished difference Result 385 states and 407 transitions. [2018-01-31 09:08:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 09:08:17,670 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 303 [2018-01-31 09:08:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:17,673 INFO L225 Difference]: With dead ends: 385 [2018-01-31 09:08:17,673 INFO L226 Difference]: Without dead ends: 379 [2018-01-31 09:08:17,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=253, Invalid=4439, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 09:08:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-01-31 09:08:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 304. [2018-01-31 09:08:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-31 09:08:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 324 transitions. [2018-01-31 09:08:17,686 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 324 transitions. Word has length 303 [2018-01-31 09:08:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:17,686 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 324 transitions. [2018-01-31 09:08:17,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 09:08:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 324 transitions. [2018-01-31 09:08:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-31 09:08:17,688 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:17,688 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:17,688 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-31 09:08:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 576755629, now seen corresponding path program 1 times [2018-01-31 09:08:17,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:17,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:17,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,689 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:17,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:17,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:18,765 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 25 DAG size of output 15 [2018-01-31 09:08:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 606 proven. 378 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-01-31 09:08:19,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:19,258 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-31 09:08:19,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:19,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:19,425 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 23 treesize of output 17 [2018-01-31 09:08:19,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-31 09:08:19,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2018-01-31 09:08:19,468 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-31 09:08:19,481 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-31 09:08:19,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,563 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-31 09:08:19,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-01-31 09:08:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 591 proven. 399 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-01-31 09:08:20,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:20,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 38 [2018-01-31 09:08:20,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 09:08:20,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 09:08:20,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 09:08:20,429 INFO L87 Difference]: Start difference. First operand 304 states and 324 transitions. Second operand 38 states. [2018-01-31 09:08:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:24,926 INFO L93 Difference]: Finished difference Result 749 states and 809 transitions. [2018-01-31 09:08:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-01-31 09:08:24,926 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 303 [2018-01-31 09:08:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:24,929 INFO L225 Difference]: With dead ends: 749 [2018-01-31 09:08:24,929 INFO L226 Difference]: Without dead ends: 689 [2018-01-31 09:08:24,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 294 SyntacticMatches, 11 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5272 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2367, Invalid=12639, Unknown=0, NotChecked=0, Total=15006 [2018-01-31 09:08:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-01-31 09:08:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 546. [2018-01-31 09:08:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-01-31 09:08:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 584 transitions. [2018-01-31 09:08:24,946 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 584 transitions. Word has length 303 [2018-01-31 09:08:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:24,946 INFO L432 AbstractCegarLoop]: Abstraction has 546 states and 584 transitions. [2018-01-31 09:08:24,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-31 09:08:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 584 transitions. [2018-01-31 09:08:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-31 09:08:24,948 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:24,948 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:24,948 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-31 09:08:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash 203249913, now seen corresponding path program 2 times [2018-01-31 09:08:24,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:24,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:24,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:24,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:24,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:25,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:26,016 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 9 DAG size of output 7 [2018-01-31 09:08:26,218 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 11 DAG size of output 7 [2018-01-31 09:08:26,437 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 11 DAG size of output 7 [2018-01-31 09:08:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 767 proven. 346 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-01-31 09:08:27,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:27,977 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:27,981 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:27,999 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:28,022 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:28,034 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:28,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:28,220 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-31 09:08:28,221 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-31 09:08:28,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,224 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-31 09:08:28,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-01-31 09:08:28,620 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 35 treesize of output 28 [2018-01-31 09:08:28,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:28,624 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 28 treesize of output 39 [2018-01-31 09:08:28,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,632 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-31 09:08:28,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-01-31 09:08:28,634 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-31 09:08:28,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:28,637 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 30 treesize of output 43 [2018-01-31 09:08:28,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,643 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-31 09:08:28,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-01-31 09:08:28,723 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 39 treesize of output 32 [2018-01-31 09:08:28,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:28,725 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 32 treesize of output 47 [2018-01-31 09:08:28,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,733 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-31 09:08:28,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-31 09:08:28,779 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 39 treesize of output 32 [2018-01-31 09:08:28,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:28,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 47 [2018-01-31 09:08:28,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:28,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-31 09:08:28,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-31 09:08:29,025 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 39 treesize of output 32 [2018-01-31 09:08:29,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:29,029 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 32 treesize of output 47 [2018-01-31 09:08:29,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,037 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-31 09:08:29,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-31 09:08:29,153 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 43 treesize of output 34 [2018-01-31 09:08:29,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:08:29,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:29,155 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 34 treesize of output 52 [2018-01-31 09:08:29,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-01-31 09:08:29,205 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 48 treesize of output 37 [2018-01-31 09:08:29,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:29,212 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 37 treesize of output 34 [2018-01-31 09:08:29,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,219 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-31 09:08:29,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2018-01-31 09:08:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 40 proven. 1196 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-31 09:08:30,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:30,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 49] total 84 [2018-01-31 09:08:30,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-01-31 09:08:30,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-01-31 09:08:30,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=6324, Unknown=0, NotChecked=0, Total=6972 [2018-01-31 09:08:30,426 INFO L87 Difference]: Start difference. First operand 546 states and 584 transitions. Second operand 84 states. [2018-01-31 09:08:46,695 WARN L146 SmtUtils]: Spent 2052ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-01-31 09:08:50,053 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 116 DAG size of output 81 [2018-01-31 09:08:51,500 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 124 DAG size of output 81 [2018-01-31 09:09:01,504 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 119 DAG size of output 84 [2018-01-31 09:09:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:09:05,821 INFO L93 Difference]: Finished difference Result 2991 states and 3248 transitions. [2018-01-31 09:09:05,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2018-01-31 09:09:05,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 303 [2018-01-31 09:09:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:09:05,826 INFO L225 Difference]: With dead ends: 2991 [2018-01-31 09:09:05,826 INFO L226 Difference]: Without dead ends: 2260 [2018-01-31 09:09:05,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 257 SyntacticMatches, 12 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100135 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=16139, Invalid=221517, Unknown=0, NotChecked=0, Total=237656 [2018-01-31 09:09:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2018-01-31 09:09:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1123. [2018-01-31 09:09:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-01-31 09:09:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1205 transitions. [2018-01-31 09:09:05,876 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1205 transitions. Word has length 303 [2018-01-31 09:09:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:09:05,877 INFO L432 AbstractCegarLoop]: Abstraction has 1123 states and 1205 transitions. [2018-01-31 09:09:05,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-01-31 09:09:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1205 transitions. [2018-01-31 09:09:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-31 09:09:05,879 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:09:05,879 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:09:05,879 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-31 09:09:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 726339629, now seen corresponding path program 3 times [2018-01-31 09:09:05,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:09:05,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:09:05,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:09:05,880 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:09:05,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:09:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:09:05,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:09:07,388 WARN L146 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 21 DAG size of output 12 [2018-01-31 09:09:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 773 proven. 330 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-01-31 09:09:08,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:09:08,618 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:09:08,623 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:09:08,634 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,638 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,647 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,656 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,675 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,710 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:09:08,714 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:09:08,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:09:08,744 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 24 treesize of output 21 [2018-01-31 09:09:08,745 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-31 09:09:08,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:08,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:08,750 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 22 treesize of output 19 [2018-01-31 09:09:08,752 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-31 09:09:08,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:08,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:08,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:08,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:17 [2018-01-31 09:09:09,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 35 treesize of output 28 [2018-01-31 09:09:09,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:09,107 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 28 treesize of output 39 [2018-01-31 09:09:09,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,114 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-31 09:09:09,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-01-31 09:09:09,135 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-31 09:09:09,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:09,168 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 30 treesize of output 43 [2018-01-31 09:09:09,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,176 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-31 09:09:09,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-01-31 09:09:09,701 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 39 treesize of output 32 [2018-01-31 09:09:09,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:09,704 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 32 treesize of output 47 [2018-01-31 09:09:09,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,721 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-31 09:09:09,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-01-31 09:09:09,724 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 39 treesize of output 32 [2018-01-31 09:09:09,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-01-31 09:09:09,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:09:09,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:09,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:09,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:43 [2018-01-31 09:09:09,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 33 treesize of output 28 [2018-01-31 09:09:09,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:09,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-31 09:09:09,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:09,960 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 51 treesize of output 42 [2018-01-31 09:09:09,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:09,969 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 3 case distinctions, treesize of input 39 treesize of output 64 [2018-01-31 09:09:09,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 09:09:09,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:09,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-31 09:09:09,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:112 [2018-01-31 09:09:10,241 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 59 treesize of output 48 [2018-01-31 09:09:10,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:10,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:10,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 96 [2018-01-31 09:09:10,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-31 09:09:10,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:10,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:09:10,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:86 [2018-01-31 09:09:10,518 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 43 treesize of output 36 [2018-01-31 09:09:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:09:10,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-01-31 09:09:10,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:09:10,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:09:10,537 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-31 09:09:10,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:23 [2018-01-31 09:09:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 274 proven. 928 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-01-31 09:09:11,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:09:11,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 51] total 85 [2018-01-31 09:09:11,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-01-31 09:09:11,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-01-31 09:09:11,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=6765, Unknown=0, NotChecked=0, Total=7140 [2018-01-31 09:09:11,594 INFO L87 Difference]: Start difference. First operand 1123 states and 1205 transitions. Second operand 85 states. [2018-01-31 09:09:15,049 WARN L146 SmtUtils]: Spent 2097ms on a formula simplification. DAG size of input: 92 DAG size of output 85 [2018-01-31 09:09:31,944 WARN L146 SmtUtils]: Spent 2098ms on a formula simplification. DAG size of input: 119 DAG size of output 83 [2018-01-31 09:09:34,107 WARN L146 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 115 DAG size of output 94 [2018-01-31 09:09:36,238 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 105 DAG size of output 70 [2018-01-31 09:09:36,804 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 86 DAG size of output 57 [2018-01-31 09:09:38,566 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 140 DAG size of output 94 [2018-01-31 09:09:40,329 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 122 DAG size of output 72 [2018-01-31 09:09:41,723 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 153 DAG size of output 103 [2018-01-31 09:09:48,080 WARN L146 SmtUtils]: Spent 2097ms on a formula simplification. DAG size of input: 106 DAG size of output 83 [2018-01-31 09:10:21,994 WARN L146 SmtUtils]: Spent 2055ms on a formula simplification. DAG size of input: 124 DAG size of output 53 [2018-01-31 09:10:22,205 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 130 DAG size of output 60 [2018-01-31 09:10:26,896 WARN L146 SmtUtils]: Spent 2082ms on a formula simplification. DAG size of input: 105 DAG size of output 75 [2018-01-31 09:10:33,046 WARN L146 SmtUtils]: Spent 1092ms on a formula simplification. DAG size of input: 75 DAG size of output 57 [2018-01-31 09:10:36,413 WARN L146 SmtUtils]: Spent 2200ms on a formula simplification. DAG size of input: 91 DAG size of output 61 [2018-01-31 09:10:44,443 WARN L146 SmtUtils]: Spent 5846ms on a formula simplification. DAG size of input: 98 DAG size of output 63 [2018-01-31 09:10:48,083 WARN L146 SmtUtils]: Spent 3590ms on a formula simplification. DAG size of input: 100 DAG size of output 53 [2018-01-31 09:10:49,106 WARN L146 SmtUtils]: Spent 916ms on a formula simplification. DAG size of input: 100 DAG size of output 64 Received shutdown request... [2018-01-31 09:10:51,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2018-01-31 09:10:51,238 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:10:51,241 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:10:51,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:10:51 BoogieIcfgContainer [2018-01-31 09:10:51,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:10:51,241 INFO L168 Benchmark]: Toolchain (without parser) took 163025.24 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 984.6 MB). Free memory was 117.1 MB in the beginning and 746.0 MB in the end (delta: -628.8 MB). Peak memory consumption was 355.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:51,242 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 152.0 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:10:51,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 114.74 ms. Allocated memory is still 152.0 MB. Free memory was 116.9 MB in the beginning and 108.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:51,242 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 152.0 MB. Free memory was 108.3 MB in the beginning and 106.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:51,243 INFO L168 Benchmark]: RCFGBuilder took 439.81 ms. Allocated memory is still 152.0 MB. Free memory was 106.5 MB in the beginning and 87.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:51,243 INFO L168 Benchmark]: TraceAbstraction took 162448.75 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 984.6 MB). Free memory was 86.8 MB in the beginning and 746.0 MB in the end (delta: -659.2 MB). Peak memory consumption was 325.4 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:51,243 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 152.0 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 114.74 ms. Allocated memory is still 152.0 MB. Free memory was 116.9 MB in the beginning and 108.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.80 ms. Allocated memory is still 152.0 MB. Free memory was 108.3 MB in the beginning and 106.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 439.81 ms. Allocated memory is still 152.0 MB. Free memory was 106.5 MB in the beginning and 87.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 162448.75 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 984.6 MB). Free memory was 86.8 MB in the beginning and 746.0 MB in the end (delta: -659.2 MB). Peak memory consumption was 325.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 42). Cancelled while BasicCegarLoop was constructing difference of abstraction (1123states) and interpolant automaton (currently 251 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 327 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 83 locations, 1 error locations. TIMEOUT Result, 162.4s OverallTime, 15 OverallIterations, 18 TraceHistogramMax, 141.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1796 SDtfs, 3839 SDslu, 32935 SDs, 0 SdLazy, 24223 SolverSat, 661 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 40.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4008 GetRequests, 2817 SyntacticMatches, 59 SemanticMatches, 1131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149998 ImplicationChecksByTransitivity, 110.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1438 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 6025 NumberOfCodeBlocks, 5873 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5997 ConstructedInterpolants, 332 QuantifiedInterpolants, 10739957 SizeOfPredicates, 232 NumberOfNonLiveVariables, 4687 ConjunctsInSsa, 431 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 13319/20321 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/sep05_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-10-51-247.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-10-51-247.csv Completed graceful shutdown