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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:27:21,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:27:21,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:27:21,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:27:21,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:27:21,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:27:21,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:27:21,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:27:21,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:27:21,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:27:21,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:27:21,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:27:21,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:27:21,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:27:21,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:27:21,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:27:21,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:27:21,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:27:21,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:27:21,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:27:21,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:27:21,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:27:21,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:27:21,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:27:21,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:27:21,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:27:21,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:27:21,072 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:27:21,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:27:21,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:27:21,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:27:21,073 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 04:27:21,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:27:21,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:27:21,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:27:21,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:27:21,084 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:27:21,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:27:21,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:27:21,085 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:27:21,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:27:21,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:27:21,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:27:21,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:27:21,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:27:21,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:27:21,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:27:21,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:27:21,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:27:21,087 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:27:21,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:21,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:27:21,127 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:27:21,130 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:27:21,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:27:21,134 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:27:21,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-04 04:27:21,213 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:27:21,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:27:21,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:27:21,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:27:21,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:27:21,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727741ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21, skipping insertion in model container [2018-02-04 04:27:21,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,243 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:27:21,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:27:21,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:27:21,355 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:27:21,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21 WrapperNode [2018-02-04 04:27:21,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:27:21,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:27:21,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:27:21,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:27:21,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... [2018-02-04 04:27:21,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:27:21,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:27:21,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:27:21,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:27:21,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 04:27:21,408 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:27:21,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:27:21,409 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:27:21,409 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:27:21,409 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:27:21,409 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:27:21,409 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:27:21,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:27:21,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:27:21,494 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:27:21,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:27:21 BoogieIcfgContainer [2018-02-04 04:27:21,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:27:21,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:27:21,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:27:21,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:27:21,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:27:21" (1/3) ... [2018-02-04 04:27:21,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331bcc5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:27:21, skipping insertion in model container [2018-02-04 04:27:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:21" (2/3) ... [2018-02-04 04:27:21,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331bcc5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:27:21, skipping insertion in model container [2018-02-04 04:27:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:27:21" (3/3) ... [2018-02-04 04:27:21,500 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-04 04:27:21,505 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:27:21,510 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 04:27:21,533 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:27:21,533 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:27:21,533 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:27:21,533 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:27:21,533 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:27:21,533 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:27:21,533 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:27:21,533 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:27:21,534 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:27:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 04:27:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 04:27:21,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:21,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:21,548 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:21,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:21,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:27:21,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,656 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 41#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:27:21,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:27:21,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:27:21,669 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-04 04:27:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:21,714 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-04 04:27:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:27:21,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 04:27:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:21,720 INFO L225 Difference]: With dead ends: 34 [2018-02-04 04:27:21,720 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 04:27:21,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:27:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 04:27:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 04:27:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 04:27:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 04:27:21,741 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 7 [2018-02-04 04:27:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:21,741 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 04:27:21,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:27:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 04:27:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:27:21,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:21,742 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:21,742 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:21,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:21,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 04:27:21,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,784 INFO L182 omatonBuilderFactory]: Interpolants [104#true, 105#false, 108#(= main_~i~0 0), 109#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:27:21,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:27:21,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:27:21,786 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-02-04 04:27:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:21,837 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 04:27:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:27:21,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 04:27:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:21,839 INFO L225 Difference]: With dead ends: 41 [2018-02-04 04:27:21,839 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 04:27:21,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:27:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 04:27:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-04 04:27:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 04:27:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 04:27:21,848 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2018-02-04 04:27:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:21,848 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 04:27:21,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:27:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 04:27:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:27:21,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:21,849 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:21,849 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:21,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:21,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 04:27:21,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,893 INFO L182 omatonBuilderFactory]: Interpolants [192#false, 195#(= main_~i~0 0), 196#(= main_~i~0 1), 197#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 191#true] [2018-02-04 04:27:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:21,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:27:21,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:27:21,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:27:21,895 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-02-04 04:27:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:21,976 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 04:27:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:27:21,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:27:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:21,977 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:27:21,977 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:27:21,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:27:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:27:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-02-04 04:27:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:27:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 04:27:21,983 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 17 [2018-02-04 04:27:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:21,984 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 04:27:21,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:27:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 04:27:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:27:21,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:21,985 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:21,985 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:21,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:22,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 04:27:22,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,054 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 308#(= main_~i~0 0), 309#(= main_~i~0 1), 310#(= main_~i~0 2), 311#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:27:22,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:27:22,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:27:22,055 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-02-04 04:27:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:22,151 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 04:27:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:27:22,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 04:27:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:22,153 INFO L225 Difference]: With dead ends: 67 [2018-02-04 04:27:22,153 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 04:27:22,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:27:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 04:27:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-02-04 04:27:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 04:27:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-02-04 04:27:22,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2018-02-04 04:27:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:22,160 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-02-04 04:27:22,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:27:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-02-04 04:27:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:27:22,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:22,161 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:22,161 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:22,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:22,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 04:27:22,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,214 INFO L182 omatonBuilderFactory]: Interpolants [448#(= main_~i~0 1), 449#(= main_~i~0 2), 450#(= main_~i~0 3), 451#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 443#true, 444#false, 447#(= main_~i~0 0)] [2018-02-04 04:27:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:27:22,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:27:22,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:27:22,214 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 7 states. [2018-02-04 04:27:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:22,331 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-04 04:27:22,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:27:22,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:27:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:22,332 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:27:22,332 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:27:22,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:27:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:27:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-04 04:27:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 04:27:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-02-04 04:27:22,336 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 27 [2018-02-04 04:27:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:22,336 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-02-04 04:27:22,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:27:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-02-04 04:27:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:27:22,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:22,337 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:22,337 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:22,340 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:22,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 04:27:22,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,394 INFO L182 omatonBuilderFactory]: Interpolants [608#true, 609#false, 612#(= main_~i~0 0), 613#(= main_~i~0 1), 614#(= main_~i~0 2), 615#(= main_~i~0 3), 616#(= main_~i~0 4), 617#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:27:22,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:27:22,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:27:22,395 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-02-04 04:27:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:22,584 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-04 04:27:22,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:27:22,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 04:27:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:22,585 INFO L225 Difference]: With dead ends: 93 [2018-02-04 04:27:22,585 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 04:27:22,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:27:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 04:27:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-02-04 04:27:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 04:27:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-04 04:27:22,591 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 32 [2018-02-04 04:27:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:22,591 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-04 04:27:22,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:27:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-04 04:27:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:27:22,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:22,592 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:22,592 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:22,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:22,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 04:27:22,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,637 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 803#(= main_~i~0 0), 804#(= main_~i~0 1), 805#(= main_~i~0 2), 806#(= main_~i~0 3), 807#(= main_~i~0 4), 808#(= main_~i~0 5), 809#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 799#true] [2018-02-04 04:27:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:27:22,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:27:22,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:27:22,638 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 9 states. [2018-02-04 04:27:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:22,781 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-04 04:27:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:27:22,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-04 04:27:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:22,782 INFO L225 Difference]: With dead ends: 106 [2018-02-04 04:27:22,782 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 04:27:22,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:27:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 04:27:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-02-04 04:27:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 04:27:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-02-04 04:27:22,787 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 37 [2018-02-04 04:27:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:22,788 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-02-04 04:27:22,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:27:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-02-04 04:27:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:27:22,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:22,788 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:22,789 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:22,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:22,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 04:27:22,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,838 INFO L182 omatonBuilderFactory]: Interpolants [1024#(= main_~i~0 4), 1025#(= main_~i~0 5), 1026#(= main_~i~0 6), 1027#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1016#true, 1017#false, 1020#(= main_~i~0 0), 1021#(= main_~i~0 1), 1022#(= main_~i~0 2), 1023#(= main_~i~0 3)] [2018-02-04 04:27:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:22,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:27:22,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:27:22,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:27:22,839 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 10 states. [2018-02-04 04:27:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:23,049 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-04 04:27:23,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:27:23,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 04:27:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:23,050 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:27:23,050 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:27:23,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:27:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:27:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-02-04 04:27:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:27:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-02-04 04:27:23,055 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 42 [2018-02-04 04:27:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:23,055 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-02-04 04:27:23,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:27:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-02-04 04:27:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:27:23,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:23,056 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:23,056 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:23,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:23,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:27:23,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,119 INFO L182 omatonBuilderFactory]: Interpolants [1264#(= main_~i~0 1), 1265#(= main_~i~0 2), 1266#(= main_~i~0 3), 1267#(= main_~i~0 4), 1268#(= main_~i~0 5), 1269#(= main_~i~0 6), 1270#(= main_~i~0 7), 1271#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1259#true, 1260#false, 1263#(= main_~i~0 0)] [2018-02-04 04:27:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:27:23,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:27:23,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:27:23,120 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 11 states. [2018-02-04 04:27:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:23,343 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-04 04:27:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:27:23,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 04:27:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:23,344 INFO L225 Difference]: With dead ends: 132 [2018-02-04 04:27:23,344 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 04:27:23,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:27:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 04:27:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2018-02-04 04:27:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 04:27:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-02-04 04:27:23,350 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 47 [2018-02-04 04:27:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:23,350 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-02-04 04:27:23,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:27:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-02-04 04:27:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:27:23,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:23,352 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:23,352 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:23,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:23,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 04:27:23,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,474 INFO L182 omatonBuilderFactory]: Interpolants [1536#(= main_~i~0 4), 1537#(= main_~i~0 5), 1538#(= main_~i~0 6), 1539#(= main_~i~0 7), 1540#(= main_~i~0 8), 1541#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1528#true, 1529#false, 1532#(= main_~i~0 0), 1533#(= main_~i~0 1), 1534#(= main_~i~0 2), 1535#(= main_~i~0 3)] [2018-02-04 04:27:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:27:23,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:27:23,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:27:23,475 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 12 states. [2018-02-04 04:27:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:23,890 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-04 04:27:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:27:23,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-04 04:27:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:23,892 INFO L225 Difference]: With dead ends: 145 [2018-02-04 04:27:23,892 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 04:27:23,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:27:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 04:27:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2018-02-04 04:27:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 04:27:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2018-02-04 04:27:23,900 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 52 [2018-02-04 04:27:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:23,900 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2018-02-04 04:27:23,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:27:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2018-02-04 04:27:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 04:27:23,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:23,902 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:23,902 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:23,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:23,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:23,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:27:23,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,991 INFO L182 omatonBuilderFactory]: Interpolants [1824#false, 1827#(= main_~i~0 0), 1828#(= main_~i~0 1), 1829#(= main_~i~0 2), 1830#(= main_~i~0 3), 1831#(= main_~i~0 4), 1832#(= main_~i~0 5), 1833#(= main_~i~0 6), 1834#(= main_~i~0 7), 1835#(= main_~i~0 8), 1836#(= main_~i~0 9), 1837#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1823#true] [2018-02-04 04:27:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:23,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:27:23,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:27:23,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:27:23,992 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand 13 states. [2018-02-04 04:27:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:24,296 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-04 04:27:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:27:24,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 04:27:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:24,297 INFO L225 Difference]: With dead ends: 158 [2018-02-04 04:27:24,297 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 04:27:24,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:27:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 04:27:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2018-02-04 04:27:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 04:27:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2018-02-04 04:27:24,301 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 57 [2018-02-04 04:27:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:24,301 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2018-02-04 04:27:24,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:27:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-02-04 04:27:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 04:27:24,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:24,302 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:24,302 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:24,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:24,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:27:24,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,396 INFO L182 omatonBuilderFactory]: Interpolants [2144#true, 2145#false, 2148#(= main_~i~0 0), 2149#(= main_~i~0 1), 2150#(= main_~i~0 2), 2151#(= main_~i~0 3), 2152#(= main_~i~0 4), 2153#(= main_~i~0 5), 2154#(= main_~i~0 6), 2155#(= main_~i~0 7), 2156#(= main_~i~0 8), 2157#(= main_~i~0 9), 2158#(= main_~i~0 10), 2159#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:27:24,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:27:24,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:27:24,397 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 14 states. [2018-02-04 04:27:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:24,731 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-04 04:27:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:27:24,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 04:27:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:24,732 INFO L225 Difference]: With dead ends: 171 [2018-02-04 04:27:24,732 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 04:27:24,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:27:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 04:27:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-02-04 04:27:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 04:27:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-02-04 04:27:24,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 62 [2018-02-04 04:27:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:24,735 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-02-04 04:27:24,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:27:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-02-04 04:27:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:27:24,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:24,736 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:24,736 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:24,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:24,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:27:24,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,824 INFO L182 omatonBuilderFactory]: Interpolants [2496#(= main_~i~0 1), 2497#(= main_~i~0 2), 2498#(= main_~i~0 3), 2499#(= main_~i~0 4), 2500#(= main_~i~0 5), 2501#(= main_~i~0 6), 2502#(= main_~i~0 7), 2503#(= main_~i~0 8), 2504#(= main_~i~0 9), 2505#(= main_~i~0 10), 2506#(= main_~i~0 11), 2507#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2491#true, 2492#false, 2495#(= main_~i~0 0)] [2018-02-04 04:27:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:24,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:27:24,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:27:24,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:27:24,825 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 15 states. [2018-02-04 04:27:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:25,201 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-04 04:27:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:27:25,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-02-04 04:27:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:25,202 INFO L225 Difference]: With dead ends: 184 [2018-02-04 04:27:25,202 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 04:27:25,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:27:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 04:27:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2018-02-04 04:27:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 04:27:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2018-02-04 04:27:25,247 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 67 [2018-02-04 04:27:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:25,248 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2018-02-04 04:27:25,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:27:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2018-02-04 04:27:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 04:27:25,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:25,249 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:25,249 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:25,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:25,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:27:25,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,333 INFO L182 omatonBuilderFactory]: Interpolants [2880#(= main_~i~0 12), 2881#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2864#true, 2865#false, 2868#(= main_~i~0 0), 2869#(= main_~i~0 1), 2870#(= main_~i~0 2), 2871#(= main_~i~0 3), 2872#(= main_~i~0 4), 2873#(= main_~i~0 5), 2874#(= main_~i~0 6), 2875#(= main_~i~0 7), 2876#(= main_~i~0 8), 2877#(= main_~i~0 9), 2878#(= main_~i~0 10), 2879#(= main_~i~0 11)] [2018-02-04 04:27:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:27:25,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:27:25,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:27:25,334 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand 16 states. [2018-02-04 04:27:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:25,770 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-04 04:27:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:27:25,770 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-04 04:27:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:25,771 INFO L225 Difference]: With dead ends: 197 [2018-02-04 04:27:25,771 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 04:27:25,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:27:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 04:27:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2018-02-04 04:27:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 04:27:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2018-02-04 04:27:25,774 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 72 [2018-02-04 04:27:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:25,774 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2018-02-04 04:27:25,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:27:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-02-04 04:27:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:27:25,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:25,776 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:25,776 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:25,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:25,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:27:25,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,904 INFO L182 omatonBuilderFactory]: Interpolants [3264#false, 3267#(= main_~i~0 0), 3268#(= main_~i~0 1), 3269#(= main_~i~0 2), 3270#(= main_~i~0 3), 3271#(= main_~i~0 4), 3272#(= main_~i~0 5), 3273#(= main_~i~0 6), 3274#(= main_~i~0 7), 3275#(= main_~i~0 8), 3276#(= main_~i~0 9), 3277#(= main_~i~0 10), 3278#(= main_~i~0 11), 3279#(= main_~i~0 12), 3280#(= main_~i~0 13), 3281#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 3263#true] [2018-02-04 04:27:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:25,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:27:25,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:27:25,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:27:25,905 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand 17 states. [2018-02-04 04:27:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:26,405 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-04 04:27:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:27:26,405 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-04 04:27:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:26,406 INFO L225 Difference]: With dead ends: 210 [2018-02-04 04:27:26,406 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 04:27:26,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:27:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 04:27:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-02-04 04:27:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 04:27:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2018-02-04 04:27:26,412 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 77 [2018-02-04 04:27:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:26,412 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2018-02-04 04:27:26,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:27:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2018-02-04 04:27:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:27:26,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:26,413 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:26,413 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:26,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:26,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:26,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:27:26,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:26,525 INFO L182 omatonBuilderFactory]: Interpolants [3688#true, 3689#false, 3692#(= main_~i~0 0), 3693#(= main_~i~0 1), 3694#(= main_~i~0 2), 3695#(= main_~i~0 3), 3696#(= main_~i~0 4), 3697#(= main_~i~0 5), 3698#(= main_~i~0 6), 3699#(= main_~i~0 7), 3700#(= main_~i~0 8), 3701#(= main_~i~0 9), 3702#(= main_~i~0 10), 3703#(= main_~i~0 11), 3704#(= main_~i~0 12), 3705#(= main_~i~0 13), 3706#(= main_~i~0 14), 3707#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:26,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:27:26,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:27:26,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:27:26,526 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand 18 states. [2018-02-04 04:27:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:27,087 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-04 04:27:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:27:27,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-02-04 04:27:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:27,088 INFO L225 Difference]: With dead ends: 223 [2018-02-04 04:27:27,088 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 04:27:27,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:27:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 04:27:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2018-02-04 04:27:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 04:27:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2018-02-04 04:27:27,093 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 82 [2018-02-04 04:27:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:27,093 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2018-02-04 04:27:27,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:27:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2018-02-04 04:27:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:27:27,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:27,095 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:27,095 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:27,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:27,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:27:27,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,207 INFO L182 omatonBuilderFactory]: Interpolants [4139#true, 4140#false, 4143#(= main_~i~0 0), 4144#(= main_~i~0 1), 4145#(= main_~i~0 2), 4146#(= main_~i~0 3), 4147#(= main_~i~0 4), 4148#(= main_~i~0 5), 4149#(= main_~i~0 6), 4150#(= main_~i~0 7), 4151#(= main_~i~0 8), 4152#(= main_~i~0 9), 4153#(= main_~i~0 10), 4154#(= main_~i~0 11), 4155#(= main_~i~0 12), 4156#(= main_~i~0 13), 4157#(= main_~i~0 14), 4158#(= main_~i~0 15), 4159#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:27:27,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:27:27,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:27:27,207 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand 19 states. [2018-02-04 04:27:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:27,847 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-04 04:27:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:27:27,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 04:27:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:27,848 INFO L225 Difference]: With dead ends: 236 [2018-02-04 04:27:27,848 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 04:27:27,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:27:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 04:27:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-04 04:27:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 04:27:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 253 transitions. [2018-02-04 04:27:27,854 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 253 transitions. Word has length 87 [2018-02-04 04:27:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:27,854 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 253 transitions. [2018-02-04 04:27:27,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:27:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 253 transitions. [2018-02-04 04:27:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:27:27,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:27,855 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:27,855 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:27,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:27,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:27:27,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,967 INFO L182 omatonBuilderFactory]: Interpolants [4616#true, 4617#false, 4620#(= main_~i~0 0), 4621#(= main_~i~0 1), 4622#(= main_~i~0 2), 4623#(= main_~i~0 3), 4624#(= main_~i~0 4), 4625#(= main_~i~0 5), 4626#(= main_~i~0 6), 4627#(= main_~i~0 7), 4628#(= main_~i~0 8), 4629#(= main_~i~0 9), 4630#(= main_~i~0 10), 4631#(= main_~i~0 11), 4632#(= main_~i~0 12), 4633#(= main_~i~0 13), 4634#(= main_~i~0 14), 4635#(= main_~i~0 15), 4636#(= main_~i~0 16), 4637#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:27,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:27:27,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:27:27,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:27:27,968 INFO L87 Difference]: Start difference. First operand 220 states and 253 transitions. Second operand 20 states. [2018-02-04 04:27:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:28,727 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-04 04:27:28,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:27:28,728 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-02-04 04:27:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:28,728 INFO L225 Difference]: With dead ends: 249 [2018-02-04 04:27:28,728 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 04:27:28,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:27:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 04:27:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 232. [2018-02-04 04:27:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 04:27:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 267 transitions. [2018-02-04 04:27:28,731 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 267 transitions. Word has length 92 [2018-02-04 04:27:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:28,732 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 267 transitions. [2018-02-04 04:27:28,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:27:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 267 transitions. [2018-02-04 04:27:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:27:28,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:28,732 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:28,732 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:28,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:28,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:28,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:27:28,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:28,858 INFO L182 omatonBuilderFactory]: Interpolants [5120#false, 5123#(= main_~i~0 0), 5124#(= main_~i~0 1), 5125#(= main_~i~0 2), 5126#(= main_~i~0 3), 5127#(= main_~i~0 4), 5128#(= main_~i~0 5), 5129#(= main_~i~0 6), 5130#(= main_~i~0 7), 5131#(= main_~i~0 8), 5132#(= main_~i~0 9), 5133#(= main_~i~0 10), 5134#(= main_~i~0 11), 5135#(= main_~i~0 12), 5136#(= main_~i~0 13), 5137#(= main_~i~0 14), 5138#(= main_~i~0 15), 5139#(= main_~i~0 16), 5140#(= main_~i~0 17), 5141#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 5119#true] [2018-02-04 04:27:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:28,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:27:28,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:27:28,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:27:28,859 INFO L87 Difference]: Start difference. First operand 232 states and 267 transitions. Second operand 21 states. [2018-02-04 04:27:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:29,753 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-04 04:27:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:27:29,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-02-04 04:27:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:29,754 INFO L225 Difference]: With dead ends: 262 [2018-02-04 04:27:29,754 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 04:27:29,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:27:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 04:27:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2018-02-04 04:27:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 04:27:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 281 transitions. [2018-02-04 04:27:29,758 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 281 transitions. Word has length 97 [2018-02-04 04:27:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:29,759 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 281 transitions. [2018-02-04 04:27:29,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:27:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 281 transitions. [2018-02-04 04:27:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 04:27:29,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:29,760 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:29,760 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:29,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:29,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:29,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:27:29,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:29,896 INFO L182 omatonBuilderFactory]: Interpolants [5664#(= main_~i~0 12), 5665#(= main_~i~0 13), 5666#(= main_~i~0 14), 5667#(= main_~i~0 15), 5668#(= main_~i~0 16), 5669#(= main_~i~0 17), 5670#(= main_~i~0 18), 5671#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 5648#true, 5649#false, 5652#(= main_~i~0 0), 5653#(= main_~i~0 1), 5654#(= main_~i~0 2), 5655#(= main_~i~0 3), 5656#(= main_~i~0 4), 5657#(= main_~i~0 5), 5658#(= main_~i~0 6), 5659#(= main_~i~0 7), 5660#(= main_~i~0 8), 5661#(= main_~i~0 9), 5662#(= main_~i~0 10), 5663#(= main_~i~0 11)] [2018-02-04 04:27:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:29,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:27:29,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:27:29,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:27:29,897 INFO L87 Difference]: Start difference. First operand 244 states and 281 transitions. Second operand 22 states. [2018-02-04 04:27:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:31,098 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-04 04:27:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:27:31,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-04 04:27:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:31,099 INFO L225 Difference]: With dead ends: 275 [2018-02-04 04:27:31,100 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 04:27:31,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:27:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 04:27:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 256. [2018-02-04 04:27:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 04:27:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2018-02-04 04:27:31,103 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 102 [2018-02-04 04:27:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:31,103 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2018-02-04 04:27:31,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:27:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2018-02-04 04:27:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 04:27:31,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:31,104 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:31,104 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:31,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:31,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:31,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:27:31,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:31,255 INFO L182 omatonBuilderFactory]: Interpolants [6208#(= main_~i~0 1), 6209#(= main_~i~0 2), 6210#(= main_~i~0 3), 6211#(= main_~i~0 4), 6212#(= main_~i~0 5), 6213#(= main_~i~0 6), 6214#(= main_~i~0 7), 6215#(= main_~i~0 8), 6216#(= main_~i~0 9), 6217#(= main_~i~0 10), 6218#(= main_~i~0 11), 6219#(= main_~i~0 12), 6220#(= main_~i~0 13), 6221#(= main_~i~0 14), 6222#(= main_~i~0 15), 6223#(= main_~i~0 16), 6224#(= main_~i~0 17), 6225#(= main_~i~0 18), 6226#(= main_~i~0 19), 6227#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 6203#true, 6204#false, 6207#(= main_~i~0 0)] [2018-02-04 04:27:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:31,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:27:31,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:27:31,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:27:31,256 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand 23 states. [2018-02-04 04:27:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:32,280 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-04 04:27:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:27:32,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2018-02-04 04:27:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:32,281 INFO L225 Difference]: With dead ends: 288 [2018-02-04 04:27:32,282 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:27:32,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:27:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:27:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2018-02-04 04:27:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 04:27:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 309 transitions. [2018-02-04 04:27:32,285 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 309 transitions. Word has length 107 [2018-02-04 04:27:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:32,285 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 309 transitions. [2018-02-04 04:27:32,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:27:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 309 transitions. [2018-02-04 04:27:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 04:27:32,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:32,286 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:32,286 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:32,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:32,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:32,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:27:32,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:32,505 INFO L182 omatonBuilderFactory]: Interpolants [6784#true, 6785#false, 6788#(= main_~i~0 0), 6789#(= main_~i~0 1), 6790#(= main_~i~0 2), 6791#(= main_~i~0 3), 6792#(= main_~i~0 4), 6793#(= main_~i~0 5), 6794#(= main_~i~0 6), 6795#(= main_~i~0 7), 6796#(= main_~i~0 8), 6797#(= main_~i~0 9), 6798#(= main_~i~0 10), 6799#(= main_~i~0 11), 6800#(= main_~i~0 12), 6801#(= main_~i~0 13), 6802#(= main_~i~0 14), 6803#(= main_~i~0 15), 6804#(= main_~i~0 16), 6805#(= main_~i~0 17), 6806#(= main_~i~0 18), 6807#(= main_~i~0 19), 6808#(= main_~i~0 20), 6809#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:32,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:27:32,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:27:32,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:27:32,506 INFO L87 Difference]: Start difference. First operand 268 states and 309 transitions. Second operand 24 states. [2018-02-04 04:27:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:33,626 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-04 04:27:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:27:33,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2018-02-04 04:27:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:33,627 INFO L225 Difference]: With dead ends: 301 [2018-02-04 04:27:33,627 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:27:33,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:27:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:27:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2018-02-04 04:27:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-04 04:27:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 323 transitions. [2018-02-04 04:27:33,631 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 323 transitions. Word has length 112 [2018-02-04 04:27:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:33,631 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 323 transitions. [2018-02-04 04:27:33,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:27:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 323 transitions. [2018-02-04 04:27:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 04:27:33,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:33,632 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:33,632 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:33,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:33,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:33,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:27:33,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:33,803 INFO L182 omatonBuilderFactory]: Interpolants [7391#true, 7392#false, 7395#(= main_~i~0 0), 7396#(= main_~i~0 1), 7397#(= main_~i~0 2), 7398#(= main_~i~0 3), 7399#(= main_~i~0 4), 7400#(= main_~i~0 5), 7401#(= main_~i~0 6), 7402#(= main_~i~0 7), 7403#(= main_~i~0 8), 7404#(= main_~i~0 9), 7405#(= main_~i~0 10), 7406#(= main_~i~0 11), 7407#(= main_~i~0 12), 7408#(= main_~i~0 13), 7409#(= main_~i~0 14), 7410#(= main_~i~0 15), 7411#(= main_~i~0 16), 7412#(= main_~i~0 17), 7413#(= main_~i~0 18), 7414#(= main_~i~0 19), 7415#(= main_~i~0 20), 7416#(= main_~i~0 21), 7417#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:33,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:27:33,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:27:33,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:27:33,804 INFO L87 Difference]: Start difference. First operand 280 states and 323 transitions. Second operand 25 states. [2018-02-04 04:27:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:35,136 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-04 04:27:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:27:35,137 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-02-04 04:27:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:35,138 INFO L225 Difference]: With dead ends: 314 [2018-02-04 04:27:35,138 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 04:27:35,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:27:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 04:27:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 292. [2018-02-04 04:27:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 04:27:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 337 transitions. [2018-02-04 04:27:35,141 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 337 transitions. Word has length 117 [2018-02-04 04:27:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:35,141 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 337 transitions. [2018-02-04 04:27:35,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:27:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 337 transitions. [2018-02-04 04:27:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 04:27:35,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:35,142 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:35,142 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:35,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:35,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:35,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:27:35,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:35,415 INFO L182 omatonBuilderFactory]: Interpolants [8024#true, 8025#false, 8028#(= main_~i~0 0), 8029#(= main_~i~0 1), 8030#(= main_~i~0 2), 8031#(= main_~i~0 3), 8032#(= main_~i~0 4), 8033#(= main_~i~0 5), 8034#(= main_~i~0 6), 8035#(= main_~i~0 7), 8036#(= main_~i~0 8), 8037#(= main_~i~0 9), 8038#(= main_~i~0 10), 8039#(= main_~i~0 11), 8040#(= main_~i~0 12), 8041#(= main_~i~0 13), 8042#(= main_~i~0 14), 8043#(= main_~i~0 15), 8044#(= main_~i~0 16), 8045#(= main_~i~0 17), 8046#(= main_~i~0 18), 8047#(= main_~i~0 19), 8048#(= main_~i~0 20), 8049#(= main_~i~0 21), 8050#(= main_~i~0 22), 8051#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:35,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:27:35,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:27:35,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:27:35,417 INFO L87 Difference]: Start difference. First operand 292 states and 337 transitions. Second operand 26 states. [2018-02-04 04:27:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:36,830 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-04 04:27:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:27:36,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-02-04 04:27:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:36,831 INFO L225 Difference]: With dead ends: 327 [2018-02-04 04:27:36,831 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 04:27:36,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:27:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 04:27:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 304. [2018-02-04 04:27:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-04 04:27:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 351 transitions. [2018-02-04 04:27:36,835 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 351 transitions. Word has length 122 [2018-02-04 04:27:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:36,835 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 351 transitions. [2018-02-04 04:27:36,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:27:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 351 transitions. [2018-02-04 04:27:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 04:27:36,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:36,836 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:36,836 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:36,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:37,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:37,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 04:27:37,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:37,038 INFO L182 omatonBuilderFactory]: Interpolants [8704#(= main_~i~0 17), 8705#(= main_~i~0 18), 8706#(= main_~i~0 19), 8707#(= main_~i~0 20), 8708#(= main_~i~0 21), 8709#(= main_~i~0 22), 8710#(= main_~i~0 23), 8711#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 8683#true, 8684#false, 8687#(= main_~i~0 0), 8688#(= main_~i~0 1), 8689#(= main_~i~0 2), 8690#(= main_~i~0 3), 8691#(= main_~i~0 4), 8692#(= main_~i~0 5), 8693#(= main_~i~0 6), 8694#(= main_~i~0 7), 8695#(= main_~i~0 8), 8696#(= main_~i~0 9), 8697#(= main_~i~0 10), 8698#(= main_~i~0 11), 8699#(= main_~i~0 12), 8700#(= main_~i~0 13), 8701#(= main_~i~0 14), 8702#(= main_~i~0 15), 8703#(= main_~i~0 16)] [2018-02-04 04:27:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:37,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:27:37,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:27:37,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:27:37,039 INFO L87 Difference]: Start difference. First operand 304 states and 351 transitions. Second operand 27 states. [2018-02-04 04:27:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:38,561 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-04 04:27:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:27:38,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2018-02-04 04:27:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:38,563 INFO L225 Difference]: With dead ends: 340 [2018-02-04 04:27:38,563 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 04:27:38,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:27:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 04:27:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 316. [2018-02-04 04:27:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 04:27:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 365 transitions. [2018-02-04 04:27:38,566 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 365 transitions. Word has length 127 [2018-02-04 04:27:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:38,566 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 365 transitions. [2018-02-04 04:27:38,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:27:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 365 transitions. [2018-02-04 04:27:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 04:27:38,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:38,567 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:38,567 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:38,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:38,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:38,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 04:27:38,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:38,813 INFO L182 omatonBuilderFactory]: Interpolants [9368#true, 9369#false, 9372#(= main_~i~0 0), 9373#(= main_~i~0 1), 9374#(= main_~i~0 2), 9375#(= main_~i~0 3), 9376#(= main_~i~0 4), 9377#(= main_~i~0 5), 9378#(= main_~i~0 6), 9379#(= main_~i~0 7), 9380#(= main_~i~0 8), 9381#(= main_~i~0 9), 9382#(= main_~i~0 10), 9383#(= main_~i~0 11), 9384#(= main_~i~0 12), 9385#(= main_~i~0 13), 9386#(= main_~i~0 14), 9387#(= main_~i~0 15), 9388#(= main_~i~0 16), 9389#(= main_~i~0 17), 9390#(= main_~i~0 18), 9391#(= main_~i~0 19), 9392#(= main_~i~0 20), 9393#(= main_~i~0 21), 9394#(= main_~i~0 22), 9395#(= main_~i~0 23), 9396#(= main_~i~0 24), 9397#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:38,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 04:27:38,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 04:27:38,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:27:38,814 INFO L87 Difference]: Start difference. First operand 316 states and 365 transitions. Second operand 28 states. [2018-02-04 04:27:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:40,573 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-04 04:27:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:27:40,573 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 132 [2018-02-04 04:27:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:40,574 INFO L225 Difference]: With dead ends: 353 [2018-02-04 04:27:40,574 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 04:27:40,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:27:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 04:27:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2018-02-04 04:27:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 04:27:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2018-02-04 04:27:40,578 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 132 [2018-02-04 04:27:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:40,578 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2018-02-04 04:27:40,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 04:27:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2018-02-04 04:27:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:27:40,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:40,579 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:40,579 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:40,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:40,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:40,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 04:27:40,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:40,801 INFO L182 omatonBuilderFactory]: Interpolants [10079#true, 10080#false, 10083#(= main_~i~0 0), 10084#(= main_~i~0 1), 10085#(= main_~i~0 2), 10086#(= main_~i~0 3), 10087#(= main_~i~0 4), 10088#(= main_~i~0 5), 10089#(= main_~i~0 6), 10090#(= main_~i~0 7), 10091#(= main_~i~0 8), 10092#(= main_~i~0 9), 10093#(= main_~i~0 10), 10094#(= main_~i~0 11), 10095#(= main_~i~0 12), 10096#(= main_~i~0 13), 10097#(= main_~i~0 14), 10098#(= main_~i~0 15), 10099#(= main_~i~0 16), 10100#(= main_~i~0 17), 10101#(= main_~i~0 18), 10102#(= main_~i~0 19), 10103#(= main_~i~0 20), 10104#(= main_~i~0 21), 10105#(= main_~i~0 22), 10106#(= main_~i~0 23), 10107#(= main_~i~0 24), 10108#(= main_~i~0 25), 10109#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:40,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:27:40,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:27:40,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:27:40,803 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 29 states. [2018-02-04 04:27:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:42,497 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-04 04:27:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:27:42,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 137 [2018-02-04 04:27:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:42,499 INFO L225 Difference]: With dead ends: 366 [2018-02-04 04:27:42,499 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 04:27:42,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:27:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 04:27:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-04 04:27:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 04:27:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 393 transitions. [2018-02-04 04:27:42,505 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 393 transitions. Word has length 137 [2018-02-04 04:27:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:42,505 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 393 transitions. [2018-02-04 04:27:42,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:27:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 393 transitions. [2018-02-04 04:27:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 04:27:42,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:42,507 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:42,507 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:42,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:42,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:42,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 04:27:42,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:42,737 INFO L182 omatonBuilderFactory]: Interpolants [10816#true, 10817#false, 10820#(= main_~i~0 0), 10821#(= main_~i~0 1), 10822#(= main_~i~0 2), 10823#(= main_~i~0 3), 10824#(= main_~i~0 4), 10825#(= main_~i~0 5), 10826#(= main_~i~0 6), 10827#(= main_~i~0 7), 10828#(= main_~i~0 8), 10829#(= main_~i~0 9), 10830#(= main_~i~0 10), 10831#(= main_~i~0 11), 10832#(= main_~i~0 12), 10833#(= main_~i~0 13), 10834#(= main_~i~0 14), 10835#(= main_~i~0 15), 10836#(= main_~i~0 16), 10837#(= main_~i~0 17), 10838#(= main_~i~0 18), 10839#(= main_~i~0 19), 10840#(= main_~i~0 20), 10841#(= main_~i~0 21), 10842#(= main_~i~0 22), 10843#(= main_~i~0 23), 10844#(= main_~i~0 24), 10845#(= main_~i~0 25), 10846#(= main_~i~0 26), 10847#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:42,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:27:42,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:27:42,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:27:42,738 INFO L87 Difference]: Start difference. First operand 340 states and 393 transitions. Second operand 30 states. [2018-02-04 04:27:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:44,570 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-04 04:27:44,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:27:44,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 142 [2018-02-04 04:27:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:44,572 INFO L225 Difference]: With dead ends: 379 [2018-02-04 04:27:44,572 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 04:27:44,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:27:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 04:27:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2018-02-04 04:27:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-04 04:27:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2018-02-04 04:27:44,577 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 142 [2018-02-04 04:27:44,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:44,577 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2018-02-04 04:27:44,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:27:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2018-02-04 04:27:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 04:27:44,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:44,578 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:44,578 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:44,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:44,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:44,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 04:27:44,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:44,866 INFO L182 omatonBuilderFactory]: Interpolants [11584#(= main_~i~0 1), 11585#(= main_~i~0 2), 11586#(= main_~i~0 3), 11587#(= main_~i~0 4), 11588#(= main_~i~0 5), 11589#(= main_~i~0 6), 11590#(= main_~i~0 7), 11591#(= main_~i~0 8), 11592#(= main_~i~0 9), 11593#(= main_~i~0 10), 11594#(= main_~i~0 11), 11595#(= main_~i~0 12), 11596#(= main_~i~0 13), 11597#(= main_~i~0 14), 11598#(= main_~i~0 15), 11599#(= main_~i~0 16), 11600#(= main_~i~0 17), 11601#(= main_~i~0 18), 11602#(= main_~i~0 19), 11603#(= main_~i~0 20), 11604#(= main_~i~0 21), 11605#(= main_~i~0 22), 11606#(= main_~i~0 23), 11607#(= main_~i~0 24), 11608#(= main_~i~0 25), 11609#(= main_~i~0 26), 11610#(= main_~i~0 27), 11611#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 11579#true, 11580#false, 11583#(= main_~i~0 0)] [2018-02-04 04:27:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:44,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:27:44,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:27:44,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:27:44,868 INFO L87 Difference]: Start difference. First operand 352 states and 407 transitions. Second operand 31 states. [2018-02-04 04:27:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:46,719 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-04 04:27:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:27:46,719 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-02-04 04:27:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:46,720 INFO L225 Difference]: With dead ends: 392 [2018-02-04 04:27:46,720 INFO L226 Difference]: Without dead ends: 392 [2018-02-04 04:27:46,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:27:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-04 04:27:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 364. [2018-02-04 04:27:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-04 04:27:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 421 transitions. [2018-02-04 04:27:46,725 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 421 transitions. Word has length 147 [2018-02-04 04:27:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:46,725 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 421 transitions. [2018-02-04 04:27:46,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:27:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 421 transitions. [2018-02-04 04:27:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 04:27:46,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:46,726 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:46,727 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:46,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:46,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:47,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:47,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 04:27:47,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:47,004 INFO L182 omatonBuilderFactory]: Interpolants [12368#true, 12369#false, 12372#(= main_~i~0 0), 12373#(= main_~i~0 1), 12374#(= main_~i~0 2), 12375#(= main_~i~0 3), 12376#(= main_~i~0 4), 12377#(= main_~i~0 5), 12378#(= main_~i~0 6), 12379#(= main_~i~0 7), 12380#(= main_~i~0 8), 12381#(= main_~i~0 9), 12382#(= main_~i~0 10), 12383#(= main_~i~0 11), 12384#(= main_~i~0 12), 12385#(= main_~i~0 13), 12386#(= main_~i~0 14), 12387#(= main_~i~0 15), 12388#(= main_~i~0 16), 12389#(= main_~i~0 17), 12390#(= main_~i~0 18), 12391#(= main_~i~0 19), 12392#(= main_~i~0 20), 12393#(= main_~i~0 21), 12394#(= main_~i~0 22), 12395#(= main_~i~0 23), 12396#(= main_~i~0 24), 12397#(= main_~i~0 25), 12398#(= main_~i~0 26), 12399#(= main_~i~0 27), 12400#(= main_~i~0 28), 12401#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:47,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:27:47,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:27:47,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:27:47,005 INFO L87 Difference]: Start difference. First operand 364 states and 421 transitions. Second operand 32 states. [2018-02-04 04:27:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:49,080 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-04 04:27:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:27:49,080 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 152 [2018-02-04 04:27:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:49,081 INFO L225 Difference]: With dead ends: 405 [2018-02-04 04:27:49,081 INFO L226 Difference]: Without dead ends: 405 [2018-02-04 04:27:49,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:27:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-04 04:27:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 376. [2018-02-04 04:27:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 04:27:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 435 transitions. [2018-02-04 04:27:49,085 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 435 transitions. Word has length 152 [2018-02-04 04:27:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:49,085 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 435 transitions. [2018-02-04 04:27:49,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:27:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 435 transitions. [2018-02-04 04:27:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:27:49,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:49,086 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:49,086 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:49,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:49,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:49,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 04:27:49,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:49,397 INFO L182 omatonBuilderFactory]: Interpolants [13184#false, 13187#(= main_~i~0 0), 13188#(= main_~i~0 1), 13189#(= main_~i~0 2), 13190#(= main_~i~0 3), 13191#(= main_~i~0 4), 13192#(= main_~i~0 5), 13193#(= main_~i~0 6), 13194#(= main_~i~0 7), 13195#(= main_~i~0 8), 13196#(= main_~i~0 9), 13197#(= main_~i~0 10), 13198#(= main_~i~0 11), 13199#(= main_~i~0 12), 13200#(= main_~i~0 13), 13201#(= main_~i~0 14), 13202#(= main_~i~0 15), 13203#(= main_~i~0 16), 13204#(= main_~i~0 17), 13205#(= main_~i~0 18), 13206#(= main_~i~0 19), 13207#(= main_~i~0 20), 13208#(= main_~i~0 21), 13209#(= main_~i~0 22), 13210#(= main_~i~0 23), 13211#(= main_~i~0 24), 13212#(= main_~i~0 25), 13213#(= main_~i~0 26), 13214#(= main_~i~0 27), 13215#(= main_~i~0 28), 13216#(= main_~i~0 29), 13217#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 13183#true] [2018-02-04 04:27:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:49,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:27:49,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:27:49,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:27:49,399 INFO L87 Difference]: Start difference. First operand 376 states and 435 transitions. Second operand 33 states. [2018-02-04 04:27:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:51,564 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-04 04:27:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:27:51,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2018-02-04 04:27:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:51,565 INFO L225 Difference]: With dead ends: 418 [2018-02-04 04:27:51,565 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 04:27:51,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:27:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 04:27:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 388. [2018-02-04 04:27:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 04:27:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 449 transitions. [2018-02-04 04:27:51,571 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 449 transitions. Word has length 157 [2018-02-04 04:27:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:51,572 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 449 transitions. [2018-02-04 04:27:51,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:27:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 449 transitions. [2018-02-04 04:27:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 04:27:51,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:51,573 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:51,573 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:51,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:51,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:51,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 04:27:51,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:51,986 INFO L182 omatonBuilderFactory]: Interpolants [14024#true, 14025#false, 14028#(= main_~i~0 0), 14029#(= main_~i~0 1), 14030#(= main_~i~0 2), 14031#(= main_~i~0 3), 14032#(= main_~i~0 4), 14033#(= main_~i~0 5), 14034#(= main_~i~0 6), 14035#(= main_~i~0 7), 14036#(= main_~i~0 8), 14037#(= main_~i~0 9), 14038#(= main_~i~0 10), 14039#(= main_~i~0 11), 14040#(= main_~i~0 12), 14041#(= main_~i~0 13), 14042#(= main_~i~0 14), 14043#(= main_~i~0 15), 14044#(= main_~i~0 16), 14045#(= main_~i~0 17), 14046#(= main_~i~0 18), 14047#(= main_~i~0 19), 14048#(= main_~i~0 20), 14049#(= main_~i~0 21), 14050#(= main_~i~0 22), 14051#(= main_~i~0 23), 14052#(= main_~i~0 24), 14053#(= main_~i~0 25), 14054#(= main_~i~0 26), 14055#(= main_~i~0 27), 14056#(= main_~i~0 28), 14057#(= main_~i~0 29), 14058#(= main_~i~0 30), 14059#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:27:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:51,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 04:27:51,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 04:27:51,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:27:51,988 INFO L87 Difference]: Start difference. First operand 388 states and 449 transitions. Second operand 34 states. [2018-02-04 04:27:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:54,230 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-04 04:27:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:27:54,230 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2018-02-04 04:27:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:54,231 INFO L225 Difference]: With dead ends: 431 [2018-02-04 04:27:54,232 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 04:27:54,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:27:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 04:27:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 400. [2018-02-04 04:27:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 04:27:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 463 transitions. [2018-02-04 04:27:54,237 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 463 transitions. Word has length 162 [2018-02-04 04:27:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:54,237 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 463 transitions. [2018-02-04 04:27:54,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 04:27:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 463 transitions. [2018-02-04 04:27:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:27:54,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:54,239 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:54,239 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:54,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:54,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:54,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 04:27:54,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:54,552 INFO L182 omatonBuilderFactory]: Interpolants [14912#(= main_~i~0 17), 14913#(= main_~i~0 18), 14914#(= main_~i~0 19), 14915#(= main_~i~0 20), 14916#(= main_~i~0 21), 14917#(= main_~i~0 22), 14918#(= main_~i~0 23), 14919#(= main_~i~0 24), 14920#(= main_~i~0 25), 14921#(= main_~i~0 26), 14922#(= main_~i~0 27), 14923#(= main_~i~0 28), 14924#(= main_~i~0 29), 14925#(= main_~i~0 30), 14926#(= main_~i~0 31), 14927#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 14891#true, 14892#false, 14895#(= main_~i~0 0), 14896#(= main_~i~0 1), 14897#(= main_~i~0 2), 14898#(= main_~i~0 3), 14899#(= main_~i~0 4), 14900#(= main_~i~0 5), 14901#(= main_~i~0 6), 14902#(= main_~i~0 7), 14903#(= main_~i~0 8), 14904#(= main_~i~0 9), 14905#(= main_~i~0 10), 14906#(= main_~i~0 11), 14907#(= main_~i~0 12), 14908#(= main_~i~0 13), 14909#(= main_~i~0 14), 14910#(= main_~i~0 15), 14911#(= main_~i~0 16)] [2018-02-04 04:27:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:54,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:27:54,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:27:54,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:27:54,554 INFO L87 Difference]: Start difference. First operand 400 states and 463 transitions. Second operand 35 states. [2018-02-04 04:27:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:56,934 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-04 04:27:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:27:56,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 04:27:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:56,935 INFO L225 Difference]: With dead ends: 444 [2018-02-04 04:27:56,935 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 04:27:56,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:27:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 04:27:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 412. [2018-02-04 04:27:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 04:27:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 477 transitions. [2018-02-04 04:27:56,941 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 477 transitions. Word has length 167 [2018-02-04 04:27:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:56,942 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 477 transitions. [2018-02-04 04:27:56,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:27:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 477 transitions. [2018-02-04 04:27:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 04:27:56,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:56,943 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:56,943 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:56,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:57,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:57,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 04:27:57,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:57,377 INFO L182 omatonBuilderFactory]: Interpolants [15808#(= main_~i~0 20), 15809#(= main_~i~0 21), 15810#(= main_~i~0 22), 15811#(= main_~i~0 23), 15812#(= main_~i~0 24), 15813#(= main_~i~0 25), 15814#(= main_~i~0 26), 15815#(= main_~i~0 27), 15816#(= main_~i~0 28), 15817#(= main_~i~0 29), 15818#(= main_~i~0 30), 15819#(= main_~i~0 31), 15820#(= main_~i~0 32), 15821#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 15784#true, 15785#false, 15788#(= main_~i~0 0), 15789#(= main_~i~0 1), 15790#(= main_~i~0 2), 15791#(= main_~i~0 3), 15792#(= main_~i~0 4), 15793#(= main_~i~0 5), 15794#(= main_~i~0 6), 15795#(= main_~i~0 7), 15796#(= main_~i~0 8), 15797#(= main_~i~0 9), 15798#(= main_~i~0 10), 15799#(= main_~i~0 11), 15800#(= main_~i~0 12), 15801#(= main_~i~0 13), 15802#(= main_~i~0 14), 15803#(= main_~i~0 15), 15804#(= main_~i~0 16), 15805#(= main_~i~0 17), 15806#(= main_~i~0 18), 15807#(= main_~i~0 19)] [2018-02-04 04:27:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:27:57,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 04:27:57,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 04:27:57,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:27:57,378 INFO L87 Difference]: Start difference. First operand 412 states and 477 transitions. Second operand 36 states. [2018-02-04 04:27:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:59,956 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-04 04:27:59,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:27:59,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 172 [2018-02-04 04:27:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:59,957 INFO L225 Difference]: With dead ends: 457 [2018-02-04 04:27:59,957 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 04:27:59,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:27:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 04:27:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 424. [2018-02-04 04:27:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 04:27:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 491 transitions. [2018-02-04 04:27:59,960 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 491 transitions. Word has length 172 [2018-02-04 04:27:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:59,961 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 491 transitions. [2018-02-04 04:27:59,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 04:27:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 491 transitions. [2018-02-04 04:27:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:27:59,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:59,961 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:59,961 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:59,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:00,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:00,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 04:28:00,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:00,301 INFO L182 omatonBuilderFactory]: Interpolants [16704#false, 16707#(= main_~i~0 0), 16708#(= main_~i~0 1), 16709#(= main_~i~0 2), 16710#(= main_~i~0 3), 16711#(= main_~i~0 4), 16712#(= main_~i~0 5), 16713#(= main_~i~0 6), 16714#(= main_~i~0 7), 16715#(= main_~i~0 8), 16716#(= main_~i~0 9), 16717#(= main_~i~0 10), 16718#(= main_~i~0 11), 16719#(= main_~i~0 12), 16720#(= main_~i~0 13), 16721#(= main_~i~0 14), 16722#(= main_~i~0 15), 16723#(= main_~i~0 16), 16724#(= main_~i~0 17), 16725#(= main_~i~0 18), 16726#(= main_~i~0 19), 16727#(= main_~i~0 20), 16728#(= main_~i~0 21), 16729#(= main_~i~0 22), 16730#(= main_~i~0 23), 16731#(= main_~i~0 24), 16732#(= main_~i~0 25), 16733#(= main_~i~0 26), 16734#(= main_~i~0 27), 16735#(= main_~i~0 28), 16736#(= main_~i~0 29), 16737#(= main_~i~0 30), 16738#(= main_~i~0 31), 16739#(= main_~i~0 32), 16740#(= main_~i~0 33), 16741#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 16703#true] [2018-02-04 04:28:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:00,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:28:00,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:28:00,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:28:00,302 INFO L87 Difference]: Start difference. First operand 424 states and 491 transitions. Second operand 37 states. [2018-02-04 04:28:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:03,362 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-04 04:28:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:28:03,363 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 177 [2018-02-04 04:28:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:03,364 INFO L225 Difference]: With dead ends: 470 [2018-02-04 04:28:03,364 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 04:28:03,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:28:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 04:28:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 436. [2018-02-04 04:28:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 04:28:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 505 transitions. [2018-02-04 04:28:03,368 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 505 transitions. Word has length 177 [2018-02-04 04:28:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:03,368 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 505 transitions. [2018-02-04 04:28:03,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:28:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 505 transitions. [2018-02-04 04:28:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:28:03,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:03,370 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:03,370 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:03,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:03,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:03,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 04:28:03,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:03,769 INFO L182 omatonBuilderFactory]: Interpolants [17664#(= main_~i~0 12), 17665#(= main_~i~0 13), 17666#(= main_~i~0 14), 17667#(= main_~i~0 15), 17668#(= main_~i~0 16), 17669#(= main_~i~0 17), 17670#(= main_~i~0 18), 17671#(= main_~i~0 19), 17672#(= main_~i~0 20), 17673#(= main_~i~0 21), 17674#(= main_~i~0 22), 17675#(= main_~i~0 23), 17676#(= main_~i~0 24), 17677#(= main_~i~0 25), 17678#(= main_~i~0 26), 17679#(= main_~i~0 27), 17680#(= main_~i~0 28), 17681#(= main_~i~0 29), 17682#(= main_~i~0 30), 17683#(= main_~i~0 31), 17684#(= main_~i~0 32), 17685#(= main_~i~0 33), 17686#(= main_~i~0 34), 17687#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 17648#true, 17649#false, 17652#(= main_~i~0 0), 17653#(= main_~i~0 1), 17654#(= main_~i~0 2), 17655#(= main_~i~0 3), 17656#(= main_~i~0 4), 17657#(= main_~i~0 5), 17658#(= main_~i~0 6), 17659#(= main_~i~0 7), 17660#(= main_~i~0 8), 17661#(= main_~i~0 9), 17662#(= main_~i~0 10), 17663#(= main_~i~0 11)] [2018-02-04 04:28:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:03,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:28:03,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:28:03,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:28:03,770 INFO L87 Difference]: Start difference. First operand 436 states and 505 transitions. Second operand 38 states. [2018-02-04 04:28:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:06,615 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-04 04:28:06,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:28:06,616 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 182 [2018-02-04 04:28:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:06,617 INFO L225 Difference]: With dead ends: 483 [2018-02-04 04:28:06,617 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 04:28:06,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:28:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 04:28:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 448. [2018-02-04 04:28:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 04:28:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 519 transitions. [2018-02-04 04:28:06,620 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 519 transitions. Word has length 182 [2018-02-04 04:28:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:06,620 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 519 transitions. [2018-02-04 04:28:06,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:28:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 519 transitions. [2018-02-04 04:28:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:28:06,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:06,621 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:06,621 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:06,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:06,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:06,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 04:28:06,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:06,999 INFO L182 omatonBuilderFactory]: Interpolants [18624#(= main_~i~0 1), 18625#(= main_~i~0 2), 18626#(= main_~i~0 3), 18627#(= main_~i~0 4), 18628#(= main_~i~0 5), 18629#(= main_~i~0 6), 18630#(= main_~i~0 7), 18631#(= main_~i~0 8), 18632#(= main_~i~0 9), 18633#(= main_~i~0 10), 18634#(= main_~i~0 11), 18635#(= main_~i~0 12), 18636#(= main_~i~0 13), 18637#(= main_~i~0 14), 18638#(= main_~i~0 15), 18639#(= main_~i~0 16), 18640#(= main_~i~0 17), 18641#(= main_~i~0 18), 18642#(= main_~i~0 19), 18643#(= main_~i~0 20), 18644#(= main_~i~0 21), 18645#(= main_~i~0 22), 18646#(= main_~i~0 23), 18647#(= main_~i~0 24), 18648#(= main_~i~0 25), 18649#(= main_~i~0 26), 18650#(= main_~i~0 27), 18651#(= main_~i~0 28), 18652#(= main_~i~0 29), 18653#(= main_~i~0 30), 18654#(= main_~i~0 31), 18655#(= main_~i~0 32), 18656#(= main_~i~0 33), 18657#(= main_~i~0 34), 18658#(= main_~i~0 35), 18659#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 18619#true, 18620#false, 18623#(= main_~i~0 0)] [2018-02-04 04:28:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:06,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:28:06,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:28:06,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:28:07,000 INFO L87 Difference]: Start difference. First operand 448 states and 519 transitions. Second operand 39 states. [2018-02-04 04:28:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:10,039 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-04 04:28:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:28:10,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 187 [2018-02-04 04:28:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:10,040 INFO L225 Difference]: With dead ends: 496 [2018-02-04 04:28:10,040 INFO L226 Difference]: Without dead ends: 496 [2018-02-04 04:28:10,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:28:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-04 04:28:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 460. [2018-02-04 04:28:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 04:28:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 533 transitions. [2018-02-04 04:28:10,043 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 533 transitions. Word has length 187 [2018-02-04 04:28:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:10,043 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 533 transitions. [2018-02-04 04:28:10,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:28:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 533 transitions. [2018-02-04 04:28:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:28:10,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:10,044 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:10,045 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:10,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:10,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:10,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 04:28:10,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:10,498 INFO L182 omatonBuilderFactory]: Interpolants [19648#(= main_~i~0 28), 19649#(= main_~i~0 29), 19650#(= main_~i~0 30), 19651#(= main_~i~0 31), 19652#(= main_~i~0 32), 19653#(= main_~i~0 33), 19654#(= main_~i~0 34), 19655#(= main_~i~0 35), 19656#(= main_~i~0 36), 19657#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 19616#true, 19617#false, 19620#(= main_~i~0 0), 19621#(= main_~i~0 1), 19622#(= main_~i~0 2), 19623#(= main_~i~0 3), 19624#(= main_~i~0 4), 19625#(= main_~i~0 5), 19626#(= main_~i~0 6), 19627#(= main_~i~0 7), 19628#(= main_~i~0 8), 19629#(= main_~i~0 9), 19630#(= main_~i~0 10), 19631#(= main_~i~0 11), 19632#(= main_~i~0 12), 19633#(= main_~i~0 13), 19634#(= main_~i~0 14), 19635#(= main_~i~0 15), 19636#(= main_~i~0 16), 19637#(= main_~i~0 17), 19638#(= main_~i~0 18), 19639#(= main_~i~0 19), 19640#(= main_~i~0 20), 19641#(= main_~i~0 21), 19642#(= main_~i~0 22), 19643#(= main_~i~0 23), 19644#(= main_~i~0 24), 19645#(= main_~i~0 25), 19646#(= main_~i~0 26), 19647#(= main_~i~0 27)] [2018-02-04 04:28:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:10,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 04:28:10,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 04:28:10,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:28:10,499 INFO L87 Difference]: Start difference. First operand 460 states and 533 transitions. Second operand 40 states. [2018-02-04 04:28:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:13,683 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-04 04:28:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:28:13,683 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2018-02-04 04:28:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:13,684 INFO L225 Difference]: With dead ends: 509 [2018-02-04 04:28:13,684 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 04:28:13,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:28:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 04:28:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 472. [2018-02-04 04:28:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-04 04:28:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 547 transitions. [2018-02-04 04:28:13,689 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 547 transitions. Word has length 192 [2018-02-04 04:28:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:13,689 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 547 transitions. [2018-02-04 04:28:13,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 04:28:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 547 transitions. [2018-02-04 04:28:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:28:13,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:13,691 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:13,691 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 04:28:13,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:14,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:14,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 04:28:14,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:14,108 INFO L182 omatonBuilderFactory]: Interpolants [20672#(= main_~i~0 29), 20673#(= main_~i~0 30), 20674#(= main_~i~0 31), 20675#(= main_~i~0 32), 20676#(= main_~i~0 33), 20677#(= main_~i~0 34), 20678#(= main_~i~0 35), 20679#(= main_~i~0 36), 20680#(= main_~i~0 37), 20681#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 20639#true, 20640#false, 20643#(= main_~i~0 0), 20644#(= main_~i~0 1), 20645#(= main_~i~0 2), 20646#(= main_~i~0 3), 20647#(= main_~i~0 4), 20648#(= main_~i~0 5), 20649#(= main_~i~0 6), 20650#(= main_~i~0 7), 20651#(= main_~i~0 8), 20652#(= main_~i~0 9), 20653#(= main_~i~0 10), 20654#(= main_~i~0 11), 20655#(= main_~i~0 12), 20656#(= main_~i~0 13), 20657#(= main_~i~0 14), 20658#(= main_~i~0 15), 20659#(= main_~i~0 16), 20660#(= main_~i~0 17), 20661#(= main_~i~0 18), 20662#(= main_~i~0 19), 20663#(= main_~i~0 20), 20664#(= main_~i~0 21), 20665#(= main_~i~0 22), 20666#(= main_~i~0 23), 20667#(= main_~i~0 24), 20668#(= main_~i~0 25), 20669#(= main_~i~0 26), 20670#(= main_~i~0 27), 20671#(= main_~i~0 28)] [2018-02-04 04:28:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:14,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:28:14,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:28:14,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:28:14,109 INFO L87 Difference]: Start difference. First operand 472 states and 547 transitions. Second operand 41 states. [2018-02-04 04:28:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:17,360 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-04 04:28:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:28:17,360 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 197 [2018-02-04 04:28:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:17,362 INFO L225 Difference]: With dead ends: 522 [2018-02-04 04:28:17,362 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 04:28:17,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:28:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 04:28:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 484. [2018-02-04 04:28:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-02-04 04:28:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 561 transitions. [2018-02-04 04:28:17,365 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 561 transitions. Word has length 197 [2018-02-04 04:28:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:17,365 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 561 transitions. [2018-02-04 04:28:17,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:28:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 561 transitions. [2018-02-04 04:28:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:28:17,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:17,366 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:17,366 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:17,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:17,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:17,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 04:28:17,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:17,766 INFO L182 omatonBuilderFactory]: Interpolants [21696#(= main_~i~0 4), 21697#(= main_~i~0 5), 21698#(= main_~i~0 6), 21699#(= main_~i~0 7), 21700#(= main_~i~0 8), 21701#(= main_~i~0 9), 21702#(= main_~i~0 10), 21703#(= main_~i~0 11), 21704#(= main_~i~0 12), 21705#(= main_~i~0 13), 21706#(= main_~i~0 14), 21707#(= main_~i~0 15), 21708#(= main_~i~0 16), 21709#(= main_~i~0 17), 21710#(= main_~i~0 18), 21711#(= main_~i~0 19), 21712#(= main_~i~0 20), 21713#(= main_~i~0 21), 21714#(= main_~i~0 22), 21715#(= main_~i~0 23), 21716#(= main_~i~0 24), 21717#(= main_~i~0 25), 21718#(= main_~i~0 26), 21719#(= main_~i~0 27), 21720#(= main_~i~0 28), 21721#(= main_~i~0 29), 21722#(= main_~i~0 30), 21723#(= main_~i~0 31), 21724#(= main_~i~0 32), 21725#(= main_~i~0 33), 21726#(= main_~i~0 34), 21727#(= main_~i~0 35), 21728#(= main_~i~0 36), 21729#(= main_~i~0 37), 21730#(= main_~i~0 38), 21731#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 21688#true, 21689#false, 21692#(= main_~i~0 0), 21693#(= main_~i~0 1), 21694#(= main_~i~0 2), 21695#(= main_~i~0 3)] [2018-02-04 04:28:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:17,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:28:17,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:28:17,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:28:17,767 INFO L87 Difference]: Start difference. First operand 484 states and 561 transitions. Second operand 42 states. [2018-02-04 04:28:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:21,209 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-04 04:28:21,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:28:21,209 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-02-04 04:28:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:21,210 INFO L225 Difference]: With dead ends: 535 [2018-02-04 04:28:21,210 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 04:28:21,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:28:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 04:28:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 496. [2018-02-04 04:28:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-02-04 04:28:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 575 transitions. [2018-02-04 04:28:21,214 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 575 transitions. Word has length 202 [2018-02-04 04:28:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:21,214 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 575 transitions. [2018-02-04 04:28:21,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:28:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 575 transitions. [2018-02-04 04:28:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:28:21,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:21,215 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:21,215 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:21,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:21,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:21,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 04:28:21,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:21,642 INFO L182 omatonBuilderFactory]: Interpolants [22784#(= main_~i~0 17), 22785#(= main_~i~0 18), 22786#(= main_~i~0 19), 22787#(= main_~i~0 20), 22788#(= main_~i~0 21), 22789#(= main_~i~0 22), 22790#(= main_~i~0 23), 22791#(= main_~i~0 24), 22792#(= main_~i~0 25), 22793#(= main_~i~0 26), 22794#(= main_~i~0 27), 22795#(= main_~i~0 28), 22796#(= main_~i~0 29), 22797#(= main_~i~0 30), 22798#(= main_~i~0 31), 22799#(= main_~i~0 32), 22800#(= main_~i~0 33), 22801#(= main_~i~0 34), 22802#(= main_~i~0 35), 22803#(= main_~i~0 36), 22804#(= main_~i~0 37), 22805#(= main_~i~0 38), 22806#(= main_~i~0 39), 22807#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 22763#true, 22764#false, 22767#(= main_~i~0 0), 22768#(= main_~i~0 1), 22769#(= main_~i~0 2), 22770#(= main_~i~0 3), 22771#(= main_~i~0 4), 22772#(= main_~i~0 5), 22773#(= main_~i~0 6), 22774#(= main_~i~0 7), 22775#(= main_~i~0 8), 22776#(= main_~i~0 9), 22777#(= main_~i~0 10), 22778#(= main_~i~0 11), 22779#(= main_~i~0 12), 22780#(= main_~i~0 13), 22781#(= main_~i~0 14), 22782#(= main_~i~0 15), 22783#(= main_~i~0 16)] [2018-02-04 04:28:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:21,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 04:28:21,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 04:28:21,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:28:21,643 INFO L87 Difference]: Start difference. First operand 496 states and 575 transitions. Second operand 43 states. [2018-02-04 04:28:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:25,204 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-04 04:28:25,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:28:25,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 207 [2018-02-04 04:28:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:25,205 INFO L225 Difference]: With dead ends: 548 [2018-02-04 04:28:25,205 INFO L226 Difference]: Without dead ends: 548 [2018-02-04 04:28:25,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:28:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-04 04:28:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 508. [2018-02-04 04:28:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 04:28:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 589 transitions. [2018-02-04 04:28:25,209 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 589 transitions. Word has length 207 [2018-02-04 04:28:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:25,209 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 589 transitions. [2018-02-04 04:28:25,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 04:28:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 589 transitions. [2018-02-04 04:28:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 04:28:25,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:25,210 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:25,210 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:25,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:25,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:25,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 04:28:25,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:25,680 INFO L182 omatonBuilderFactory]: Interpolants [23872#(= main_~i~0 4), 23873#(= main_~i~0 5), 23874#(= main_~i~0 6), 23875#(= main_~i~0 7), 23876#(= main_~i~0 8), 23877#(= main_~i~0 9), 23878#(= main_~i~0 10), 23879#(= main_~i~0 11), 23880#(= main_~i~0 12), 23881#(= main_~i~0 13), 23882#(= main_~i~0 14), 23883#(= main_~i~0 15), 23884#(= main_~i~0 16), 23885#(= main_~i~0 17), 23886#(= main_~i~0 18), 23887#(= main_~i~0 19), 23888#(= main_~i~0 20), 23889#(= main_~i~0 21), 23890#(= main_~i~0 22), 23891#(= main_~i~0 23), 23892#(= main_~i~0 24), 23893#(= main_~i~0 25), 23894#(= main_~i~0 26), 23895#(= main_~i~0 27), 23896#(= main_~i~0 28), 23897#(= main_~i~0 29), 23898#(= main_~i~0 30), 23899#(= main_~i~0 31), 23900#(= main_~i~0 32), 23901#(= main_~i~0 33), 23902#(= main_~i~0 34), 23903#(= main_~i~0 35), 23904#(= main_~i~0 36), 23905#(= main_~i~0 37), 23906#(= main_~i~0 38), 23907#(= main_~i~0 39), 23908#(= main_~i~0 40), 23909#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 23864#true, 23865#false, 23868#(= main_~i~0 0), 23869#(= main_~i~0 1), 23870#(= main_~i~0 2), 23871#(= main_~i~0 3)] [2018-02-04 04:28:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:25,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:28:25,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:28:25,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:28:25,681 INFO L87 Difference]: Start difference. First operand 508 states and 589 transitions. Second operand 44 states. [2018-02-04 04:28:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:29,432 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-02-04 04:28:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:28:29,432 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-02-04 04:28:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:29,433 INFO L225 Difference]: With dead ends: 561 [2018-02-04 04:28:29,433 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 04:28:29,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:28:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 04:28:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 520. [2018-02-04 04:28:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-02-04 04:28:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 603 transitions. [2018-02-04 04:28:29,437 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 603 transitions. Word has length 212 [2018-02-04 04:28:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:29,437 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 603 transitions. [2018-02-04 04:28:29,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:28:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 603 transitions. [2018-02-04 04:28:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 04:28:29,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:29,438 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:29,438 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1629807490, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:29,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:29,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:29,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 04:28:29,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:29,913 INFO L182 omatonBuilderFactory]: Interpolants [25024#(= main_~i~0 29), 25025#(= main_~i~0 30), 25026#(= main_~i~0 31), 25027#(= main_~i~0 32), 25028#(= main_~i~0 33), 25029#(= main_~i~0 34), 25030#(= main_~i~0 35), 25031#(= main_~i~0 36), 25032#(= main_~i~0 37), 25033#(= main_~i~0 38), 25034#(= main_~i~0 39), 25035#(= main_~i~0 40), 25036#(= main_~i~0 41), 25037#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 24991#true, 24992#false, 24995#(= main_~i~0 0), 24996#(= main_~i~0 1), 24997#(= main_~i~0 2), 24998#(= main_~i~0 3), 24999#(= main_~i~0 4), 25000#(= main_~i~0 5), 25001#(= main_~i~0 6), 25002#(= main_~i~0 7), 25003#(= main_~i~0 8), 25004#(= main_~i~0 9), 25005#(= main_~i~0 10), 25006#(= main_~i~0 11), 25007#(= main_~i~0 12), 25008#(= main_~i~0 13), 25009#(= main_~i~0 14), 25010#(= main_~i~0 15), 25011#(= main_~i~0 16), 25012#(= main_~i~0 17), 25013#(= main_~i~0 18), 25014#(= main_~i~0 19), 25015#(= main_~i~0 20), 25016#(= main_~i~0 21), 25017#(= main_~i~0 22), 25018#(= main_~i~0 23), 25019#(= main_~i~0 24), 25020#(= main_~i~0 25), 25021#(= main_~i~0 26), 25022#(= main_~i~0 27), 25023#(= main_~i~0 28)] [2018-02-04 04:28:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:29,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:28:29,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:28:29,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:28:29,914 INFO L87 Difference]: Start difference. First operand 520 states and 603 transitions. Second operand 45 states. [2018-02-04 04:28:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:33,738 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-02-04 04:28:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:28:33,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 217 [2018-02-04 04:28:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:33,739 INFO L225 Difference]: With dead ends: 574 [2018-02-04 04:28:33,739 INFO L226 Difference]: Without dead ends: 574 [2018-02-04 04:28:33,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:28:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-04 04:28:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 532. [2018-02-04 04:28:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-02-04 04:28:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 617 transitions. [2018-02-04 04:28:33,744 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 617 transitions. Word has length 217 [2018-02-04 04:28:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:33,744 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 617 transitions. [2018-02-04 04:28:33,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:28:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 617 transitions. [2018-02-04 04:28:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 04:28:33,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:33,745 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:33,745 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash 324521397, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:33,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:34,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:34,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 04:28:34,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:34,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-02-04 04:28:34,216 INFO L182 omatonBuilderFactory]: Interpolants [26176#(= main_~i~0 28), 26177#(= main_~i~0 29), 26178#(= main_~i~0 30), 26179#(= main_~i~0 31), 26180#(= main_~i~0 32), 26181#(= main_~i~0 33), 26182#(= main_~i~0 34), 26183#(= main_~i~0 35), 26184#(= main_~i~0 36), 26185#(= main_~i~0 37), 26186#(= main_~i~0 38), 26187#(= main_~i~0 39), 26188#(= main_~i~0 40), 26189#(= main_~i~0 41), 26190#(= main_~i~0 42), 26191#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 26144#true, 26145#false, 26148#(= main_~i~0 0), 26149#(= main_~i~0 1), 26150#(= main_~i~0 2), 26151#(= main_~i~0 3), 26152#(= main_~i~0 4), 26153#(= main_~i~0 5), 26154#(= main_~i~0 6), 26155#(= main_~i~0 7), 26156#(= main_~i~0 8), 26157#(= main_~i~0 9), 26158#(= main_~i~0 10), 26159#(= main_~i~0 11), 26160#(= main_~i~0 12), 26161#(= main_~i~0 13), 26162#(= main_~i~0 14), 26163#(= main_~i~0 15), 26164#(= main_~i~0 16), 26165#(= main_~i~0 17), 26166#(= main_~i~0 18), 26167#(= main_~i~0 19), 26168#(= main_~i~0 20), 26169#(= main_~i~0 21), 26170#(= main_~i~0 22), 26171#(= main_~i~0 23), 26172#(= main_~i~0 24), 26173#(= main_~i~0 25), 26174#(= main_~i~0 26), 26175#(= main_~i~0 27)] [2018-02-04 04:28:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:34,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 04:28:34,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 04:28:34,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:28:34,217 INFO L87 Difference]: Start difference. First operand 532 states and 617 transitions. Second operand 46 states. [2018-02-04 04:28:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:38,309 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-02-04 04:28:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:28:38,310 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 222 [2018-02-04 04:28:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:38,311 INFO L225 Difference]: With dead ends: 587 [2018-02-04 04:28:38,311 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 04:28:38,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:28:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 04:28:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 544. [2018-02-04 04:28:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-04 04:28:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 631 transitions. [2018-02-04 04:28:38,315 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 631 transitions. Word has length 222 [2018-02-04 04:28:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:38,316 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 631 transitions. [2018-02-04 04:28:38,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 04:28:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 631 transitions. [2018-02-04 04:28:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:28:38,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:38,317 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:38,317 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1945913054, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:38,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:38,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:38,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 04:28:38,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:38,820 INFO L182 omatonBuilderFactory]: Interpolants [27328#(= main_~i~0 1), 27329#(= main_~i~0 2), 27330#(= main_~i~0 3), 27331#(= main_~i~0 4), 27332#(= main_~i~0 5), 27333#(= main_~i~0 6), 27334#(= main_~i~0 7), 27335#(= main_~i~0 8), 27336#(= main_~i~0 9), 27337#(= main_~i~0 10), 27338#(= main_~i~0 11), 27339#(= main_~i~0 12), 27340#(= main_~i~0 13), 27341#(= main_~i~0 14), 27342#(= main_~i~0 15), 27343#(= main_~i~0 16), 27344#(= main_~i~0 17), 27345#(= main_~i~0 18), 27346#(= main_~i~0 19), 27347#(= main_~i~0 20), 27348#(= main_~i~0 21), 27349#(= main_~i~0 22), 27350#(= main_~i~0 23), 27351#(= main_~i~0 24), 27352#(= main_~i~0 25), 27353#(= main_~i~0 26), 27354#(= main_~i~0 27), 27355#(= main_~i~0 28), 27356#(= main_~i~0 29), 27357#(= main_~i~0 30), 27358#(= main_~i~0 31), 27359#(= main_~i~0 32), 27360#(= main_~i~0 33), 27361#(= main_~i~0 34), 27362#(= main_~i~0 35), 27363#(= main_~i~0 36), 27364#(= main_~i~0 37), 27365#(= main_~i~0 38), 27366#(= main_~i~0 39), 27367#(= main_~i~0 40), 27368#(= main_~i~0 41), 27369#(= main_~i~0 42), 27370#(= main_~i~0 43), 27371#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 27323#true, 27324#false, 27327#(= main_~i~0 0)] [2018-02-04 04:28:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:38,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:28:38,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:28:38,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:28:38,821 INFO L87 Difference]: Start difference. First operand 544 states and 631 transitions. Second operand 47 states. [2018-02-04 04:28:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:43,099 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-02-04 04:28:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:28:43,099 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 227 [2018-02-04 04:28:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:43,101 INFO L225 Difference]: With dead ends: 600 [2018-02-04 04:28:43,101 INFO L226 Difference]: Without dead ends: 600 [2018-02-04 04:28:43,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:28:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-04 04:28:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 556. [2018-02-04 04:28:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-02-04 04:28:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 645 transitions. [2018-02-04 04:28:43,104 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 645 transitions. Word has length 227 [2018-02-04 04:28:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:43,104 INFO L432 AbstractCegarLoop]: Abstraction has 556 states and 645 transitions. [2018-02-04 04:28:43,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:28:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 645 transitions. [2018-02-04 04:28:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 04:28:43,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:43,105 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:43,105 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1707991211, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:43,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:43,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:43,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 04:28:43,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:43,626 INFO L182 omatonBuilderFactory]: Interpolants [28544#(= main_~i~0 12), 28545#(= main_~i~0 13), 28546#(= main_~i~0 14), 28547#(= main_~i~0 15), 28548#(= main_~i~0 16), 28549#(= main_~i~0 17), 28550#(= main_~i~0 18), 28551#(= main_~i~0 19), 28552#(= main_~i~0 20), 28553#(= main_~i~0 21), 28554#(= main_~i~0 22), 28555#(= main_~i~0 23), 28556#(= main_~i~0 24), 28557#(= main_~i~0 25), 28558#(= main_~i~0 26), 28559#(= main_~i~0 27), 28560#(= main_~i~0 28), 28561#(= main_~i~0 29), 28562#(= main_~i~0 30), 28563#(= main_~i~0 31), 28564#(= main_~i~0 32), 28565#(= main_~i~0 33), 28566#(= main_~i~0 34), 28567#(= main_~i~0 35), 28568#(= main_~i~0 36), 28569#(= main_~i~0 37), 28570#(= main_~i~0 38), 28571#(= main_~i~0 39), 28572#(= main_~i~0 40), 28573#(= main_~i~0 41), 28574#(= main_~i~0 42), 28575#(= main_~i~0 43), 28576#(= main_~i~0 44), 28577#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 28528#true, 28529#false, 28532#(= main_~i~0 0), 28533#(= main_~i~0 1), 28534#(= main_~i~0 2), 28535#(= main_~i~0 3), 28536#(= main_~i~0 4), 28537#(= main_~i~0 5), 28538#(= main_~i~0 6), 28539#(= main_~i~0 7), 28540#(= main_~i~0 8), 28541#(= main_~i~0 9), 28542#(= main_~i~0 10), 28543#(= main_~i~0 11)] [2018-02-04 04:28:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:43,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 04:28:43,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 04:28:43,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:28:43,626 INFO L87 Difference]: Start difference. First operand 556 states and 645 transitions. Second operand 48 states. [2018-02-04 04:28:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:48,105 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-02-04 04:28:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:28:48,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 232 [2018-02-04 04:28:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:48,106 INFO L225 Difference]: With dead ends: 613 [2018-02-04 04:28:48,106 INFO L226 Difference]: Without dead ends: 613 [2018-02-04 04:28:48,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:28:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-04 04:28:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 568. [2018-02-04 04:28:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-04 04:28:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 659 transitions. [2018-02-04 04:28:48,110 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 659 transitions. Word has length 232 [2018-02-04 04:28:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:48,110 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 659 transitions. [2018-02-04 04:28:48,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 04:28:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 659 transitions. [2018-02-04 04:28:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:28:48,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:48,111 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:48,111 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1861482814, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:48,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:48,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:48,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 04:28:48,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:48,656 INFO L182 omatonBuilderFactory]: Interpolants [29759#true, 29760#false, 29763#(= main_~i~0 0), 29764#(= main_~i~0 1), 29765#(= main_~i~0 2), 29766#(= main_~i~0 3), 29767#(= main_~i~0 4), 29768#(= main_~i~0 5), 29769#(= main_~i~0 6), 29770#(= main_~i~0 7), 29771#(= main_~i~0 8), 29772#(= main_~i~0 9), 29773#(= main_~i~0 10), 29774#(= main_~i~0 11), 29775#(= main_~i~0 12), 29776#(= main_~i~0 13), 29777#(= main_~i~0 14), 29778#(= main_~i~0 15), 29779#(= main_~i~0 16), 29780#(= main_~i~0 17), 29781#(= main_~i~0 18), 29782#(= main_~i~0 19), 29783#(= main_~i~0 20), 29784#(= main_~i~0 21), 29785#(= main_~i~0 22), 29786#(= main_~i~0 23), 29787#(= main_~i~0 24), 29788#(= main_~i~0 25), 29789#(= main_~i~0 26), 29790#(= main_~i~0 27), 29791#(= main_~i~0 28), 29792#(= main_~i~0 29), 29793#(= main_~i~0 30), 29794#(= main_~i~0 31), 29795#(= main_~i~0 32), 29796#(= main_~i~0 33), 29797#(= main_~i~0 34), 29798#(= main_~i~0 35), 29799#(= main_~i~0 36), 29800#(= main_~i~0 37), 29801#(= main_~i~0 38), 29802#(= main_~i~0 39), 29803#(= main_~i~0 40), 29804#(= main_~i~0 41), 29805#(= main_~i~0 42), 29806#(= main_~i~0 43), 29807#(= main_~i~0 44), 29808#(= main_~i~0 45), 29809#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:28:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:48,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:28:48,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:28:48,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:28:48,657 INFO L87 Difference]: Start difference. First operand 568 states and 659 transitions. Second operand 49 states. [2018-02-04 04:28:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:53,270 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-02-04 04:28:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:28:53,270 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 237 [2018-02-04 04:28:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:53,272 INFO L225 Difference]: With dead ends: 626 [2018-02-04 04:28:53,272 INFO L226 Difference]: Without dead ends: 626 [2018-02-04 04:28:53,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:28:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-04 04:28:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 580. [2018-02-04 04:28:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-02-04 04:28:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 673 transitions. [2018-02-04 04:28:53,275 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 673 transitions. Word has length 237 [2018-02-04 04:28:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:53,276 INFO L432 AbstractCegarLoop]: Abstraction has 580 states and 673 transitions. [2018-02-04 04:28:53,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:28:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 673 transitions. [2018-02-04 04:28:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 04:28:53,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:53,276 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:53,276 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1141565685, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:53,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:53,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:53,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 04:28:53,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:53,870 INFO L182 omatonBuilderFactory]: Interpolants [31016#true, 31017#false, 31020#(= main_~i~0 0), 31021#(= main_~i~0 1), 31022#(= main_~i~0 2), 31023#(= main_~i~0 3), 31024#(= main_~i~0 4), 31025#(= main_~i~0 5), 31026#(= main_~i~0 6), 31027#(= main_~i~0 7), 31028#(= main_~i~0 8), 31029#(= main_~i~0 9), 31030#(= main_~i~0 10), 31031#(= main_~i~0 11), 31032#(= main_~i~0 12), 31033#(= main_~i~0 13), 31034#(= main_~i~0 14), 31035#(= main_~i~0 15), 31036#(= main_~i~0 16), 31037#(= main_~i~0 17), 31038#(= main_~i~0 18), 31039#(= main_~i~0 19), 31040#(= main_~i~0 20), 31041#(= main_~i~0 21), 31042#(= main_~i~0 22), 31043#(= main_~i~0 23), 31044#(= main_~i~0 24), 31045#(= main_~i~0 25), 31046#(= main_~i~0 26), 31047#(= main_~i~0 27), 31048#(= main_~i~0 28), 31049#(= main_~i~0 29), 31050#(= main_~i~0 30), 31051#(= main_~i~0 31), 31052#(= main_~i~0 32), 31053#(= main_~i~0 33), 31054#(= main_~i~0 34), 31055#(= main_~i~0 35), 31056#(= main_~i~0 36), 31057#(= main_~i~0 37), 31058#(= main_~i~0 38), 31059#(= main_~i~0 39), 31060#(= main_~i~0 40), 31061#(= main_~i~0 41), 31062#(= main_~i~0 42), 31063#(= main_~i~0 43), 31064#(= main_~i~0 44), 31065#(= main_~i~0 45), 31066#(= main_~i~0 46), 31067#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:28:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:53,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:28:53,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:28:53,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:28:53,870 INFO L87 Difference]: Start difference. First operand 580 states and 673 transitions. Second operand 50 states. [2018-02-04 04:28:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:58,761 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-02-04 04:28:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:28:58,761 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 242 [2018-02-04 04:28:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:58,763 INFO L225 Difference]: With dead ends: 639 [2018-02-04 04:28:58,763 INFO L226 Difference]: Without dead ends: 639 [2018-02-04 04:28:58,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:28:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-04 04:28:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 592. [2018-02-04 04:28:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-02-04 04:28:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 687 transitions. [2018-02-04 04:28:58,766 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 687 transitions. Word has length 242 [2018-02-04 04:28:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:58,767 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 687 transitions. [2018-02-04 04:28:58,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:28:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 687 transitions. [2018-02-04 04:28:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 04:28:58,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:58,768 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 04:28:58,768 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:28:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 993538974, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:28:58,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:59,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:59,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 04:28:59,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:59,367 INFO L182 omatonBuilderFactory]: Interpolants [32299#true, 32300#false, 32303#(= main_~i~0 0), 32304#(= main_~i~0 1), 32305#(= main_~i~0 2), 32306#(= main_~i~0 3), 32307#(= main_~i~0 4), 32308#(= main_~i~0 5), 32309#(= main_~i~0 6), 32310#(= main_~i~0 7), 32311#(= main_~i~0 8), 32312#(= main_~i~0 9), 32313#(= main_~i~0 10), 32314#(= main_~i~0 11), 32315#(= main_~i~0 12), 32316#(= main_~i~0 13), 32317#(= main_~i~0 14), 32318#(= main_~i~0 15), 32319#(= main_~i~0 16), 32320#(= main_~i~0 17), 32321#(= main_~i~0 18), 32322#(= main_~i~0 19), 32323#(= main_~i~0 20), 32324#(= main_~i~0 21), 32325#(= main_~i~0 22), 32326#(= main_~i~0 23), 32327#(= main_~i~0 24), 32328#(= main_~i~0 25), 32329#(= main_~i~0 26), 32330#(= main_~i~0 27), 32331#(= main_~i~0 28), 32332#(= main_~i~0 29), 32333#(= main_~i~0 30), 32334#(= main_~i~0 31), 32335#(= main_~i~0 32), 32336#(= main_~i~0 33), 32337#(= main_~i~0 34), 32338#(= main_~i~0 35), 32339#(= main_~i~0 36), 32340#(= main_~i~0 37), 32341#(= main_~i~0 38), 32342#(= main_~i~0 39), 32343#(= main_~i~0 40), 32344#(= main_~i~0 41), 32345#(= main_~i~0 42), 32346#(= main_~i~0 43), 32347#(= main_~i~0 44), 32348#(= main_~i~0 45), 32349#(= main_~i~0 46), 32350#(= main_~i~0 47), 32351#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:28:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:28:59,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:28:59,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:28:59,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:28:59,367 INFO L87 Difference]: Start difference. First operand 592 states and 687 transitions. Second operand 51 states. [2018-02-04 04:29:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:04,836 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-02-04 04:29:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:29:04,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 247 [2018-02-04 04:29:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:04,838 INFO L225 Difference]: With dead ends: 652 [2018-02-04 04:29:04,838 INFO L226 Difference]: Without dead ends: 652 [2018-02-04 04:29:04,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:29:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-02-04 04:29:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 604. [2018-02-04 04:29:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-02-04 04:29:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 701 transitions. [2018-02-04 04:29:04,841 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 701 transitions. Word has length 247 [2018-02-04 04:29:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:04,841 INFO L432 AbstractCegarLoop]: Abstraction has 604 states and 701 transitions. [2018-02-04 04:29:04,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:29:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 701 transitions. [2018-02-04 04:29:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 04:29:04,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:04,842 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:04,842 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 522988181, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:04,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:05,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:05,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 04:29:05,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:05,451 INFO L182 omatonBuilderFactory]: Interpolants [33608#true, 33609#false, 33612#(= main_~i~0 0), 33613#(= main_~i~0 1), 33614#(= main_~i~0 2), 33615#(= main_~i~0 3), 33616#(= main_~i~0 4), 33617#(= main_~i~0 5), 33618#(= main_~i~0 6), 33619#(= main_~i~0 7), 33620#(= main_~i~0 8), 33621#(= main_~i~0 9), 33622#(= main_~i~0 10), 33623#(= main_~i~0 11), 33624#(= main_~i~0 12), 33625#(= main_~i~0 13), 33626#(= main_~i~0 14), 33627#(= main_~i~0 15), 33628#(= main_~i~0 16), 33629#(= main_~i~0 17), 33630#(= main_~i~0 18), 33631#(= main_~i~0 19), 33632#(= main_~i~0 20), 33633#(= main_~i~0 21), 33634#(= main_~i~0 22), 33635#(= main_~i~0 23), 33636#(= main_~i~0 24), 33637#(= main_~i~0 25), 33638#(= main_~i~0 26), 33639#(= main_~i~0 27), 33640#(= main_~i~0 28), 33641#(= main_~i~0 29), 33642#(= main_~i~0 30), 33643#(= main_~i~0 31), 33644#(= main_~i~0 32), 33645#(= main_~i~0 33), 33646#(= main_~i~0 34), 33647#(= main_~i~0 35), 33648#(= main_~i~0 36), 33649#(= main_~i~0 37), 33650#(= main_~i~0 38), 33651#(= main_~i~0 39), 33652#(= main_~i~0 40), 33653#(= main_~i~0 41), 33654#(= main_~i~0 42), 33655#(= main_~i~0 43), 33656#(= main_~i~0 44), 33657#(= main_~i~0 45), 33658#(= main_~i~0 46), 33659#(= main_~i~0 47), 33660#(= main_~i~0 48), 33661#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:29:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:05,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 04:29:05,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 04:29:05,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:29:05,452 INFO L87 Difference]: Start difference. First operand 604 states and 701 transitions. Second operand 52 states. [2018-02-04 04:29:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:10,722 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-02-04 04:29:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 04:29:10,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 252 [2018-02-04 04:29:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:10,723 INFO L225 Difference]: With dead ends: 665 [2018-02-04 04:29:10,723 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 04:29:10,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:29:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 04:29:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 616. [2018-02-04 04:29:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-02-04 04:29:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 715 transitions. [2018-02-04 04:29:10,727 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 715 transitions. Word has length 252 [2018-02-04 04:29:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:10,727 INFO L432 AbstractCegarLoop]: Abstraction has 616 states and 715 transitions. [2018-02-04 04:29:10,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 04:29:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 715 transitions. [2018-02-04 04:29:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 04:29:10,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:10,728 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:10,728 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 683603454, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:10,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:11,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:11,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 04:29:11,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:11,355 INFO L182 omatonBuilderFactory]: Interpolants [34944#false, 34947#(= main_~i~0 0), 34948#(= main_~i~0 1), 34949#(= main_~i~0 2), 34950#(= main_~i~0 3), 34951#(= main_~i~0 4), 34952#(= main_~i~0 5), 34953#(= main_~i~0 6), 34954#(= main_~i~0 7), 34955#(= main_~i~0 8), 34956#(= main_~i~0 9), 34957#(= main_~i~0 10), 34958#(= main_~i~0 11), 34959#(= main_~i~0 12), 34960#(= main_~i~0 13), 34961#(= main_~i~0 14), 34962#(= main_~i~0 15), 34963#(= main_~i~0 16), 34964#(= main_~i~0 17), 34965#(= main_~i~0 18), 34966#(= main_~i~0 19), 34967#(= main_~i~0 20), 34968#(= main_~i~0 21), 34969#(= main_~i~0 22), 34970#(= main_~i~0 23), 34971#(= main_~i~0 24), 34972#(= main_~i~0 25), 34973#(= main_~i~0 26), 34974#(= main_~i~0 27), 34975#(= main_~i~0 28), 34976#(= main_~i~0 29), 34977#(= main_~i~0 30), 34978#(= main_~i~0 31), 34979#(= main_~i~0 32), 34980#(= main_~i~0 33), 34981#(= main_~i~0 34), 34982#(= main_~i~0 35), 34983#(= main_~i~0 36), 34984#(= main_~i~0 37), 34985#(= main_~i~0 38), 34986#(= main_~i~0 39), 34987#(= main_~i~0 40), 34988#(= main_~i~0 41), 34989#(= main_~i~0 42), 34990#(= main_~i~0 43), 34991#(= main_~i~0 44), 34992#(= main_~i~0 45), 34993#(= main_~i~0 46), 34994#(= main_~i~0 47), 34995#(= main_~i~0 48), 34996#(= main_~i~0 49), 34997#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 34943#true] [2018-02-04 04:29:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:11,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:29:11,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:29:11,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:29:11,356 INFO L87 Difference]: Start difference. First operand 616 states and 715 transitions. Second operand 53 states. [2018-02-04 04:29:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:16,935 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-02-04 04:29:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:29:16,936 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 257 [2018-02-04 04:29:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:16,937 INFO L225 Difference]: With dead ends: 678 [2018-02-04 04:29:16,937 INFO L226 Difference]: Without dead ends: 678 [2018-02-04 04:29:16,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:29:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-02-04 04:29:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 628. [2018-02-04 04:29:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-02-04 04:29:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 729 transitions. [2018-02-04 04:29:16,941 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 729 transitions. Word has length 257 [2018-02-04 04:29:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:16,941 INFO L432 AbstractCegarLoop]: Abstraction has 628 states and 729 transitions. [2018-02-04 04:29:16,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:29:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 729 transitions. [2018-02-04 04:29:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 04:29:16,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:16,942 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:16,942 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:16,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1700783157, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:16,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:17,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:17,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 04:29:17,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:17,571 INFO L182 omatonBuilderFactory]: Interpolants [36352#(= main_~i~0 44), 36353#(= main_~i~0 45), 36354#(= main_~i~0 46), 36355#(= main_~i~0 47), 36356#(= main_~i~0 48), 36357#(= main_~i~0 49), 36358#(= main_~i~0 50), 36359#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 36304#true, 36305#false, 36308#(= main_~i~0 0), 36309#(= main_~i~0 1), 36310#(= main_~i~0 2), 36311#(= main_~i~0 3), 36312#(= main_~i~0 4), 36313#(= main_~i~0 5), 36314#(= main_~i~0 6), 36315#(= main_~i~0 7), 36316#(= main_~i~0 8), 36317#(= main_~i~0 9), 36318#(= main_~i~0 10), 36319#(= main_~i~0 11), 36320#(= main_~i~0 12), 36321#(= main_~i~0 13), 36322#(= main_~i~0 14), 36323#(= main_~i~0 15), 36324#(= main_~i~0 16), 36325#(= main_~i~0 17), 36326#(= main_~i~0 18), 36327#(= main_~i~0 19), 36328#(= main_~i~0 20), 36329#(= main_~i~0 21), 36330#(= main_~i~0 22), 36331#(= main_~i~0 23), 36332#(= main_~i~0 24), 36333#(= main_~i~0 25), 36334#(= main_~i~0 26), 36335#(= main_~i~0 27), 36336#(= main_~i~0 28), 36337#(= main_~i~0 29), 36338#(= main_~i~0 30), 36339#(= main_~i~0 31), 36340#(= main_~i~0 32), 36341#(= main_~i~0 33), 36342#(= main_~i~0 34), 36343#(= main_~i~0 35), 36344#(= main_~i~0 36), 36345#(= main_~i~0 37), 36346#(= main_~i~0 38), 36347#(= main_~i~0 39), 36348#(= main_~i~0 40), 36349#(= main_~i~0 41), 36350#(= main_~i~0 42), 36351#(= main_~i~0 43)] [2018-02-04 04:29:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:17,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 04:29:17,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 04:29:17,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:29:17,572 INFO L87 Difference]: Start difference. First operand 628 states and 729 transitions. Second operand 54 states. [2018-02-04 04:29:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:23,145 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-02-04 04:29:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 04:29:23,146 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 262 [2018-02-04 04:29:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:23,147 INFO L225 Difference]: With dead ends: 691 [2018-02-04 04:29:23,147 INFO L226 Difference]: Without dead ends: 691 [2018-02-04 04:29:23,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:29:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-02-04 04:29:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 640. [2018-02-04 04:29:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-02-04 04:29:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 743 transitions. [2018-02-04 04:29:23,151 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 743 transitions. Word has length 262 [2018-02-04 04:29:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:23,151 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 743 transitions. [2018-02-04 04:29:23,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 04:29:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 743 transitions. [2018-02-04 04:29:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 04:29:23,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:23,152 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:23,152 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1946271650, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:23,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:23,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:23,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 04:29:23,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:23,816 INFO L182 omatonBuilderFactory]: Interpolants [37691#true, 37692#false, 37695#(= main_~i~0 0), 37696#(= main_~i~0 1), 37697#(= main_~i~0 2), 37698#(= main_~i~0 3), 37699#(= main_~i~0 4), 37700#(= main_~i~0 5), 37701#(= main_~i~0 6), 37702#(= main_~i~0 7), 37703#(= main_~i~0 8), 37704#(= main_~i~0 9), 37705#(= main_~i~0 10), 37706#(= main_~i~0 11), 37707#(= main_~i~0 12), 37708#(= main_~i~0 13), 37709#(= main_~i~0 14), 37710#(= main_~i~0 15), 37711#(= main_~i~0 16), 37712#(= main_~i~0 17), 37713#(= main_~i~0 18), 37714#(= main_~i~0 19), 37715#(= main_~i~0 20), 37716#(= main_~i~0 21), 37717#(= main_~i~0 22), 37718#(= main_~i~0 23), 37719#(= main_~i~0 24), 37720#(= main_~i~0 25), 37721#(= main_~i~0 26), 37722#(= main_~i~0 27), 37723#(= main_~i~0 28), 37724#(= main_~i~0 29), 37725#(= main_~i~0 30), 37726#(= main_~i~0 31), 37727#(= main_~i~0 32), 37728#(= main_~i~0 33), 37729#(= main_~i~0 34), 37730#(= main_~i~0 35), 37731#(= main_~i~0 36), 37732#(= main_~i~0 37), 37733#(= main_~i~0 38), 37734#(= main_~i~0 39), 37735#(= main_~i~0 40), 37736#(= main_~i~0 41), 37737#(= main_~i~0 42), 37738#(= main_~i~0 43), 37739#(= main_~i~0 44), 37740#(= main_~i~0 45), 37741#(= main_~i~0 46), 37742#(= main_~i~0 47), 37743#(= main_~i~0 48), 37744#(= main_~i~0 49), 37745#(= main_~i~0 50), 37746#(= main_~i~0 51), 37747#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:29:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:23,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:29:23,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:29:23,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:29:23,817 INFO L87 Difference]: Start difference. First operand 640 states and 743 transitions. Second operand 55 states. [2018-02-04 04:29:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:29,805 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-02-04 04:29:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:29:29,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 267 [2018-02-04 04:29:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:29,806 INFO L225 Difference]: With dead ends: 704 [2018-02-04 04:29:29,806 INFO L226 Difference]: Without dead ends: 704 [2018-02-04 04:29:29,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:29:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-04 04:29:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 652. [2018-02-04 04:29:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-02-04 04:29:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 757 transitions. [2018-02-04 04:29:29,810 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 757 transitions. Word has length 267 [2018-02-04 04:29:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:29,810 INFO L432 AbstractCegarLoop]: Abstraction has 652 states and 757 transitions. [2018-02-04 04:29:29,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:29:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 757 transitions. [2018-02-04 04:29:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 04:29:29,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:29,811 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:29,811 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 468719061, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:29,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:30,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:30,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 04:29:30,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:30,509 INFO L182 omatonBuilderFactory]: Interpolants [39104#true, 39105#false, 39108#(= main_~i~0 0), 39109#(= main_~i~0 1), 39110#(= main_~i~0 2), 39111#(= main_~i~0 3), 39112#(= main_~i~0 4), 39113#(= main_~i~0 5), 39114#(= main_~i~0 6), 39115#(= main_~i~0 7), 39116#(= main_~i~0 8), 39117#(= main_~i~0 9), 39118#(= main_~i~0 10), 39119#(= main_~i~0 11), 39120#(= main_~i~0 12), 39121#(= main_~i~0 13), 39122#(= main_~i~0 14), 39123#(= main_~i~0 15), 39124#(= main_~i~0 16), 39125#(= main_~i~0 17), 39126#(= main_~i~0 18), 39127#(= main_~i~0 19), 39128#(= main_~i~0 20), 39129#(= main_~i~0 21), 39130#(= main_~i~0 22), 39131#(= main_~i~0 23), 39132#(= main_~i~0 24), 39133#(= main_~i~0 25), 39134#(= main_~i~0 26), 39135#(= main_~i~0 27), 39136#(= main_~i~0 28), 39137#(= main_~i~0 29), 39138#(= main_~i~0 30), 39139#(= main_~i~0 31), 39140#(= main_~i~0 32), 39141#(= main_~i~0 33), 39142#(= main_~i~0 34), 39143#(= main_~i~0 35), 39144#(= main_~i~0 36), 39145#(= main_~i~0 37), 39146#(= main_~i~0 38), 39147#(= main_~i~0 39), 39148#(= main_~i~0 40), 39149#(= main_~i~0 41), 39150#(= main_~i~0 42), 39151#(= main_~i~0 43), 39152#(= main_~i~0 44), 39153#(= main_~i~0 45), 39154#(= main_~i~0 46), 39155#(= main_~i~0 47), 39156#(= main_~i~0 48), 39157#(= main_~i~0 49), 39158#(= main_~i~0 50), 39159#(= main_~i~0 51), 39160#(= main_~i~0 52), 39161#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:29:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:30,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 04:29:30,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 04:29:30,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:29:30,510 INFO L87 Difference]: Start difference. First operand 652 states and 757 transitions. Second operand 56 states. [2018-02-04 04:29:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:36,550 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-02-04 04:29:36,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:29:36,551 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 272 [2018-02-04 04:29:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:36,552 INFO L225 Difference]: With dead ends: 717 [2018-02-04 04:29:36,552 INFO L226 Difference]: Without dead ends: 717 [2018-02-04 04:29:36,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:29:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-02-04 04:29:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 664. [2018-02-04 04:29:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-02-04 04:29:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 771 transitions. [2018-02-04 04:29:36,556 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 771 transitions. Word has length 272 [2018-02-04 04:29:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:36,556 INFO L432 AbstractCegarLoop]: Abstraction has 664 states and 771 transitions. [2018-02-04 04:29:36,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 04:29:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 771 transitions. [2018-02-04 04:29:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 04:29:36,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:36,557 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:36,557 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash 502010558, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:36,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:37,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:37,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 04:29:37,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:37,259 INFO L182 omatonBuilderFactory]: Interpolants [40576#(= main_~i~0 29), 40577#(= main_~i~0 30), 40578#(= main_~i~0 31), 40579#(= main_~i~0 32), 40580#(= main_~i~0 33), 40581#(= main_~i~0 34), 40582#(= main_~i~0 35), 40583#(= main_~i~0 36), 40584#(= main_~i~0 37), 40585#(= main_~i~0 38), 40586#(= main_~i~0 39), 40587#(= main_~i~0 40), 40588#(= main_~i~0 41), 40589#(= main_~i~0 42), 40590#(= main_~i~0 43), 40591#(= main_~i~0 44), 40592#(= main_~i~0 45), 40593#(= main_~i~0 46), 40594#(= main_~i~0 47), 40595#(= main_~i~0 48), 40596#(= main_~i~0 49), 40597#(= main_~i~0 50), 40598#(= main_~i~0 51), 40599#(= main_~i~0 52), 40600#(= main_~i~0 53), 40601#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 40543#true, 40544#false, 40547#(= main_~i~0 0), 40548#(= main_~i~0 1), 40549#(= main_~i~0 2), 40550#(= main_~i~0 3), 40551#(= main_~i~0 4), 40552#(= main_~i~0 5), 40553#(= main_~i~0 6), 40554#(= main_~i~0 7), 40555#(= main_~i~0 8), 40556#(= main_~i~0 9), 40557#(= main_~i~0 10), 40558#(= main_~i~0 11), 40559#(= main_~i~0 12), 40560#(= main_~i~0 13), 40561#(= main_~i~0 14), 40562#(= main_~i~0 15), 40563#(= main_~i~0 16), 40564#(= main_~i~0 17), 40565#(= main_~i~0 18), 40566#(= main_~i~0 19), 40567#(= main_~i~0 20), 40568#(= main_~i~0 21), 40569#(= main_~i~0 22), 40570#(= main_~i~0 23), 40571#(= main_~i~0 24), 40572#(= main_~i~0 25), 40573#(= main_~i~0 26), 40574#(= main_~i~0 27), 40575#(= main_~i~0 28)] [2018-02-04 04:29:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:37,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 04:29:37,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 04:29:37,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:29:37,260 INFO L87 Difference]: Start difference. First operand 664 states and 771 transitions. Second operand 57 states. [2018-02-04 04:29:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:43,603 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-02-04 04:29:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 04:29:43,604 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 277 [2018-02-04 04:29:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:43,605 INFO L225 Difference]: With dead ends: 730 [2018-02-04 04:29:43,605 INFO L226 Difference]: Without dead ends: 730 [2018-02-04 04:29:43,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:29:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-02-04 04:29:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 676. [2018-02-04 04:29:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-02-04 04:29:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 785 transitions. [2018-02-04 04:29:43,609 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 785 transitions. Word has length 277 [2018-02-04 04:29:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:43,609 INFO L432 AbstractCegarLoop]: Abstraction has 676 states and 785 transitions. [2018-02-04 04:29:43,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 04:29:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 785 transitions. [2018-02-04 04:29:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 04:29:43,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:43,610 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:43,610 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1280917643, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:43,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:44,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:44,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 04:29:44,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:44,359 INFO L182 omatonBuilderFactory]: Interpolants [42008#true, 42009#false, 42012#(= main_~i~0 0), 42013#(= main_~i~0 1), 42014#(= main_~i~0 2), 42015#(= main_~i~0 3), 42016#(= main_~i~0 4), 42017#(= main_~i~0 5), 42018#(= main_~i~0 6), 42019#(= main_~i~0 7), 42020#(= main_~i~0 8), 42021#(= main_~i~0 9), 42022#(= main_~i~0 10), 42023#(= main_~i~0 11), 42024#(= main_~i~0 12), 42025#(= main_~i~0 13), 42026#(= main_~i~0 14), 42027#(= main_~i~0 15), 42028#(= main_~i~0 16), 42029#(= main_~i~0 17), 42030#(= main_~i~0 18), 42031#(= main_~i~0 19), 42032#(= main_~i~0 20), 42033#(= main_~i~0 21), 42034#(= main_~i~0 22), 42035#(= main_~i~0 23), 42036#(= main_~i~0 24), 42037#(= main_~i~0 25), 42038#(= main_~i~0 26), 42039#(= main_~i~0 27), 42040#(= main_~i~0 28), 42041#(= main_~i~0 29), 42042#(= main_~i~0 30), 42043#(= main_~i~0 31), 42044#(= main_~i~0 32), 42045#(= main_~i~0 33), 42046#(= main_~i~0 34), 42047#(= main_~i~0 35), 42048#(= main_~i~0 36), 42049#(= main_~i~0 37), 42050#(= main_~i~0 38), 42051#(= main_~i~0 39), 42052#(= main_~i~0 40), 42053#(= main_~i~0 41), 42054#(= main_~i~0 42), 42055#(= main_~i~0 43), 42056#(= main_~i~0 44), 42057#(= main_~i~0 45), 42058#(= main_~i~0 46), 42059#(= main_~i~0 47), 42060#(= main_~i~0 48), 42061#(= main_~i~0 49), 42062#(= main_~i~0 50), 42063#(= main_~i~0 51), 42064#(= main_~i~0 52), 42065#(= main_~i~0 53), 42066#(= main_~i~0 54), 42067#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:29:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:44,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 04:29:44,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 04:29:44,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:29:44,360 INFO L87 Difference]: Start difference. First operand 676 states and 785 transitions. Second operand 58 states. [2018-02-04 04:29:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:50,906 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-02-04 04:29:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 04:29:50,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 282 [2018-02-04 04:29:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:50,907 INFO L225 Difference]: With dead ends: 743 [2018-02-04 04:29:50,907 INFO L226 Difference]: Without dead ends: 743 [2018-02-04 04:29:50,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:29:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-02-04 04:29:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 688. [2018-02-04 04:29:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-02-04 04:29:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 799 transitions. [2018-02-04 04:29:50,911 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 799 transitions. Word has length 282 [2018-02-04 04:29:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:50,911 INFO L432 AbstractCegarLoop]: Abstraction has 688 states and 799 transitions. [2018-02-04 04:29:50,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 04:29:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 799 transitions. [2018-02-04 04:29:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:29:50,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:50,912 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:50,912 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1543400734, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:50,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:51,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:51,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 04:29:51,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:51,672 INFO L182 omatonBuilderFactory]: Interpolants [43520#(= main_~i~0 17), 43521#(= main_~i~0 18), 43522#(= main_~i~0 19), 43523#(= main_~i~0 20), 43524#(= main_~i~0 21), 43525#(= main_~i~0 22), 43526#(= main_~i~0 23), 43527#(= main_~i~0 24), 43528#(= main_~i~0 25), 43529#(= main_~i~0 26), 43530#(= main_~i~0 27), 43531#(= main_~i~0 28), 43532#(= main_~i~0 29), 43533#(= main_~i~0 30), 43534#(= main_~i~0 31), 43535#(= main_~i~0 32), 43536#(= main_~i~0 33), 43537#(= main_~i~0 34), 43538#(= main_~i~0 35), 43539#(= main_~i~0 36), 43540#(= main_~i~0 37), 43541#(= main_~i~0 38), 43542#(= main_~i~0 39), 43543#(= main_~i~0 40), 43544#(= main_~i~0 41), 43545#(= main_~i~0 42), 43546#(= main_~i~0 43), 43547#(= main_~i~0 44), 43548#(= main_~i~0 45), 43549#(= main_~i~0 46), 43550#(= main_~i~0 47), 43551#(= main_~i~0 48), 43552#(= main_~i~0 49), 43553#(= main_~i~0 50), 43554#(= main_~i~0 51), 43555#(= main_~i~0 52), 43556#(= main_~i~0 53), 43557#(= main_~i~0 54), 43558#(= main_~i~0 55), 43559#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 43499#true, 43500#false, 43503#(= main_~i~0 0), 43504#(= main_~i~0 1), 43505#(= main_~i~0 2), 43506#(= main_~i~0 3), 43507#(= main_~i~0 4), 43508#(= main_~i~0 5), 43509#(= main_~i~0 6), 43510#(= main_~i~0 7), 43511#(= main_~i~0 8), 43512#(= main_~i~0 9), 43513#(= main_~i~0 10), 43514#(= main_~i~0 11), 43515#(= main_~i~0 12), 43516#(= main_~i~0 13), 43517#(= main_~i~0 14), 43518#(= main_~i~0 15), 43519#(= main_~i~0 16)] [2018-02-04 04:29:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:51,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:29:51,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:29:51,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:29:51,672 INFO L87 Difference]: Start difference. First operand 688 states and 799 transitions. Second operand 59 states. [2018-02-04 04:29:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:58,451 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-02-04 04:29:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:29:58,452 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 287 [2018-02-04 04:29:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:58,453 INFO L225 Difference]: With dead ends: 756 [2018-02-04 04:29:58,453 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 04:29:58,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:29:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 04:29:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 700. [2018-02-04 04:29:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-02-04 04:29:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 813 transitions. [2018-02-04 04:29:58,458 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 813 transitions. Word has length 287 [2018-02-04 04:29:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:58,458 INFO L432 AbstractCegarLoop]: Abstraction has 700 states and 813 transitions. [2018-02-04 04:29:58,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:29:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 813 transitions. [2018-02-04 04:29:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 04:29:58,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:58,460 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 04:29:58,460 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:29:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1462902507, now seen corresponding path program 57 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:29:58,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:59,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:59,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 04:29:59,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:59,224 INFO L182 omatonBuilderFactory]: Interpolants [45056#(= main_~i~0 36), 45057#(= main_~i~0 37), 45058#(= main_~i~0 38), 45059#(= main_~i~0 39), 45060#(= main_~i~0 40), 45061#(= main_~i~0 41), 45062#(= main_~i~0 42), 45063#(= main_~i~0 43), 45064#(= main_~i~0 44), 45065#(= main_~i~0 45), 45066#(= main_~i~0 46), 45067#(= main_~i~0 47), 45068#(= main_~i~0 48), 45069#(= main_~i~0 49), 45070#(= main_~i~0 50), 45071#(= main_~i~0 51), 45072#(= main_~i~0 52), 45073#(= main_~i~0 53), 45074#(= main_~i~0 54), 45075#(= main_~i~0 55), 45076#(= main_~i~0 56), 45077#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 45016#true, 45017#false, 45020#(= main_~i~0 0), 45021#(= main_~i~0 1), 45022#(= main_~i~0 2), 45023#(= main_~i~0 3), 45024#(= main_~i~0 4), 45025#(= main_~i~0 5), 45026#(= main_~i~0 6), 45027#(= main_~i~0 7), 45028#(= main_~i~0 8), 45029#(= main_~i~0 9), 45030#(= main_~i~0 10), 45031#(= main_~i~0 11), 45032#(= main_~i~0 12), 45033#(= main_~i~0 13), 45034#(= main_~i~0 14), 45035#(= main_~i~0 15), 45036#(= main_~i~0 16), 45037#(= main_~i~0 17), 45038#(= main_~i~0 18), 45039#(= main_~i~0 19), 45040#(= main_~i~0 20), 45041#(= main_~i~0 21), 45042#(= main_~i~0 22), 45043#(= main_~i~0 23), 45044#(= main_~i~0 24), 45045#(= main_~i~0 25), 45046#(= main_~i~0 26), 45047#(= main_~i~0 27), 45048#(= main_~i~0 28), 45049#(= main_~i~0 29), 45050#(= main_~i~0 30), 45051#(= main_~i~0 31), 45052#(= main_~i~0 32), 45053#(= main_~i~0 33), 45054#(= main_~i~0 34), 45055#(= main_~i~0 35)] [2018-02-04 04:29:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:29:59,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:29:59,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:29:59,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:29:59,225 INFO L87 Difference]: Start difference. First operand 700 states and 813 transitions. Second operand 60 states. [2018-02-04 04:30:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:30:06,575 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-02-04 04:30:06,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 04:30:06,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-02-04 04:30:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:30:06,576 INFO L225 Difference]: With dead ends: 769 [2018-02-04 04:30:06,576 INFO L226 Difference]: Without dead ends: 769 [2018-02-04 04:30:06,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:30:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-02-04 04:30:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 712. [2018-02-04 04:30:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-02-04 04:30:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 827 transitions. [2018-02-04 04:30:06,580 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 827 transitions. Word has length 292 [2018-02-04 04:30:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:30:06,580 INFO L432 AbstractCegarLoop]: Abstraction has 712 states and 827 transitions. [2018-02-04 04:30:06,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:30:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 827 transitions. [2018-02-04 04:30:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 04:30:06,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:30:06,581 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 04:30:06,581 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:30:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -399814786, now seen corresponding path program 58 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:30:06,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:30:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:07,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:30:07,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 04:30:07,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:30:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:07,404 INFO L182 omatonBuilderFactory]: Interpolants [46592#(= main_~i~0 29), 46593#(= main_~i~0 30), 46594#(= main_~i~0 31), 46595#(= main_~i~0 32), 46596#(= main_~i~0 33), 46597#(= main_~i~0 34), 46598#(= main_~i~0 35), 46599#(= main_~i~0 36), 46600#(= main_~i~0 37), 46601#(= main_~i~0 38), 46602#(= main_~i~0 39), 46603#(= main_~i~0 40), 46604#(= main_~i~0 41), 46605#(= main_~i~0 42), 46606#(= main_~i~0 43), 46607#(= main_~i~0 44), 46608#(= main_~i~0 45), 46609#(= main_~i~0 46), 46610#(= main_~i~0 47), 46611#(= main_~i~0 48), 46612#(= main_~i~0 49), 46613#(= main_~i~0 50), 46614#(= main_~i~0 51), 46615#(= main_~i~0 52), 46616#(= main_~i~0 53), 46617#(= main_~i~0 54), 46618#(= main_~i~0 55), 46619#(= main_~i~0 56), 46620#(= main_~i~0 57), 46621#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 46559#true, 46560#false, 46563#(= main_~i~0 0), 46564#(= main_~i~0 1), 46565#(= main_~i~0 2), 46566#(= main_~i~0 3), 46567#(= main_~i~0 4), 46568#(= main_~i~0 5), 46569#(= main_~i~0 6), 46570#(= main_~i~0 7), 46571#(= main_~i~0 8), 46572#(= main_~i~0 9), 46573#(= main_~i~0 10), 46574#(= main_~i~0 11), 46575#(= main_~i~0 12), 46576#(= main_~i~0 13), 46577#(= main_~i~0 14), 46578#(= main_~i~0 15), 46579#(= main_~i~0 16), 46580#(= main_~i~0 17), 46581#(= main_~i~0 18), 46582#(= main_~i~0 19), 46583#(= main_~i~0 20), 46584#(= main_~i~0 21), 46585#(= main_~i~0 22), 46586#(= main_~i~0 23), 46587#(= main_~i~0 24), 46588#(= main_~i~0 25), 46589#(= main_~i~0 26), 46590#(= main_~i~0 27), 46591#(= main_~i~0 28)] [2018-02-04 04:30:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:07,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:30:07,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:30:07,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:30:07,404 INFO L87 Difference]: Start difference. First operand 712 states and 827 transitions. Second operand 61 states. [2018-02-04 04:30:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:30:14,716 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-02-04 04:30:14,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:30:14,717 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 297 [2018-02-04 04:30:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:30:14,718 INFO L225 Difference]: With dead ends: 782 [2018-02-04 04:30:14,718 INFO L226 Difference]: Without dead ends: 782 [2018-02-04 04:30:14,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:30:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-02-04 04:30:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 724. [2018-02-04 04:30:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-02-04 04:30:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 841 transitions. [2018-02-04 04:30:14,722 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 841 transitions. Word has length 297 [2018-02-04 04:30:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:30:14,722 INFO L432 AbstractCegarLoop]: Abstraction has 724 states and 841 transitions. [2018-02-04 04:30:14,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:30:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 841 transitions. [2018-02-04 04:30:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 04:30:14,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:30:14,724 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 04:30:14,724 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:30:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash 590314165, now seen corresponding path program 59 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:30:14,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:30:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:15,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:30:15,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 04:30:15,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:30:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:15,596 INFO L182 omatonBuilderFactory]: Interpolants [48128#true, 48129#false, 48132#(= main_~i~0 0), 48133#(= main_~i~0 1), 48134#(= main_~i~0 2), 48135#(= main_~i~0 3), 48136#(= main_~i~0 4), 48137#(= main_~i~0 5), 48138#(= main_~i~0 6), 48139#(= main_~i~0 7), 48140#(= main_~i~0 8), 48141#(= main_~i~0 9), 48142#(= main_~i~0 10), 48143#(= main_~i~0 11), 48144#(= main_~i~0 12), 48145#(= main_~i~0 13), 48146#(= main_~i~0 14), 48147#(= main_~i~0 15), 48148#(= main_~i~0 16), 48149#(= main_~i~0 17), 48150#(= main_~i~0 18), 48151#(= main_~i~0 19), 48152#(= main_~i~0 20), 48153#(= main_~i~0 21), 48154#(= main_~i~0 22), 48155#(= main_~i~0 23), 48156#(= main_~i~0 24), 48157#(= main_~i~0 25), 48158#(= main_~i~0 26), 48159#(= main_~i~0 27), 48160#(= main_~i~0 28), 48161#(= main_~i~0 29), 48162#(= main_~i~0 30), 48163#(= main_~i~0 31), 48164#(= main_~i~0 32), 48165#(= main_~i~0 33), 48166#(= main_~i~0 34), 48167#(= main_~i~0 35), 48168#(= main_~i~0 36), 48169#(= main_~i~0 37), 48170#(= main_~i~0 38), 48171#(= main_~i~0 39), 48172#(= main_~i~0 40), 48173#(= main_~i~0 41), 48174#(= main_~i~0 42), 48175#(= main_~i~0 43), 48176#(= main_~i~0 44), 48177#(= main_~i~0 45), 48178#(= main_~i~0 46), 48179#(= main_~i~0 47), 48180#(= main_~i~0 48), 48181#(= main_~i~0 49), 48182#(= main_~i~0 50), 48183#(= main_~i~0 51), 48184#(= main_~i~0 52), 48185#(= main_~i~0 53), 48186#(= main_~i~0 54), 48187#(= main_~i~0 55), 48188#(= main_~i~0 56), 48189#(= main_~i~0 57), 48190#(= main_~i~0 58), 48191#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:30:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:15,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:30:15,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:30:15,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:30:15,597 INFO L87 Difference]: Start difference. First operand 724 states and 841 transitions. Second operand 62 states. [2018-02-04 04:30:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:30:23,173 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-02-04 04:30:23,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:30:23,173 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 302 [2018-02-04 04:30:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:30:23,175 INFO L225 Difference]: With dead ends: 795 [2018-02-04 04:30:23,175 INFO L226 Difference]: Without dead ends: 795 [2018-02-04 04:30:23,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:30:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-02-04 04:30:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 736. [2018-02-04 04:30:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-02-04 04:30:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 855 transitions. [2018-02-04 04:30:23,181 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 855 transitions. Word has length 302 [2018-02-04 04:30:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:30:23,181 INFO L432 AbstractCegarLoop]: Abstraction has 736 states and 855 transitions. [2018-02-04 04:30:23,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:30:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 855 transitions. [2018-02-04 04:30:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 04:30:23,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:30:23,182 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 04:30:23,183 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:30:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -387401250, now seen corresponding path program 60 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:30:23,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:30:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:24,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:30:24,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 04:30:24,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:30:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:24,053 INFO L182 omatonBuilderFactory]: Interpolants [49723#true, 49724#false, 49727#(= main_~i~0 0), 49728#(= main_~i~0 1), 49729#(= main_~i~0 2), 49730#(= main_~i~0 3), 49731#(= main_~i~0 4), 49732#(= main_~i~0 5), 49733#(= main_~i~0 6), 49734#(= main_~i~0 7), 49735#(= main_~i~0 8), 49736#(= main_~i~0 9), 49737#(= main_~i~0 10), 49738#(= main_~i~0 11), 49739#(= main_~i~0 12), 49740#(= main_~i~0 13), 49741#(= main_~i~0 14), 49742#(= main_~i~0 15), 49743#(= main_~i~0 16), 49744#(= main_~i~0 17), 49745#(= main_~i~0 18), 49746#(= main_~i~0 19), 49747#(= main_~i~0 20), 49748#(= main_~i~0 21), 49749#(= main_~i~0 22), 49750#(= main_~i~0 23), 49751#(= main_~i~0 24), 49752#(= main_~i~0 25), 49753#(= main_~i~0 26), 49754#(= main_~i~0 27), 49755#(= main_~i~0 28), 49756#(= main_~i~0 29), 49757#(= main_~i~0 30), 49758#(= main_~i~0 31), 49759#(= main_~i~0 32), 49760#(= main_~i~0 33), 49761#(= main_~i~0 34), 49762#(= main_~i~0 35), 49763#(= main_~i~0 36), 49764#(= main_~i~0 37), 49765#(= main_~i~0 38), 49766#(= main_~i~0 39), 49767#(= main_~i~0 40), 49768#(= main_~i~0 41), 49769#(= main_~i~0 42), 49770#(= main_~i~0 43), 49771#(= main_~i~0 44), 49772#(= main_~i~0 45), 49773#(= main_~i~0 46), 49774#(= main_~i~0 47), 49775#(= main_~i~0 48), 49776#(= main_~i~0 49), 49777#(= main_~i~0 50), 49778#(= main_~i~0 51), 49779#(= main_~i~0 52), 49780#(= main_~i~0 53), 49781#(= main_~i~0 54), 49782#(= main_~i~0 55), 49783#(= main_~i~0 56), 49784#(= main_~i~0 57), 49785#(= main_~i~0 58), 49786#(= main_~i~0 59), 49787#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:30:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:24,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:30:24,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:30:24,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:30:24,054 INFO L87 Difference]: Start difference. First operand 736 states and 855 transitions. Second operand 63 states. [2018-02-04 04:30:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:30:31,851 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-02-04 04:30:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 04:30:31,851 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 307 [2018-02-04 04:30:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:30:31,852 INFO L225 Difference]: With dead ends: 808 [2018-02-04 04:30:31,852 INFO L226 Difference]: Without dead ends: 808 [2018-02-04 04:30:31,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:30:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-02-04 04:30:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 748. [2018-02-04 04:30:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-02-04 04:30:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 869 transitions. [2018-02-04 04:30:31,856 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 869 transitions. Word has length 307 [2018-02-04 04:30:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:30:31,857 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 869 transitions. [2018-02-04 04:30:31,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:30:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 869 transitions. [2018-02-04 04:30:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 04:30:31,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:30:31,858 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 04:30:31,858 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:30:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1776972715, now seen corresponding path program 61 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:30:31,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:30:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:30:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:32,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:30:32,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 04:30:32,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:30:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:32,749 INFO L182 omatonBuilderFactory]: Interpolants [51344#true, 51345#false, 51348#(= main_~i~0 0), 51349#(= main_~i~0 1), 51350#(= main_~i~0 2), 51351#(= main_~i~0 3), 51352#(= main_~i~0 4), 51353#(= main_~i~0 5), 51354#(= main_~i~0 6), 51355#(= main_~i~0 7), 51356#(= main_~i~0 8), 51357#(= main_~i~0 9), 51358#(= main_~i~0 10), 51359#(= main_~i~0 11), 51360#(= main_~i~0 12), 51361#(= main_~i~0 13), 51362#(= main_~i~0 14), 51363#(= main_~i~0 15), 51364#(= main_~i~0 16), 51365#(= main_~i~0 17), 51366#(= main_~i~0 18), 51367#(= main_~i~0 19), 51368#(= main_~i~0 20), 51369#(= main_~i~0 21), 51370#(= main_~i~0 22), 51371#(= main_~i~0 23), 51372#(= main_~i~0 24), 51373#(= main_~i~0 25), 51374#(= main_~i~0 26), 51375#(= main_~i~0 27), 51376#(= main_~i~0 28), 51377#(= main_~i~0 29), 51378#(= main_~i~0 30), 51379#(= main_~i~0 31), 51380#(= main_~i~0 32), 51381#(= main_~i~0 33), 51382#(= main_~i~0 34), 51383#(= main_~i~0 35), 51384#(= main_~i~0 36), 51385#(= main_~i~0 37), 51386#(= main_~i~0 38), 51387#(= main_~i~0 39), 51388#(= main_~i~0 40), 51389#(= main_~i~0 41), 51390#(= main_~i~0 42), 51391#(= main_~i~0 43), 51392#(= main_~i~0 44), 51393#(= main_~i~0 45), 51394#(= main_~i~0 46), 51395#(= main_~i~0 47), 51396#(= main_~i~0 48), 51397#(= main_~i~0 49), 51398#(= main_~i~0 50), 51399#(= main_~i~0 51), 51400#(= main_~i~0 52), 51401#(= main_~i~0 53), 51402#(= main_~i~0 54), 51403#(= main_~i~0 55), 51404#(= main_~i~0 56), 51405#(= main_~i~0 57), 51406#(= main_~i~0 58), 51407#(= main_~i~0 59), 51408#(= main_~i~0 60), 51409#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:30:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:30:32,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 04:30:32,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 04:30:32,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:30:32,750 INFO L87 Difference]: Start difference. First operand 748 states and 869 transitions. Second operand 64 states. Received shutdown request... [2018-02-04 04:30:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:30:33,440 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:30:33,443 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:30:33,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:30:33 BoogieIcfgContainer [2018-02-04 04:30:33,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:30:33,444 INFO L168 Benchmark]: Toolchain (without parser) took 192230.72 ms. Allocated memory was 404.8 MB in the beginning and 610.3 MB in the end (delta: 205.5 MB). Free memory was 362.9 MB in the beginning and 378.5 MB in the end (delta: -15.6 MB). Peak memory consumption was 189.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:30:33,445 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:30:33,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.91 ms. Allocated memory is still 404.8 MB. Free memory was 362.9 MB in the beginning and 354.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:30:33,445 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 ms. Allocated memory is still 404.8 MB. Free memory was 354.8 MB in the beginning and 353.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:30:33,445 INFO L168 Benchmark]: RCFGBuilder took 120.02 ms. Allocated memory is still 404.8 MB. Free memory was 353.5 MB in the beginning and 340.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:30:33,446 INFO L168 Benchmark]: TraceAbstraction took 191948.35 ms. Allocated memory was 404.8 MB in the beginning and 610.3 MB in the end (delta: 205.5 MB). Free memory was 340.7 MB in the beginning and 378.5 MB in the end (delta: -37.8 MB). Peak memory consumption was 167.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:30:33,447 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.91 ms. Allocated memory is still 404.8 MB. Free memory was 362.9 MB in the beginning and 354.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 16.76 ms. Allocated memory is still 404.8 MB. Free memory was 354.8 MB in the beginning and 353.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 120.02 ms. Allocated memory is still 404.8 MB. Free memory was 353.5 MB in the beginning and 340.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 191948.35 ms. Allocated memory was 404.8 MB in the beginning and 610.3 MB in the end (delta: 205.5 MB). Free memory was 340.7 MB in the beginning and 378.5 MB in the end (delta: -37.8 MB). Peak memory consumption was 167.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (748states) and interpolant automaton (currently 11 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 191.9s OverallTime, 62 OverallIterations, 62 TraceHistogramMax, 169.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9860 SDtfs, 19677 SDslu, 212878 SDs, 0 SdLazy, 892605 SolverSat, 7621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 133.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2139 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1953 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=748occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/192882 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 1830 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 9889 NumberOfCodeBlocks, 9889 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 9827 ConstructedInterpolants, 0 QuantifiedInterpolants, 6161901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 1 PerfectInterpolantSequences, 0/192882 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-30-33-454.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-30-33-454.csv Completed graceful shutdown