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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:57:26,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:57:26,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:57:26,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:57:26,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:57:26,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:57:26,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:57:26,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:57:26,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:57:26,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:57:26,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:57:26,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:57:26,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:57:26,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:57:26,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:57:26,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:57:26,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:57:26,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:57:26,317 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:57:26,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:57:26,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:57:26,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:57:26,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:57:26,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:57:26,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:57:26,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:57:26,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:57:26,325 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:57:26,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:57:26,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:57:26,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:57:26,326 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 21:57:26,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:57:26,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:57:26,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:57:26,337 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:57:26,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:57:26,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:57:26,338 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:57:26,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:57:26,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:57:26,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:57:26,339 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:57:26,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:57:26,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:57:26,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:57:26,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:57:26,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:57:26,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:57:26,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:57:26,342 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:57:26,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:57:26,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:57:26,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:57:26,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:57:26,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:57:26,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:57:26,345 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:57:26,345 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:57:26,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:57:26,391 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:57:26,395 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:57:26,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:57:26,397 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:57:26,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-20 21:57:26,584 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:57:26,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:57:26,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:57:26,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:57:26,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:57:26,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfb951b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26, skipping insertion in model container [2018-01-20 21:57:26,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,640 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:57:26,678 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:57:26,801 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:57:26,822 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:57:26,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26 WrapperNode [2018-01-20 21:57:26,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:57:26,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:57:26,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:57:26,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:57:26,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... [2018-01-20 21:57:26,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:57:26,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:57:26,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:57:26,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:57:26,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (1/1) ... No working directory specified, using /storage/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-20 21:57:26,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:57:26,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:57:26,913 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-20 21:57:26,913 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-20 21:57:26,913 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-20 21:57:26,914 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-20 21:57:26,914 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-20 21:57:26,914 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-20 21:57:26,915 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-20 21:57:26,915 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-20 21:57:26,915 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:57:26,915 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:57:26,915 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:57:27,105 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:57:27,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:27 BoogieIcfgContainer [2018-01-20 21:57:27,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:57:27,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:57:27,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:57:27,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:57:27,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:57:26" (1/3) ... [2018-01-20 21:57:27,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6160c8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:27, skipping insertion in model container [2018-01-20 21:57:27,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:57:26" (2/3) ... [2018-01-20 21:57:27,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6160c8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:27, skipping insertion in model container [2018-01-20 21:57:27,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:27" (3/3) ... [2018-01-20 21:57:27,111 INFO L105 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-01-20 21:57:27,118 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:57:27,124 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-20 21:57:27,158 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:27,158 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:27,158 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:27,159 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:27,159 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:27,159 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:27,159 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:27,159 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Sum2Err0EnsuresViolation======== [2018-01-20 21:57:27,160 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:57:27,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,192 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:27,192 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err0EnsuresViolation]=== [2018-01-20 21:57:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1865297126, now seen corresponding path program 1 times [2018-01-20 21:57:27,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:27,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:27,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:27,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:57:27,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:57:27,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:57:27,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:57:27,384 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-20 21:57:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:27,479 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-20 21:57:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:57:27,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-20 21:57:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:27,485 INFO L225 Difference]: With dead ends: 88 [2018-01-20 21:57:27,486 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:57:27,488 INFO L525 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-20 21:57:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:57:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:57:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:57:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:57:27,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-20 21:57:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:27,508 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:57:27,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:57:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:57:27,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:57:27,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 21:57:27,559 INFO L401 ceAbstractionStarter]: For program point Sum2FINAL(lines 658 666) no Hoare annotation was computed. [2018-01-20 21:57:27,559 INFO L401 ceAbstractionStarter]: For program point Sum2Err0EnsuresViolation(line 657) no Hoare annotation was computed. [2018-01-20 21:57:27,559 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-20 21:57:27,559 INFO L404 ceAbstractionStarter]: At program point L662''''(lines 662 664) the Hoare annotation is: true [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point L662'''''(lines 662 664) no Hoare annotation was computed. [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point L662'''(lines 662 664) no Hoare annotation was computed. [2018-01-20 21:57:27,560 INFO L404 ceAbstractionStarter]: At program point Sum2ENTRY(lines 658 666) the Hoare annotation is: true [2018-01-20 21:57:27,560 INFO L401 ceAbstractionStarter]: For program point Sum2EXIT(lines 658 666) no Hoare annotation was computed. [2018-01-20 21:57:27,561 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,561 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,561 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 686) the Hoare annotation is: true [2018-01-20 21:57:27,561 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,561 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-20 21:57:27,561 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 21:57:27,562 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-20 21:57:27,562 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-20 21:57:27,562 INFO L404 ceAbstractionStarter]: At program point dummy_abortFINAL(lines 667 669) the Hoare annotation is: true [2018-01-20 21:57:27,562 INFO L401 ceAbstractionStarter]: For program point dummy_abortEXIT(lines 667 669) no Hoare annotation was computed. [2018-01-20 21:57:27,562 INFO L401 ceAbstractionStarter]: For program point dummy_abortErr0EnsuresViolation(lines 667 669) no Hoare annotation was computed. [2018-01-20 21:57:27,562 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 686) the Hoare annotation is: true [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,563 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 686) the Hoare annotation is: true [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point L652'''(lines 652 654) no Hoare annotation was computed. [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-20 21:57:27,563 INFO L401 ceAbstractionStarter]: For program point L652'''''(lines 652 654) no Hoare annotation was computed. [2018-01-20 21:57:27,564 INFO L401 ceAbstractionStarter]: For program point SumEXIT(lines 648 656) no Hoare annotation was computed. [2018-01-20 21:57:27,564 INFO L401 ceAbstractionStarter]: For program point L652'(line 652) no Hoare annotation was computed. [2018-01-20 21:57:27,564 INFO L404 ceAbstractionStarter]: At program point L652''''(lines 652 654) the Hoare annotation is: true [2018-01-20 21:57:27,564 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-20 21:57:27,564 INFO L404 ceAbstractionStarter]: At program point SumENTRY(lines 648 656) the Hoare annotation is: true [2018-01-20 21:57:27,564 INFO L401 ceAbstractionStarter]: For program point SumErr0EnsuresViolation(line 647) no Hoare annotation was computed. [2018-01-20 21:57:27,565 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-20 21:57:27,565 INFO L401 ceAbstractionStarter]: For program point SumFINAL(lines 648 656) no Hoare annotation was computed. [2018-01-20 21:57:27,565 INFO L404 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: true [2018-01-20 21:57:27,565 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-20 21:57:27,565 INFO L404 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: true [2018-01-20 21:57:27,565 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-20 21:57:27,565 INFO L401 ceAbstractionStarter]: For program point L682''(lines 682 683) no Hoare annotation was computed. [2018-01-20 21:57:27,566 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-20 21:57:27,566 INFO L401 ceAbstractionStarter]: For program point L682'(lines 682 683) no Hoare annotation was computed. [2018-01-20 21:57:27,566 INFO L404 ceAbstractionStarter]: At program point L680'(lines 680 681) the Hoare annotation is: true [2018-01-20 21:57:27,566 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 670 686) no Hoare annotation was computed. [2018-01-20 21:57:27,566 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-20 21:57:27,566 INFO L401 ceAbstractionStarter]: For program point L673(line 673) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L404 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: true [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point L678(line 678) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 670 686) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point L673'(line 673) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point L677(line 677) no Hoare annotation was computed. [2018-01-20 21:57:27,567 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-20 21:57:27,568 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-20 21:57:27,568 INFO L404 ceAbstractionStarter]: At program point L679(line 679) the Hoare annotation is: true [2018-01-20 21:57:27,568 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 670 686) no Hoare annotation was computed. [2018-01-20 21:57:27,568 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 670 686) the Hoare annotation is: true [2018-01-20 21:57:27,572 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:27,572 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:27,572 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:27,573 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:27,573 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:27,573 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:27,573 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:27,573 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:57:27,573 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:57:27,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,576 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:57:27,576 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:57:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash 128549, now seen corresponding path program 1 times [2018-01-20 21:57:27,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:57:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:57:27,608 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:57:27,612 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:57:27,616 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:27,616 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:27,616 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:27,616 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:27,616 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:27,616 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:27,616 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:27,616 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == dummy_abortErr0EnsuresViolation======== [2018-01-20 21:57:27,616 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 21:57:27,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:27,619 INFO L371 AbstractCegarLoop]: === Iteration 1 === [dummy_abortErr0EnsuresViolation]=== [2018-01-20 21:57:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1195103445, now seen corresponding path program 1 times [2018-01-20 21:57:27,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:27,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:27,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:27,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:57:27,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:57:27,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:57:27,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:57:27,665 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-20 21:57:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:27,673 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-20 21:57:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:57:27,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-20 21:57:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:27,674 INFO L225 Difference]: With dead ends: 88 [2018-01-20 21:57:27,674 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:57:27,675 INFO L525 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-20 21:57:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:57:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:57:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:57:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:57:27,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-20 21:57:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:27,676 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:57:27,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:57:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:57:27,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:57:27,678 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:27,679 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:27,679 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:27,679 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:27,679 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:27,679 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:27,679 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:27,679 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:57:27,680 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 21:57:27,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,684 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:27,684 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:57:27,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1502761729, now seen corresponding path program 1 times [2018-01-20 21:57:27,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:27,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:27,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:27,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:57:27,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:57:27,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:57:27,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:57:27,726 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-20 21:57:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:27,734 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-20 21:57:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:57:27,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-20 21:57:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:27,738 INFO L225 Difference]: With dead ends: 88 [2018-01-20 21:57:27,738 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 21:57:27,739 INFO L525 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-20 21:57:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 21:57:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 21:57:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 21:57:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-20 21:57:27,757 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-01-20 21:57:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:27,758 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-20 21:57:27,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:57:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-20 21:57:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-20 21:57:27,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,760 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:27,760 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:57:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -809322687, now seen corresponding path program 1 times [2018-01-20 21:57:27,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:27,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:27,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:27,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:57:27,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:57:27,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:57:27,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:57:27,865 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-20 21:57:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:27,936 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-20 21:57:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:57:27,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-20 21:57:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:27,939 INFO L225 Difference]: With dead ends: 69 [2018-01-20 21:57:27,939 INFO L226 Difference]: Without dead ends: 64 [2018-01-20 21:57:27,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:57:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-20 21:57:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-20 21:57:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-20 21:57:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-20 21:57:27,949 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 43 [2018-01-20 21:57:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:27,949 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-20 21:57:27,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:57:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-20 21:57:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 21:57:27,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:27,951 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:27,951 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:57:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2078335056, now seen corresponding path program 1 times [2018-01-20 21:57:27,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:27,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:27,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:27,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:27,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:28,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:57:28,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:57:28,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:57:28,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:57:28,033 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-20 21:57:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,137 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-20 21:57:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:57:28,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-20 21:57:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,138 INFO L225 Difference]: With dead ends: 62 [2018-01-20 21:57:28,138 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:57:28,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:57:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:57:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:57:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:57:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:57:28,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-20 21:57:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,140 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:57:28,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:57:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:57:28,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:57:28,142 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:28,143 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:28,143 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:28,143 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:28,143 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:28,143 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:28,143 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:28,143 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == SumErr0EnsuresViolation======== [2018-01-20 21:57:28,143 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 21:57:28,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,146 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SumErr0EnsuresViolation]=== [2018-01-20 21:57:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash 112235281, now seen corresponding path program 1 times [2018-01-20 21:57:28,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:28,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:57:28,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:57:28,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:57:28,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:57:28,174 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-20 21:57:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,180 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-20 21:57:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:57:28,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-20 21:57:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,181 INFO L225 Difference]: With dead ends: 88 [2018-01-20 21:57:28,181 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:57:28,182 INFO L525 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-20 21:57:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:57:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:57:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:57:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:57:28,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 21:57:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,183 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:57:28,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:57:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:57:28,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:57:28,185 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:57:28,185 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:57:28,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:57:28,186 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:57:28,186 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:57:28,186 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:57:28,186 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:57:28,186 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:57:28,186 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:57:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-20 21:57:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:57:28,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,190 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,190 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2005137936, now seen corresponding path program 1 times [2018-01-20 21:57:28,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:28,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:57:28,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:57:28,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:57:28,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:57:28,218 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-20 21:57:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,223 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-20 21:57:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:57:28,223 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-20 21:57:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,225 INFO L225 Difference]: With dead ends: 88 [2018-01-20 21:57:28,225 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 21:57:28,226 INFO L525 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-20 21:57:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 21:57:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-20 21:57:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 21:57:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-20 21:57:28,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2018-01-20 21:57:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,233 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-20 21:57:28,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:57:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-20 21:57:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-20 21:57:28,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,235 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:28,235 INFO L82 PathProgramCache]: Analyzing trace with hash -336037328, now seen corresponding path program 1 times [2018-01-20 21:57:28,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:28,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:57:28,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:57:28,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:57:28,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:57:28,303 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-20 21:57:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,327 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-20 21:57:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:57:28,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-20 21:57:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,328 INFO L225 Difference]: With dead ends: 65 [2018-01-20 21:57:28,328 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 21:57:28,329 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:57:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 21:57:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-01-20 21:57:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-20 21:57:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-20 21:57:28,336 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2018-01-20 21:57:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,336 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-20 21:57:28,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:57:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-20 21:57:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 21:57:28,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,338 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,338 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 609983231, now seen corresponding path program 1 times [2018-01-20 21:57:28,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:57:28,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:57:28,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:57:28,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:57:28,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:57:28,393 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-01-20 21:57:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,469 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-20 21:57:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:57:28,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-20 21:57:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,472 INFO L225 Difference]: With dead ends: 96 [2018-01-20 21:57:28,472 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 21:57:28,472 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:57:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 21:57:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-01-20 21:57:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-20 21:57:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-20 21:57:28,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 44 [2018-01-20 21:57:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,480 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-20 21:57:28,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:57:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-20 21:57:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-20 21:57:28,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,482 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,482 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:28,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046266, now seen corresponding path program 1 times [2018-01-20 21:57:28,482 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:57:28,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:57:28,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 21:57:28,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 21:57:28,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 21:57:28,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:57:28,685 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-20 21:57:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:28,812 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-20 21:57:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 21:57:28,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-20 21:57:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:28,813 INFO L225 Difference]: With dead ends: 76 [2018-01-20 21:57:28,814 INFO L226 Difference]: Without dead ends: 65 [2018-01-20 21:57:28,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:57:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-20 21:57:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-01-20 21:57:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-20 21:57:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-20 21:57:28,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-20 21:57:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:28,821 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-20 21:57:28,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 21:57:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-20 21:57:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 21:57:28,822 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:28,822 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:28,822 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1025820889, now seen corresponding path program 1 times [2018-01-20 21:57:28,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:28,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:28,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:28,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:28,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:57:29,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:29,085 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:29,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:29,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 21:57:29,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 21:57:29,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-01-20 21:57:29,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 21:57:29,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 21:57:29,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:57:29,276 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 10 states. [2018-01-20 21:57:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:29,580 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-20 21:57:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 21:57:29,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-20 21:57:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:29,581 INFO L225 Difference]: With dead ends: 117 [2018-01-20 21:57:29,582 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 21:57:29,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:57:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 21:57:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-20 21:57:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-20 21:57:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-20 21:57:29,589 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 50 [2018-01-20 21:57:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:29,590 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-20 21:57:29,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 21:57:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-20 21:57:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 21:57:29,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:29,591 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:29,591 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -943664249, now seen corresponding path program 1 times [2018-01-20 21:57:29,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:29,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:29,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:29,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:29,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:29,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 21:57:29,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:29,831 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:29,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:29,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 21:57:29,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:29,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-01-20 21:57:29,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 21:57:29,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 21:57:29,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-20 21:57:29,908 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 12 states. [2018-01-20 21:57:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:30,103 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2018-01-20 21:57:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 21:57:30,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-01-20 21:57:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:30,104 INFO L225 Difference]: With dead ends: 120 [2018-01-20 21:57:30,104 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 21:57:30,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-20 21:57:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 21:57:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-20 21:57:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-20 21:57:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-20 21:57:30,111 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 54 [2018-01-20 21:57:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:30,111 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-20 21:57:30,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 21:57:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-20 21:57:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 21:57:30,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:30,112 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 21:57:30,112 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 551937012, now seen corresponding path program 2 times [2018-01-20 21:57:30,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:30,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:30,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:30,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:30,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:30,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-20 21:57:30,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:30,286 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:30,303 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:57:30,320 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:30,331 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:30,332 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:30,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-20 21:57:30,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:30,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-20 21:57:30,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 21:57:30,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 21:57:30,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:57:30,406 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 10 states. [2018-01-20 21:57:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:30,437 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-01-20 21:57:30,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 21:57:30,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-01-20 21:57:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:30,438 INFO L225 Difference]: With dead ends: 121 [2018-01-20 21:57:30,439 INFO L226 Difference]: Without dead ends: 67 [2018-01-20 21:57:30,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:57:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-20 21:57:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-20 21:57:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-20 21:57:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-20 21:57:30,447 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 61 [2018-01-20 21:57:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:30,447 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-20 21:57:30,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 21:57:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-20 21:57:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-20 21:57:30,448 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:30,448 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:30,448 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2066944597, now seen corresponding path program 3 times [2018-01-20 21:57:30,449 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:30,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:30,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:30,450 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:30,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:30,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-20 21:57:30,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:30,538 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:30,553 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 21:57:30,571 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:30,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:30,583 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:30,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:30,637 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 11 treesize of output 8 [2018-01-20 21:57:30,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 21:57:30,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 21:57:30,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 21:57:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-20 21:57:30,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 21:57:30,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-20 21:57:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-20 21:57:30,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 21:57:30,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 39 treesize of output 30 [2018-01-20 21:57:30,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-20 21:57:30,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-20 21:57:30,807 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-20 21:57:30,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-20 21:57:30,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-20 21:57:30,877 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 57 treesize of output 44 [2018-01-20 21:57:30,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-20 21:57:30,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:30,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-20 21:57:30,972 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 66 treesize of output 51 [2018-01-20 21:57:30,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:30,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-20 21:57:30,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:31,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:31,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:31,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-20 21:57:31,318 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:57:31,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:31,319 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-20 21:57:31,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:1 [2018-01-20 21:57:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 21:57:31,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:31,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16] total 21 [2018-01-20 21:57:31,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 21:57:31,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 21:57:31,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-01-20 21:57:31,359 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 21 states. [2018-01-20 21:57:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:31,887 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-20 21:57:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 21:57:31,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-01-20 21:57:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:31,888 INFO L225 Difference]: With dead ends: 134 [2018-01-20 21:57:31,888 INFO L226 Difference]: Without dead ends: 77 [2018-01-20 21:57:31,889 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 21:57:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-20 21:57:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-01-20 21:57:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-20 21:57:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-20 21:57:31,899 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 62 [2018-01-20 21:57:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:31,900 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-20 21:57:31,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 21:57:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-20 21:57:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-20 21:57:31,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:31,901 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-20 21:57:31,901 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2093908176, now seen corresponding path program 4 times [2018-01-20 21:57:31,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:31,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:31,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:31,902 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:31,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:31,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:32,099 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:32,105 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 21:57:32,126 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:32,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:32,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-20 21:57:32,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-20 21:57:32,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-20 21:57:32,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2018-01-20 21:57:32,181 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 14 states. [2018-01-20 21:57:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:32,207 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-20 21:57:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 21:57:32,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-01-20 21:57:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:32,208 INFO L225 Difference]: With dead ends: 135 [2018-01-20 21:57:32,208 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 21:57:32,209 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-01-20 21:57:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 21:57:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-20 21:57:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-20 21:57:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-20 21:57:32,218 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 69 [2018-01-20 21:57:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:32,218 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-20 21:57:32,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-20 21:57:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-20 21:57:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-20 21:57:32,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:32,219 INFO L322 BasicCegarLoop]: trace histogram [5, 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] [2018-01-20 21:57:32,220 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1961550311, now seen corresponding path program 5 times [2018-01-20 21:57:32,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:32,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:32,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:32,221 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:32,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:32,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:32,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:32,389 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 21:57:32,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:32,399 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:32,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:32,411 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:32,413 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:32,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:32,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-20 21:57:32,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 21:57:32,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 21:57:32,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-01-20 21:57:32,478 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 16 states. [2018-01-20 21:57:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:32,503 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-01-20 21:57:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:57:32,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-01-20 21:57:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:32,504 INFO L225 Difference]: With dead ends: 136 [2018-01-20 21:57:32,505 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 21:57:32,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2018-01-20 21:57:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 21:57:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-20 21:57:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-20 21:57:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-20 21:57:32,514 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 70 [2018-01-20 21:57:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:32,515 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-20 21:57:32,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 21:57:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-20 21:57:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 21:57:32,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:32,516 INFO L322 BasicCegarLoop]: trace histogram [6, 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] [2018-01-20 21:57:32,516 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1168255472, now seen corresponding path program 6 times [2018-01-20 21:57:32,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:32,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:32,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:32,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:32,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:32,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:32,779 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:32,784 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 21:57:32,799 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:32,807 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:32,815 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:32,854 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:32,856 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:32,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:32,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:32,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-20 21:57:32,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 21:57:32,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 21:57:32,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=184, Unknown=0, NotChecked=0, Total=306 [2018-01-20 21:57:32,961 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 18 states. [2018-01-20 21:57:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:33,017 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-01-20 21:57:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 21:57:33,020 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-01-20 21:57:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:33,021 INFO L225 Difference]: With dead ends: 137 [2018-01-20 21:57:33,021 INFO L226 Difference]: Without dead ends: 77 [2018-01-20 21:57:33,022 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2018-01-20 21:57:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-20 21:57:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-20 21:57:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-20 21:57:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-20 21:57:33,029 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 71 [2018-01-20 21:57:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:33,030 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-20 21:57:33,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 21:57:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-20 21:57:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-20 21:57:33,031 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:33,031 INFO L322 BasicCegarLoop]: trace histogram [7, 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] [2018-01-20 21:57:33,031 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash 592013063, now seen corresponding path program 7 times [2018-01-20 21:57:33,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:33,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:33,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,032 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:33,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:33,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:33,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:33,140 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:33,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:33,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:33,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:33,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-20 21:57:33,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 21:57:33,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 21:57:33,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=229, Unknown=0, NotChecked=0, Total=380 [2018-01-20 21:57:33,251 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 20 states. [2018-01-20 21:57:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:33,296 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-20 21:57:33,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 21:57:33,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-01-20 21:57:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:33,297 INFO L225 Difference]: With dead ends: 138 [2018-01-20 21:57:33,297 INFO L226 Difference]: Without dead ends: 78 [2018-01-20 21:57:33,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=257, Unknown=0, NotChecked=0, Total=420 [2018-01-20 21:57:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-20 21:57:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-20 21:57:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-20 21:57:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-20 21:57:33,305 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 72 [2018-01-20 21:57:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:33,306 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-20 21:57:33,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 21:57:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-20 21:57:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 21:57:33,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:33,307 INFO L322 BasicCegarLoop]: trace histogram [8, 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] [2018-01-20 21:57:33,307 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash -674237200, now seen corresponding path program 8 times [2018-01-20 21:57:33,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:33,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:33,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:33,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:33,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:33,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:33,425 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:33,430 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:57:33,443 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:33,456 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:33,469 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:33,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:33,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:33,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-20 21:57:33,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 21:57:33,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 21:57:33,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-01-20 21:57:33,568 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2018-01-20 21:57:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:33,611 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-20 21:57:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 21:57:33,613 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-20 21:57:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:33,614 INFO L225 Difference]: With dead ends: 139 [2018-01-20 21:57:33,614 INFO L226 Difference]: Without dead ends: 79 [2018-01-20 21:57:33,615 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2018-01-20 21:57:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-20 21:57:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-20 21:57:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 21:57:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-20 21:57:33,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 73 [2018-01-20 21:57:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:33,623 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-20 21:57:33,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 21:57:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-20 21:57:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 21:57:33,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:33,624 INFO L322 BasicCegarLoop]: trace histogram [9, 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] [2018-01-20 21:57:33,624 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1273289689, now seen corresponding path program 9 times [2018-01-20 21:57:33,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:33,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:33,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,626 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:33,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:33,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:33,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:33,741 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:33,746 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 21:57:33,759 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:33,768 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:33,782 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:33,783 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:33,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:33,813 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-20 21:57:33,815 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-20 21:57:33,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-20 21:57:33,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-20 21:57:33,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-20 21:57:33,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 21:57:33,858 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 32 treesize of output 25 [2018-01-20 21:57:33,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:33,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-01-20 21:57:33,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:33,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-20 21:57:34,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-01-20 21:57:34,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 8 [2018-01-20 21:57:34,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:34,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:34,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2018-01-20 21:57:34,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:34,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:34,209 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-20 21:57:34,209 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:3 [2018-01-20 21:57:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-20 21:57:34,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:34,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-01-20 21:57:34,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-20 21:57:34,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-20 21:57:34,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2018-01-20 21:57:34,273 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 27 states. [2018-01-20 21:57:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:34,908 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2018-01-20 21:57:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 21:57:34,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 74 [2018-01-20 21:57:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:34,909 INFO L225 Difference]: With dead ends: 153 [2018-01-20 21:57:34,909 INFO L226 Difference]: Without dead ends: 93 [2018-01-20 21:57:34,910 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 21:57:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-20 21:57:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-01-20 21:57:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-20 21:57:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-01-20 21:57:34,919 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 74 [2018-01-20 21:57:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:34,920 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-01-20 21:57:34,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-20 21:57:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-01-20 21:57:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-20 21:57:34,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:34,921 INFO L322 BasicCegarLoop]: trace histogram [10, 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] [2018-01-20 21:57:34,921 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1985959263, now seen corresponding path program 1 times [2018-01-20 21:57:34,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:34,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:34,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:34,922 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:34,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:34,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:35,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:35,064 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:35,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:35,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:35,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:35,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-20 21:57:35,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-20 21:57:35,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-20 21:57:35,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2018-01-20 21:57:35,213 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 26 states. [2018-01-20 21:57:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:35,265 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-01-20 21:57:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-20 21:57:35,265 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 78 [2018-01-20 21:57:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:35,266 INFO L225 Difference]: With dead ends: 163 [2018-01-20 21:57:35,266 INFO L226 Difference]: Without dead ends: 92 [2018-01-20 21:57:35,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=271, Invalid=431, Unknown=0, NotChecked=0, Total=702 [2018-01-20 21:57:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-20 21:57:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-20 21:57:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-20 21:57:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-20 21:57:35,275 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 78 [2018-01-20 21:57:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:35,275 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-20 21:57:35,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-20 21:57:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-20 21:57:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 21:57:35,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:35,276 INFO L322 BasicCegarLoop]: trace histogram [11, 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] [2018-01-20 21:57:35,277 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 580128904, now seen corresponding path program 2 times [2018-01-20 21:57:35,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:35,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:35,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:35,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:35,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:35,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:35,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:35,424 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:35,429 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:57:35,442 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:35,455 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:35,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:35,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:35,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:35,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-01-20 21:57:35,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-20 21:57:35,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-20 21:57:35,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2018-01-20 21:57:35,637 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 28 states. [2018-01-20 21:57:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:35,678 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-01-20 21:57:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 21:57:35,678 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-01-20 21:57:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:35,679 INFO L225 Difference]: With dead ends: 164 [2018-01-20 21:57:35,679 INFO L226 Difference]: Without dead ends: 93 [2018-01-20 21:57:35,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2018-01-20 21:57:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-20 21:57:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-20 21:57:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-20 21:57:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-20 21:57:35,685 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 79 [2018-01-20 21:57:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:35,686 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-20 21:57:35,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-20 21:57:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-20 21:57:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 21:57:35,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:35,687 INFO L322 BasicCegarLoop]: trace histogram [12, 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] [2018-01-20 21:57:35,687 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -50939265, now seen corresponding path program 3 times [2018-01-20 21:57:35,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:35,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:35,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:35,688 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:35,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:35,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 21:57:35,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:35,924 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-20 21:57:35,931 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 21:57:35,951 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:35,966 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:35,984 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:35,988 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:35,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:36,029 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 11 treesize of output 8 [2018-01-20 21:57:36,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 21:57:36,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 21:57:36,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 21:57:36,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-20 21:57:36,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 21:57:36,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-20 21:57:36,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-20 21:57:36,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 21:57:36,128 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 30 [2018-01-20 21:57:36,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-20 21:57:36,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-20 21:57:36,190 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-20 21:57:36,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-20 21:57:36,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-20 21:57:36,257 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 57 treesize of output 44 [2018-01-20 21:57:36,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-20 21:57:36,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-20 21:57:36,336 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 66 treesize of output 51 [2018-01-20 21:57:36,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:57:36,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-20 21:57:36,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-20 21:57:36,659 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:57:36,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:57:36,660 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-20 21:57:36,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:1 [2018-01-20 21:57:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-20 21:57:36,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:36,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-01-20 21:57:36,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-20 21:57:36,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-20 21:57:36,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-01-20 21:57:36,699 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 31 states. [2018-01-20 21:57:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:37,244 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-20 21:57:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-20 21:57:37,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2018-01-20 21:57:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:37,277 INFO L225 Difference]: With dead ends: 177 [2018-01-20 21:57:37,277 INFO L226 Difference]: Without dead ends: 103 [2018-01-20 21:57:37,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2018-01-20 21:57:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-20 21:57:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-01-20 21:57:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-20 21:57:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-20 21:57:37,286 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 80 [2018-01-20 21:57:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:37,286 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-20 21:57:37,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-20 21:57:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-20 21:57:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-20 21:57:37,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:37,287 INFO L322 BasicCegarLoop]: trace histogram [13, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:37,287 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1039900620, now seen corresponding path program 4 times [2018-01-20 21:57:37,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:37,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:37,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:37,288 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:37,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:37,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-20 21:57:37,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:37,543 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:37,550 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 21:57:37,573 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:37,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-20 21:57:37,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:37,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-01-20 21:57:37,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 21:57:37,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 21:57:37,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-01-20 21:57:37,793 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 29 states. [2018-01-20 21:57:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:47,480 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-01-20 21:57:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-20 21:57:47,480 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-01-20 21:57:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:47,481 INFO L225 Difference]: With dead ends: 179 [2018-01-20 21:57:47,481 INFO L226 Difference]: Without dead ends: 99 [2018-01-20 21:57:47,481 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-01-20 21:57:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-20 21:57:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-20 21:57:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-20 21:57:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-20 21:57:47,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 87 [2018-01-20 21:57:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:47,488 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-20 21:57:47,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 21:57:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-20 21:57:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-20 21:57:47,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:47,489 INFO L322 BasicCegarLoop]: trace histogram [14, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:47,489 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash -318786000, now seen corresponding path program 10 times [2018-01-20 21:57:47,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:47,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:47,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:47,490 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:47,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:47,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:47,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:47,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:47,698 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 21:57:47,788 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:47,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:47,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:47,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-01-20 21:57:47,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 21:57:47,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 21:57:47,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 21:57:47,920 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 34 states. [2018-01-20 21:57:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:47,975 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-01-20 21:57:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 21:57:47,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 91 [2018-01-20 21:57:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:47,977 INFO L225 Difference]: With dead ends: 169 [2018-01-20 21:57:47,977 INFO L226 Difference]: Without dead ends: 97 [2018-01-20 21:57:47,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=457, Invalid=733, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 21:57:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-20 21:57:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-20 21:57:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-20 21:57:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-20 21:57:47,986 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 91 [2018-01-20 21:57:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:47,986 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-20 21:57:47,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-20 21:57:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-20 21:57:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-20 21:57:47,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:47,987 INFO L322 BasicCegarLoop]: trace histogram [15, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:47,987 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash -468179545, now seen corresponding path program 11 times [2018-01-20 21:57:47,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:47,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:47,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:47,988 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:47,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:48,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:48,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:48,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:48,255 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 21:57:48,263 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,264 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,266 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,268 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,273 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,278 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,291 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,303 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,322 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:48,325 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:48,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:48,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:48,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-01-20 21:57:48,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 21:57:48,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 21:57:48,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2018-01-20 21:57:48,491 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 36 states. [2018-01-20 21:57:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:48,561 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2018-01-20 21:57:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-20 21:57:48,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2018-01-20 21:57:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:48,563 INFO L225 Difference]: With dead ends: 170 [2018-01-20 21:57:48,563 INFO L226 Difference]: Without dead ends: 98 [2018-01-20 21:57:48,564 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=511, Invalid=821, Unknown=0, NotChecked=0, Total=1332 [2018-01-20 21:57:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-20 21:57:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-20 21:57:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-20 21:57:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-20 21:57:48,574 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 92 [2018-01-20 21:57:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:48,574 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-20 21:57:48,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 21:57:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-20 21:57:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-20 21:57:48,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:48,576 INFO L322 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:48,576 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -804412144, now seen corresponding path program 12 times [2018-01-20 21:57:48,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:48,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:48,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:48,577 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:48,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:48,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:48,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:48,902 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:48,907 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 21:57:48,922 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:48,930 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:48,941 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:48,965 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,039 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,113 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,434 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,890 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:49,892 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:49,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:50,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:50,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-01-20 21:57:50,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-20 21:57:50,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-20 21:57:50,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2018-01-20 21:57:50,080 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 38 states. [2018-01-20 21:57:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:50,174 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-01-20 21:57:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 21:57:50,174 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 93 [2018-01-20 21:57:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:50,175 INFO L225 Difference]: With dead ends: 171 [2018-01-20 21:57:50,175 INFO L226 Difference]: Without dead ends: 99 [2018-01-20 21:57:50,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=568, Invalid=914, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 21:57:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-20 21:57:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-20 21:57:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-20 21:57:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-20 21:57:50,185 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 93 [2018-01-20 21:57:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:50,186 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-20 21:57:50,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-20 21:57:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-20 21:57:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-20 21:57:50,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:50,187 INFO L322 BasicCegarLoop]: trace histogram [17, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:50,187 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1657279175, now seen corresponding path program 13 times [2018-01-20 21:57:50,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:50,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:50,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:50,188 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:50,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:50,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:50,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:50,506 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:50,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:50,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:50,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:50,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-01-20 21:57:50,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 21:57:50,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 21:57:50,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 21:57:50,831 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 40 states. [2018-01-20 21:57:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:50,883 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2018-01-20 21:57:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-20 21:57:50,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 94 [2018-01-20 21:57:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:50,886 INFO L225 Difference]: With dead ends: 172 [2018-01-20 21:57:50,887 INFO L226 Difference]: Without dead ends: 100 [2018-01-20 21:57:50,887 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=628, Invalid=1012, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 21:57:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-20 21:57:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-20 21:57:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-20 21:57:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-01-20 21:57:50,897 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 94 [2018-01-20 21:57:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:50,897 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-01-20 21:57:50,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-20 21:57:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-01-20 21:57:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-20 21:57:50,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:50,898 INFO L322 BasicCegarLoop]: trace histogram [18, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:50,899 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 660298736, now seen corresponding path program 14 times [2018-01-20 21:57:50,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:50,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:50,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:50,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:57:50,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:50,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:51,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:51,393 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:51,399 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:57:51,419 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:51,445 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:51,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:51,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:51,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:51,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-01-20 21:57:51,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-20 21:57:51,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-20 21:57:51,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2018-01-20 21:57:51,886 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 42 states. [2018-01-20 21:57:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:51,937 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-01-20 21:57:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-20 21:57:51,937 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-01-20 21:57:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:51,938 INFO L225 Difference]: With dead ends: 173 [2018-01-20 21:57:51,938 INFO L226 Difference]: Without dead ends: 101 [2018-01-20 21:57:51,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=691, Invalid=1115, Unknown=0, NotChecked=0, Total=1806 [2018-01-20 21:57:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-20 21:57:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-01-20 21:57:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-20 21:57:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-01-20 21:57:51,949 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 95 [2018-01-20 21:57:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:51,949 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-01-20 21:57:51,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-20 21:57:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-01-20 21:57:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-20 21:57:51,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:51,951 INFO L322 BasicCegarLoop]: trace histogram [19, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:51,951 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash -181323801, now seen corresponding path program 15 times [2018-01-20 21:57:51,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:51,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:51,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:51,952 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:51,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:51,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:52,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:52,347 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:52,354 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 21:57:52,371 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,381 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,394 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,409 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,439 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,474 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,710 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,813 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:52,944 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:53,502 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:57:53,504 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:53,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:53,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:53,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-01-20 21:57:53,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-20 21:57:53,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-20 21:57:53,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2018-01-20 21:57:53,727 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 44 states. [2018-01-20 21:57:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:53,793 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-01-20 21:57:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 21:57:53,793 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 96 [2018-01-20 21:57:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:53,794 INFO L225 Difference]: With dead ends: 174 [2018-01-20 21:57:53,794 INFO L226 Difference]: Without dead ends: 102 [2018-01-20 21:57:53,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=757, Invalid=1223, Unknown=0, NotChecked=0, Total=1980 [2018-01-20 21:57:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-20 21:57:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-01-20 21:57:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-20 21:57:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-01-20 21:57:53,802 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 96 [2018-01-20 21:57:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:53,803 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-01-20 21:57:53,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-20 21:57:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-01-20 21:57:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-20 21:57:53,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:53,804 INFO L322 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:53,804 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:53,804 INFO L82 PathProgramCache]: Analyzing trace with hash -501818672, now seen corresponding path program 16 times [2018-01-20 21:57:53,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:53,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:53,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:53,805 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:53,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:53,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:54,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:54,181 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:54,186 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 21:57:55,424 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:55,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:55,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:55,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-20 21:57:55,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-20 21:57:55,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-20 21:57:55,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2018-01-20 21:57:55,647 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 46 states. [2018-01-20 21:57:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:55,705 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-01-20 21:57:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-20 21:57:55,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 97 [2018-01-20 21:57:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:55,706 INFO L225 Difference]: With dead ends: 175 [2018-01-20 21:57:55,706 INFO L226 Difference]: Without dead ends: 103 [2018-01-20 21:57:55,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=826, Invalid=1336, Unknown=0, NotChecked=0, Total=2162 [2018-01-20 21:57:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-20 21:57:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-01-20 21:57:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-20 21:57:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-01-20 21:57:55,715 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 97 [2018-01-20 21:57:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:55,716 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-01-20 21:57:55,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-20 21:57:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-01-20 21:57:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-20 21:57:55,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:55,717 INFO L322 BasicCegarLoop]: trace histogram [21, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:55,717 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1847225081, now seen corresponding path program 17 times [2018-01-20 21:57:55,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:55,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:55,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:55,718 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:55,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:55,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:56,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:56,089 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:56,098 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 21:57:56,109 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,114 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,118 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,124 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,130 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,143 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,165 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,191 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,210 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:57:56,289 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:57:56,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:57:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:56,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:57:56,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-20 21:57:56,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-20 21:57:56,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-20 21:57:56,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=1384, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 21:57:56,567 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 48 states. [2018-01-20 21:57:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:57:56,622 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-01-20 21:57:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 21:57:56,623 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2018-01-20 21:57:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:57:56,623 INFO L225 Difference]: With dead ends: 176 [2018-01-20 21:57:56,623 INFO L226 Difference]: Without dead ends: 104 [2018-01-20 21:57:56,624 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=898, Invalid=1454, Unknown=0, NotChecked=0, Total=2352 [2018-01-20 21:57:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-20 21:57:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-20 21:57:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-20 21:57:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-01-20 21:57:56,631 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 98 [2018-01-20 21:57:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:57:56,631 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-01-20 21:57:56,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-20 21:57:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-01-20 21:57:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-20 21:57:56,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:57:56,632 INFO L322 BasicCegarLoop]: trace histogram [22, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:57:56,632 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation]=== [2018-01-20 21:57:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash -605150800, now seen corresponding path program 18 times [2018-01-20 21:57:56,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:57:56,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:57:56,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:56,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:57:56,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:57:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:57:56,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:57:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:57:57,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:57:57,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:57:57,141 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 21:57:57,155 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,164 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,175 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,201 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,262 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,399 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,544 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:57,804 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:58,112 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:58,418 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:57:58,959 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:00,080 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:00,083 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:58:00,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:00,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:00,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-01-20 21:58:00,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-20 21:58:00,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-20 21:58:00,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=1504, Unknown=0, NotChecked=0, Total=2450 [2018-01-20 21:58:00,345 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 50 states. [2018-01-20 21:58:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:00,405 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-01-20 21:58:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 21:58:00,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-01-20 21:58:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:00,406 INFO L225 Difference]: With dead ends: 177 [2018-01-20 21:58:00,406 INFO L226 Difference]: Without dead ends: 105 [2018-01-20 21:58:00,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=973, Invalid=1577, Unknown=0, NotChecked=0, Total=2550 [2018-01-20 21:58:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-20 21:58:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-20 21:58:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-20 21:58:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-20 21:58:00,413 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 99 [2018-01-20 21:58:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:00,414 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-20 21:58:00,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-20 21:58:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-20 21:58:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-20 21:58:00,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:00,414 INFO L322 BasicCegarLoop]: trace histogram [23, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:00,415 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -755553753, now seen corresponding path program 19 times [2018-01-20 21:58:00,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:00,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:00,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:00,415 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:58:00,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:00,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:01,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:01,421 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:01,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:01,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:01,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:01,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-01-20 21:58:01,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-20 21:58:01,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-20 21:58:01,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=1629, Unknown=0, NotChecked=0, Total=2652 [2018-01-20 21:58:01,799 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 52 states. [2018-01-20 21:58:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:01,871 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2018-01-20 21:58:01,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-20 21:58:01,872 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-01-20 21:58:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:01,872 INFO L225 Difference]: With dead ends: 178 [2018-01-20 21:58:01,872 INFO L226 Difference]: Without dead ends: 106 [2018-01-20 21:58:01,873 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1051, Invalid=1705, Unknown=0, NotChecked=0, Total=2756 [2018-01-20 21:58:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-20 21:58:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-20 21:58:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-20 21:58:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-20 21:58:01,880 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 100 [2018-01-20 21:58:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:01,880 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-20 21:58:01,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-20 21:58:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-20 21:58:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 21:58:01,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:01,881 INFO L322 BasicCegarLoop]: trace histogram [24, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:01,881 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1123078000, now seen corresponding path program 20 times [2018-01-20 21:58:01,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:01,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:01,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:01,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:01,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:01,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:02,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:02,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:02,331 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:58:02,346 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:02,362 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:02,366 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:58:02,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:02,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:02,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-01-20 21:58:02,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-20 21:58:02,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-20 21:58:02,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=1759, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 21:58:02,708 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 54 states. [2018-01-20 21:58:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:02,790 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2018-01-20 21:58:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 21:58:02,791 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 101 [2018-01-20 21:58:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:02,792 INFO L225 Difference]: With dead ends: 179 [2018-01-20 21:58:02,792 INFO L226 Difference]: Without dead ends: 107 [2018-01-20 21:58:02,793 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1132, Invalid=1838, Unknown=0, NotChecked=0, Total=2970 [2018-01-20 21:58:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-20 21:58:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-20 21:58:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-20 21:58:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-01-20 21:58:02,799 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 101 [2018-01-20 21:58:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:02,799 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-01-20 21:58:02,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-20 21:58:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-01-20 21:58:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-20 21:58:02,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:02,800 INFO L322 BasicCegarLoop]: trace histogram [25, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:02,800 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash 368572231, now seen corresponding path program 21 times [2018-01-20 21:58:02,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:02,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:02,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:02,801 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:58:02,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:02,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:03,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:03,505 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:03,510 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 21:58:03,526 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,538 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,551 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,568 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,609 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,651 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,751 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:03,841 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:04,074 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:04,805 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:05,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:06,294 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:07,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:08,267 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 21:58:08,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:58:08,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:08,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:08,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-01-20 21:58:08,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-20 21:58:08,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-20 21:58:08,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1894, Unknown=0, NotChecked=0, Total=3080 [2018-01-20 21:58:08,560 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 56 states. [2018-01-20 21:58:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:08,633 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2018-01-20 21:58:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 21:58:08,634 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 102 [2018-01-20 21:58:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:08,634 INFO L225 Difference]: With dead ends: 180 [2018-01-20 21:58:08,634 INFO L226 Difference]: Without dead ends: 108 [2018-01-20 21:58:08,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1216, Invalid=1976, Unknown=0, NotChecked=0, Total=3192 [2018-01-20 21:58:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-20 21:58:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-01-20 21:58:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-20 21:58:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-20 21:58:08,641 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 102 [2018-01-20 21:58:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:08,642 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-20 21:58:08,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-20 21:58:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-20 21:58:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-20 21:58:08,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:08,642 INFO L322 BasicCegarLoop]: trace histogram [26, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:08,642 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash -634910864, now seen corresponding path program 22 times [2018-01-20 21:58:08,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:08,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:08,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:08,643 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:58:08,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:08,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:09,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:09,063 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:09,068 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 21:58:10,450 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:58:10,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:10,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:10,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-01-20 21:58:10,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-20 21:58:10,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-20 21:58:10,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1272, Invalid=2034, Unknown=0, NotChecked=0, Total=3306 [2018-01-20 21:58:10,788 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 58 states. [2018-01-20 21:58:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:10,863 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2018-01-20 21:58:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 21:58:10,863 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 103 [2018-01-20 21:58:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:10,864 INFO L225 Difference]: With dead ends: 181 [2018-01-20 21:58:10,864 INFO L226 Difference]: Without dead ends: 109 [2018-01-20 21:58:10,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1303, Invalid=2119, Unknown=0, NotChecked=0, Total=3422 [2018-01-20 21:58:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-20 21:58:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-20 21:58:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-20 21:58:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-20 21:58:10,875 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 103 [2018-01-20 21:58:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:10,875 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-20 21:58:10,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-20 21:58:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-20 21:58:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-20 21:58:10,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:10,876 INFO L322 BasicCegarLoop]: trace histogram [27, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:10,876 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1678115737, now seen corresponding path program 23 times [2018-01-20 21:58:10,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:10,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:10,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:10,878 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:58:10,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:10,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:11,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:11,615 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:11,622 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 21:58:11,630 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,633 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,634 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,637 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,640 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,647 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,664 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,703 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,734 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,812 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,839 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,884 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:11,958 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:12,100 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:58:12,103 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:58:12,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:12,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:12,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-01-20 21:58:12,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-20 21:58:12,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-20 21:58:12,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=2179, Unknown=0, NotChecked=0, Total=3540 [2018-01-20 21:58:12,489 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 60 states. [2018-01-20 21:58:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:12,631 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-01-20 21:58:12,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-20 21:58:12,632 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 104 [2018-01-20 21:58:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:12,633 INFO L225 Difference]: With dead ends: 182 [2018-01-20 21:58:12,633 INFO L226 Difference]: Without dead ends: 110 [2018-01-20 21:58:12,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1393, Invalid=2267, Unknown=0, NotChecked=0, Total=3660 [2018-01-20 21:58:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-20 21:58:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-20 21:58:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-20 21:58:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-20 21:58:12,642 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 104 [2018-01-20 21:58:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:12,642 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-20 21:58:12,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-20 21:58:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-20 21:58:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-20 21:58:12,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:12,643 INFO L322 BasicCegarLoop]: trace histogram [28, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:12,643 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:12,643 INFO L82 PathProgramCache]: Analyzing trace with hash 342271568, now seen corresponding path program 24 times [2018-01-20 21:58:12,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:12,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:12,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:12,643 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:58:12,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:12,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-20 21:58:13,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:13,166 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:13,177 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 21:58:13,195 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,203 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,214 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,253 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,291 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,337 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,431 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:13,653 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:14,104 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:14,475 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:15,771 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:18,255 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Received shutdown request... [2018-01-20 21:58:20,160 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 21:58:23,441 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Cannot interrupt operation gracefully because timeout expired. Forcing shutdown