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_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:58:58,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:58:58,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:58:58,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:58:58,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:58:58,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:58:58,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:58:58,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:58:58,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:58:58,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:58:58,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:58:58,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:58:58,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:58:58,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:58:58,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:58:58,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:58:58,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:58:58,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:58:58,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:58:58,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:58:58,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:58:58,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:58:58,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:58:58,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:58:58,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:58:58,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:58:58,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:58:58,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:58:58,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:58:58,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:58:58,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:58:58,781 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-04-10 16:58:58,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:58:58,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:58:58,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:58:58,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:58:58,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:58:58,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:58:58,804 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:58:58,804 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:58:58,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:58:58,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:58:58,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:58:58,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:58:58,805 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-10 16:58:58,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:58:58,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:58:58,848 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:58:58,851 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:58:58,852 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:58:58,853 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:58:58,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-04-10 16:58:59,161 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG091b8b238 [2018-04-10 16:58:59,254 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:58:59,254 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:58:59,254 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-10 16:58:59,255 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:58:59,255 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:58:59,255 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:58:59,255 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 16:58:59,255 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 16:58:59,255 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:58:59,255 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:58:59,267 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG091b8b238 [2018-04-10 16:58:59,271 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:58:59,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:58:59,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:58:59,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:58:59,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:58:59,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dca97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59, skipping insertion in model container [2018-04-10 16:58:59,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,289 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:58:59,297 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:58:59,386 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:58:59,399 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:58:59,402 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-10 16:58:59,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59 WrapperNode [2018-04-10 16:58:59,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:58:59,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:58:59,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:58:59,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:58:59,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (1/1) ... [2018-04-10 16:58:59,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:58:59,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:58:59,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:58:59,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:58:59,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (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-04-10 16:58:59,466 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:58:59,466 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:58:59,466 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 16:58:59,466 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:58:59,466 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:58:59,466 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 16:58:59,466 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:58:59,466 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:58:59,466 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:58:59,630 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:58:59,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:58:59 BoogieIcfgContainer [2018-04-10 16:58:59,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:58:59,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:58:59,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:58:59,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:58:59,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:58:59" (1/3) ... [2018-04-10 16:58:59,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3788d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:58:59, skipping insertion in model container [2018-04-10 16:58:59,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:58:59" (2/3) ... [2018-04-10 16:58:59,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3788d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:58:59, skipping insertion in model container [2018-04-10 16:58:59,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:58:59" (3/3) ... [2018-04-10 16:58:59,636 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-10 16:58:59,643 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:58:59,647 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-10 16:58:59,673 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:58:59,673 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:58:59,673 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:58:59,673 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-10 16:58:59,673 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 16:58:59,673 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:58:59,674 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:58:59,674 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:58:59,674 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:58:59,674 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:58:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-10 16:58:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 16:58:59,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:58:59,695 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:58:59,696 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:58:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash -42208474, 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-04-10 16:58:59,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:58:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,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-04-10 16:58:59,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:58:59,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:58:59,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:58:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,774 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 39#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:58:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:58:59,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:58:59,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:58:59,785 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-10 16:58:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:58:59,820 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-04-10 16:58:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:58:59,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 16:58:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:58:59,831 INFO L225 Difference]: With dead ends: 32 [2018-04-10 16:58:59,832 INFO L226 Difference]: Without dead ends: 26 [2018-04-10 16:58:59,833 INFO L567 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-04-10 16:58:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-04-10 16:58:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-04-10 16:58:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-04-10 16:58:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-04-10 16:58:59,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 7 [2018-04-10 16:58:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:58:59,859 INFO L459 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-04-10 16:58:59,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:58:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-04-10 16:58:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 16:58:59,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:58:59,860 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:58:59,860 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:58:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash 619915766, 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-04-10 16:58:59,864 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:58:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:58:59,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:58:59,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:58:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,910 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 102#(and (< main_~x~0 100000) (<= 0 main_~x~0))] [2018-04-10 16:58:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:58:59,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:58:59,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:58:59,912 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2018-04-10 16:58:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:58:59,937 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-04-10 16:58:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:58:59,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-10 16:58:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:58:59,939 INFO L225 Difference]: With dead ends: 28 [2018-04-10 16:58:59,939 INFO L226 Difference]: Without dead ends: 28 [2018-04-10 16:58:59,939 INFO L567 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-04-10 16:58:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-04-10 16:58:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-04-10 16:58:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-04-10 16:58:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-04-10 16:58:59,943 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2018-04-10 16:58:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:58:59,943 INFO L459 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-04-10 16:58:59,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:58:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-04-10 16:58:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 16:58:59,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:58:59,944 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:58:59,944 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:58:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 621575575, now seen corresponding path program 1 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-04-10 16:58:59,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:58:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:58:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:58:59,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-10 16:58:59,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:58:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,990 INFO L182 omatonBuilderFactory]: Interpolants [160#false, 163#(= main_~i~0 0), 164#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 159#true] [2018-04-10 16:58:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:58:59,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:58:59,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:58:59,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:58:59,991 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-04-10 16:59:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,038 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-10 16:59:00,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:59:00,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 16:59:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,040 INFO L225 Difference]: With dead ends: 44 [2018-04-10 16:59:00,040 INFO L226 Difference]: Without dead ends: 44 [2018-04-10 16:59:00,040 INFO L567 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-04-10 16:59:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-10 16:59:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-10 16:59:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-10 16:59:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-04-10 16:59:00,047 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2018-04-10 16:59:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,047 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-04-10 16:59:00,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:59:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-04-10 16:59:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:59:00,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,048 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,048 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1964364230, now seen corresponding path program 2 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-04-10 16:59:00,051 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 16:59:00,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,088 INFO L182 omatonBuilderFactory]: Interpolants [242#true, 243#false, 246#(= main_~i~0 0), 247#(= main_~i~0 1), 248#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:59:00,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:59:00,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:59:00,089 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2018-04-10 16:59:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,125 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-10 16:59:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:59:00,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:59:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,126 INFO L225 Difference]: With dead ends: 60 [2018-04-10 16:59:00,126 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 16:59:00,126 INFO L567 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-04-10 16:59:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 16:59:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2018-04-10 16:59:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-10 16:59:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-10 16:59:00,131 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2018-04-10 16:59:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,131 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-10 16:59:00,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:59:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-10 16:59:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:59:00,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,132 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,132 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -677867629, now seen corresponding path program 1 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-04-10 16:59:00,136 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:59:00,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:59:00,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:59:00,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,175 INFO L182 omatonBuilderFactory]: Interpolants [352#(<= main_~i~0 main_~x~0), 347#true, 348#false, 351#(= main_~i~0 0)] [2018-04-10 16:59:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:59:00,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:59:00,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:59:00,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:59:00,176 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2018-04-10 16:59:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,203 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-04-10 16:59:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:59:00,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-10 16:59:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,204 INFO L225 Difference]: With dead ends: 41 [2018-04-10 16:59:00,204 INFO L226 Difference]: Without dead ends: 38 [2018-04-10 16:59:00,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-04-10 16:59:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-10 16:59:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-10 16:59:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-10 16:59:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-10 16:59:00,208 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2018-04-10 16:59:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,208 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-10 16:59:00,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:59:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-10 16:59:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:59:00,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,209 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,209 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1777648375, now seen corresponding path program 3 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-04-10 16:59:00,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 16:59:00,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,262 INFO L182 omatonBuilderFactory]: Interpolants [438#true, 439#false, 442#(= main_~i~0 0), 443#(= main_~i~0 1), 444#(= main_~i~0 2), 445#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:59:00,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:59:00,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:59:00,263 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 6 states. [2018-04-10 16:59:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,301 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-10 16:59:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:59:00,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-10 16:59:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,302 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:59:00,302 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:59:00,302 INFO L567 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-04-10 16:59:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:59:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-04-10 16:59:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-10 16:59:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-04-10 16:59:00,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 22 [2018-04-10 16:59:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,305 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-04-10 16:59:00,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:59:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-04-10 16:59:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 16:59:00,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,306 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,306 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash -788155134, now seen corresponding path program 1 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-04-10 16:59:00,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:59:00,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-10 16:59:00,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,345 INFO L182 omatonBuilderFactory]: Interpolants [563#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 554#true, 555#false, 558#(= 0 main_~x~0)] [2018-04-10 16:59:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:59:00,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:59:00,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:59:00,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:59:00,346 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-04-10 16:59:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,368 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-10 16:59:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:59:00,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-04-10 16:59:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,369 INFO L225 Difference]: With dead ends: 49 [2018-04-10 16:59:00,369 INFO L226 Difference]: Without dead ends: 49 [2018-04-10 16:59:00,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-04-10 16:59:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-10 16:59:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-10 16:59:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 16:59:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-04-10 16:59:00,373 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-04-10 16:59:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,373 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-04-10 16:59:00,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:59:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-04-10 16:59:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 16:59:00,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,375 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,375 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1667360870, now seen corresponding path program 4 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-04-10 16:59:00,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 16:59:00,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,462 INFO L182 omatonBuilderFactory]: Interpolants [662#true, 663#false, 666#(= main_~i~0 0), 667#(= main_~i~0 1), 668#(= main_~i~0 2), 669#(= main_~i~0 3), 670#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:59:00,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:59:00,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:59:00,463 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-04-10 16:59:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,542 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-04-10 16:59:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:59:00,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-10 16:59:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,543 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:59:00,543 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 16:59:00,544 INFO L567 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-04-10 16:59:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 16:59:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 54. [2018-04-10 16:59:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-10 16:59:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-10 16:59:00,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 27 [2018-04-10 16:59:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,549 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-10 16:59:00,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:59:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-10 16:59:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 16:59:00,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,550 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,550 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 651022423, now seen corresponding path program 5 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-04-10 16:59:00,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 16:59:00,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,604 INFO L182 omatonBuilderFactory]: Interpolants [834#(= main_~i~0 0), 835#(= main_~i~0 1), 836#(= main_~i~0 2), 837#(= main_~i~0 3), 838#(= main_~i~0 4), 839#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 830#true, 831#false] [2018-04-10 16:59:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:59:00,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:59:00,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:59:00,605 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-10 16:59:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,722 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-04-10 16:59:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:59:00,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-10 16:59:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,723 INFO L225 Difference]: With dead ends: 127 [2018-04-10 16:59:00,723 INFO L226 Difference]: Without dead ends: 127 [2018-04-10 16:59:00,724 INFO L567 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-04-10 16:59:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-10 16:59:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2018-04-10 16:59:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-10 16:59:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-04-10 16:59:00,729 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 32 [2018-04-10 16:59:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,729 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-04-10 16:59:00,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:59:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-04-10 16:59:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:59:00,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,730 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,730 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1022475167, now seen corresponding path program 2 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-04-10 16:59:00,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-10 16:59:00,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 16:59:00,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 16:59:00,808 INFO L182 omatonBuilderFactory]: Interpolants [1040#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1026#true, 1027#false, 1030#(= 0 main_~x~0), 1035#(= 1 main_~x~0)] [2018-04-10 16:59:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-10 16:59:00,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:59:00,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:59:00,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:59:00,809 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2018-04-10 16:59:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:00,830 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-04-10 16:59:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:59:00,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-10 16:59:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:00,832 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:59:00,832 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:59:00,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-04-10 16:59:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:59:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-10 16:59:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 16:59:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-04-10 16:59:00,836 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 37 [2018-04-10 16:59:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:00,836 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-04-10 16:59:00,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:59:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-04-10 16:59:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:59:00,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:00,837 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:00,837 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1728432378, now seen corresponding path program 6 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-04-10 16:59:00,840 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:00,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 16:59:00,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,911 INFO L182 omatonBuilderFactory]: Interpolants [1171#true, 1172#false, 1175#(= main_~i~0 0), 1176#(= main_~i~0 1), 1177#(= main_~i~0 2), 1178#(= main_~i~0 3), 1179#(= main_~i~0 4), 1180#(= main_~i~0 5), 1181#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:00,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:59:00,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:59:00,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:59:00,912 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2018-04-10 16:59:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:01,061 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2018-04-10 16:59:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:59:01,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-04-10 16:59:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:01,062 INFO L225 Difference]: With dead ends: 185 [2018-04-10 16:59:01,063 INFO L226 Difference]: Without dead ends: 185 [2018-04-10 16:59:01,063 INFO L567 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-04-10 16:59:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-10 16:59:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 70. [2018-04-10 16:59:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-10 16:59:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-04-10 16:59:01,069 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-04-10 16:59:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:01,069 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-04-10 16:59:01,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:59:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-04-10 16:59:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:59:01,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:01,070 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:01,070 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash -616716873, now seen corresponding path program 7 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-04-10 16:59:01,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:01,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 16:59:01,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,158 INFO L182 omatonBuilderFactory]: Interpolants [1441#(= main_~i~0 0), 1442#(= main_~i~0 1), 1443#(= main_~i~0 2), 1444#(= main_~i~0 3), 1445#(= main_~i~0 4), 1446#(= main_~i~0 5), 1447#(= main_~i~0 6), 1448#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1437#true, 1438#false] [2018-04-10 16:59:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:59:01,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:59:01,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:59:01,159 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-04-10 16:59:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:01,315 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2018-04-10 16:59:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:59:01,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-04-10 16:59:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:01,317 INFO L225 Difference]: With dead ends: 213 [2018-04-10 16:59:01,317 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 16:59:01,317 INFO L567 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-04-10 16:59:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 16:59:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 75. [2018-04-10 16:59:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-10 16:59:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-04-10 16:59:01,324 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 42 [2018-04-10 16:59:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:01,324 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-04-10 16:59:01,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:59:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-04-10 16:59:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:59:01,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:01,325 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:01,326 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1582293500, now seen corresponding path program 3 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-04-10 16:59:01,329 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 16:59:01,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:01,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 16:59:01,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:59:01,367 INFO L182 omatonBuilderFactory]: Interpolants [1746#(= 1 main_~x~0), 1751#(= main_~x~0 2), 1737#true, 1738#false, 1756#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1741#(= 0 main_~x~0)] [2018-04-10 16:59:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 16:59:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:59:01,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:59:01,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:59:01,368 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 6 states. [2018-04-10 16:59:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:01,478 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-04-10 16:59:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:59:01,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-04-10 16:59:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:01,480 INFO L225 Difference]: With dead ends: 81 [2018-04-10 16:59:01,480 INFO L226 Difference]: Without dead ends: 81 [2018-04-10 16:59:01,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-04-10 16:59:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-10 16:59:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-10 16:59:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 16:59:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-04-10 16:59:01,484 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 47 [2018-04-10 16:59:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:01,484 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-04-10 16:59:01,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:59:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-04-10 16:59:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:59:01,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:01,489 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:01,489 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1845018022, now seen corresponding path program 8 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-04-10 16:59:01,492 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:01,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 16:59:01,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,614 INFO L182 omatonBuilderFactory]: Interpolants [1920#false, 1923#(= main_~i~0 0), 1924#(= main_~i~0 1), 1925#(= main_~i~0 2), 1926#(= main_~i~0 3), 1927#(= main_~i~0 4), 1928#(= main_~i~0 5), 1929#(= main_~i~0 6), 1930#(= main_~i~0 7), 1931#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1919#true] [2018-04-10 16:59:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:59:01,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:59:01,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:59:01,615 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-04-10 16:59:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:01,805 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2018-04-10 16:59:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:59:01,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-10 16:59:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:01,817 INFO L225 Difference]: With dead ends: 289 [2018-04-10 16:59:01,817 INFO L226 Difference]: Without dead ends: 289 [2018-04-10 16:59:01,817 INFO L567 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-04-10 16:59:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-10 16:59:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 86. [2018-04-10 16:59:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 16:59:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-04-10 16:59:01,825 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 47 [2018-04-10 16:59:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:01,825 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-04-10 16:59:01,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:59:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-04-10 16:59:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 16:59:01,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:01,826 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:01,826 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 795493143, now seen corresponding path program 9 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-04-10 16:59:01,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:01,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 16:59:01,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,944 INFO L182 omatonBuilderFactory]: Interpolants [2320#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2307#true, 2308#false, 2311#(= main_~i~0 0), 2312#(= main_~i~0 1), 2313#(= main_~i~0 2), 2314#(= main_~i~0 3), 2315#(= main_~i~0 4), 2316#(= main_~i~0 5), 2317#(= main_~i~0 6), 2318#(= main_~i~0 7), 2319#(= main_~i~0 8)] [2018-04-10 16:59:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:01,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:59:01,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:59:01,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:59:01,945 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 12 states. [2018-04-10 16:59:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:02,197 INFO L93 Difference]: Finished difference Result 323 states and 367 transitions. [2018-04-10 16:59:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:59:02,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-04-10 16:59:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:02,200 INFO L225 Difference]: With dead ends: 323 [2018-04-10 16:59:02,200 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 16:59:02,200 INFO L567 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-04-10 16:59:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 16:59:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 91. [2018-04-10 16:59:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-10 16:59:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-04-10 16:59:02,208 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 52 [2018-04-10 16:59:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:02,208 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-04-10 16:59:02,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:59:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-04-10 16:59:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:59:02,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:02,209 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:02,209 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash -338986983, now seen corresponding path program 4 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-04-10 16:59:02,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 16:59:02,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:02,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 16:59:02,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-10 16:59:02,273 INFO L182 omatonBuilderFactory]: Interpolants [2736#false, 2754#(= main_~x~0 3), 2739#(= 0 main_~x~0), 2759#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 2744#(= 1 main_~x~0), 2749#(= main_~x~0 2), 2735#true] [2018-04-10 16:59:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 16:59:02,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:59:02,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:59:02,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:59:02,274 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2018-04-10 16:59:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:02,326 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-04-10 16:59:02,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:59:02,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-04-10 16:59:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:02,327 INFO L225 Difference]: With dead ends: 97 [2018-04-10 16:59:02,328 INFO L226 Difference]: Without dead ends: 97 [2018-04-10 16:59:02,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-04-10 16:59:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-10 16:59:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-04-10 16:59:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-10 16:59:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-04-10 16:59:02,335 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 57 [2018-04-10 16:59:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:02,335 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-04-10 16:59:02,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:59:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-04-10 16:59:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:59:02,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:02,337 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:02,337 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1643609158, now seen corresponding path program 10 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-04-10 16:59:02,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:02,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:02,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 16:59:02,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:02,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-04-10 16:59:02,451 INFO L182 omatonBuilderFactory]: Interpolants [2954#true, 2955#false, 2958#(= main_~i~0 0), 2959#(= main_~i~0 1), 2960#(= main_~i~0 2), 2961#(= main_~i~0 3), 2962#(= main_~i~0 4), 2963#(= main_~i~0 5), 2964#(= main_~i~0 6), 2965#(= main_~i~0 7), 2966#(= main_~i~0 8), 2967#(= main_~i~0 9), 2968#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:02,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:59:02,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:59:02,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:59:02,452 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 13 states. [2018-04-10 16:59:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:02,737 INFO L93 Difference]: Finished difference Result 417 states and 476 transitions. [2018-04-10 16:59:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:59:02,739 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-10 16:59:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:02,741 INFO L225 Difference]: With dead ends: 417 [2018-04-10 16:59:02,741 INFO L226 Difference]: Without dead ends: 417 [2018-04-10 16:59:02,741 INFO L567 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-04-10 16:59:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-10 16:59:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 102. [2018-04-10 16:59:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-10 16:59:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-04-10 16:59:02,752 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 57 [2018-04-10 16:59:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:02,752 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-04-10 16:59:02,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:59:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-04-10 16:59:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:59:02,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:02,753 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:02,753 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -97792522, now seen corresponding path program 5 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-04-10 16:59:02,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-04-10 16:59:02,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:02,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 16:59:02,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-04-10 16:59:02,840 INFO L182 omatonBuilderFactory]: Interpolants [3488#true, 3489#false, 3507#(= main_~x~0 3), 3492#(= 0 main_~x~0), 3512#(= main_~x~0 4), 3497#(= 1 main_~x~0), 3517#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 3502#(= main_~x~0 2)] [2018-04-10 16:59:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-04-10 16:59:02,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:59:02,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:59:02,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:59:02,841 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 8 states. [2018-04-10 16:59:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:02,912 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-04-10 16:59:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:59:02,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-04-10 16:59:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:02,913 INFO L225 Difference]: With dead ends: 108 [2018-04-10 16:59:02,913 INFO L226 Difference]: Without dead ends: 108 [2018-04-10 16:59:02,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-04-10 16:59:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-10 16:59:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-10 16:59:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-10 16:59:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-04-10 16:59:02,916 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 67 [2018-04-10 16:59:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:02,916 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-04-10 16:59:02,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:59:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-04-10 16:59:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:59:02,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:02,917 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:02,917 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1408870519, now seen corresponding path program 11 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-04-10 16:59:02,921 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:03,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 16:59:03,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,008 INFO L182 omatonBuilderFactory]: Interpolants [3744#(= main_~i~0 6), 3745#(= main_~i~0 7), 3746#(= main_~i~0 8), 3747#(= main_~i~0 9), 3748#(= main_~i~0 10), 3749#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 3734#true, 3735#false, 3738#(= main_~i~0 0), 3739#(= main_~i~0 1), 3740#(= main_~i~0 2), 3741#(= main_~i~0 3), 3742#(= main_~i~0 4), 3743#(= main_~i~0 5)] [2018-04-10 16:59:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:59:03,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:59:03,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:59:03,009 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 14 states. [2018-04-10 16:59:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:03,276 INFO L93 Difference]: Finished difference Result 523 states and 599 transitions. [2018-04-10 16:59:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:59:03,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-10 16:59:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:03,278 INFO L225 Difference]: With dead ends: 523 [2018-04-10 16:59:03,279 INFO L226 Difference]: Without dead ends: 523 [2018-04-10 16:59:03,279 INFO L567 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-04-10 16:59:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-04-10 16:59:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 113. [2018-04-10 16:59:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 16:59:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-04-10 16:59:03,286 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 62 [2018-04-10 16:59:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:03,286 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-04-10 16:59:03,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:59:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-04-10 16:59:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:59:03,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:03,287 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:03,287 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1139772698, now seen corresponding path program 12 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-04-10 16:59:03,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:03,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:59:03,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,434 INFO L182 omatonBuilderFactory]: Interpolants [4386#true, 4387#false, 4390#(= main_~i~0 0), 4391#(= main_~i~0 1), 4392#(= main_~i~0 2), 4393#(= main_~i~0 3), 4394#(= main_~i~0 4), 4395#(= main_~i~0 5), 4396#(= main_~i~0 6), 4397#(= main_~i~0 7), 4398#(= main_~i~0 8), 4399#(= main_~i~0 9), 4400#(= main_~i~0 10), 4401#(= main_~i~0 11), 4402#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:59:03,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:59:03,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:59:03,435 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 15 states. [2018-04-10 16:59:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:03,691 INFO L93 Difference]: Finished difference Result 569 states and 652 transitions. [2018-04-10 16:59:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:59:03,692 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-04-10 16:59:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:03,694 INFO L225 Difference]: With dead ends: 569 [2018-04-10 16:59:03,694 INFO L226 Difference]: Without dead ends: 569 [2018-04-10 16:59:03,695 INFO L567 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-04-10 16:59:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-10 16:59:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 118. [2018-04-10 16:59:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 16:59:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2018-04-10 16:59:03,702 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 67 [2018-04-10 16:59:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:03,702 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2018-04-10 16:59:03,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:59:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-04-10 16:59:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 16:59:03,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:03,703 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:03,703 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash 156513171, now seen corresponding path program 6 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-04-10 16:59:03,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 16:59:03,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:03,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 16:59:03,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-10 16:59:03,778 INFO L182 omatonBuilderFactory]: Interpolants [5104#(= main_~x~0 2), 5090#true, 5091#false, 5124#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 5109#(= main_~x~0 3), 5094#(= 0 main_~x~0), 5114#(= main_~x~0 4), 5099#(= 1 main_~x~0), 5119#(= main_~x~0 5)] [2018-04-10 16:59:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 16:59:03,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:59:03,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:59:03,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:59:03,779 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 9 states. [2018-04-10 16:59:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:03,846 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-04-10 16:59:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:59:03,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-04-10 16:59:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:03,847 INFO L225 Difference]: With dead ends: 124 [2018-04-10 16:59:03,847 INFO L226 Difference]: Without dead ends: 124 [2018-04-10 16:59:03,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-04-10 16:59:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-10 16:59:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-10 16:59:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-10 16:59:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-04-10 16:59:03,850 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 77 [2018-04-10 16:59:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:03,850 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-04-10 16:59:03,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:59:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-04-10 16:59:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:59:03,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:03,850 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:03,851 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1645336023, now seen corresponding path program 13 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-04-10 16:59:03,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:03,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:59:03,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,956 INFO L182 omatonBuilderFactory]: Interpolants [5377#(= main_~i~0 0), 5378#(= main_~i~0 1), 5379#(= main_~i~0 2), 5380#(= main_~i~0 3), 5381#(= main_~i~0 4), 5382#(= main_~i~0 5), 5383#(= main_~i~0 6), 5384#(= main_~i~0 7), 5385#(= main_~i~0 8), 5386#(= main_~i~0 9), 5387#(= main_~i~0 10), 5388#(= main_~i~0 11), 5389#(= main_~i~0 12), 5390#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 5373#true, 5374#false] [2018-04-10 16:59:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:03,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:59:03,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:59:03,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:59:03,957 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 16 states. [2018-04-10 16:59:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:04,230 INFO L93 Difference]: Finished difference Result 693 states and 796 transitions. [2018-04-10 16:59:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:59:04,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-04-10 16:59:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:04,233 INFO L225 Difference]: With dead ends: 693 [2018-04-10 16:59:04,233 INFO L226 Difference]: Without dead ends: 693 [2018-04-10 16:59:04,233 INFO L567 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-04-10 16:59:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-10 16:59:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 129. [2018-04-10 16:59:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:59:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-04-10 16:59:04,237 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 72 [2018-04-10 16:59:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:04,238 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-04-10 16:59:04,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:59:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-04-10 16:59:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 16:59:04,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:04,238 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:04,238 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 719167878, now seen corresponding path program 14 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-04-10 16:59:04,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:04,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:04,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:59:04,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:04,347 INFO L182 omatonBuilderFactory]: Interpolants [6213#true, 6214#false, 6217#(= main_~i~0 0), 6218#(= main_~i~0 1), 6219#(= main_~i~0 2), 6220#(= main_~i~0 3), 6221#(= main_~i~0 4), 6222#(= main_~i~0 5), 6223#(= main_~i~0 6), 6224#(= main_~i~0 7), 6225#(= main_~i~0 8), 6226#(= main_~i~0 9), 6227#(= main_~i~0 10), 6228#(= main_~i~0 11), 6229#(= main_~i~0 12), 6230#(= main_~i~0 13), 6231#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:04,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:59:04,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:59:04,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:59:04,348 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 17 states. [2018-04-10 16:59:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:04,662 INFO L93 Difference]: Finished difference Result 745 states and 856 transitions. [2018-04-10 16:59:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:59:04,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-04-10 16:59:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:04,668 INFO L225 Difference]: With dead ends: 745 [2018-04-10 16:59:04,669 INFO L226 Difference]: Without dead ends: 745 [2018-04-10 16:59:04,669 INFO L567 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-04-10 16:59:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-04-10 16:59:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 134. [2018-04-10 16:59:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 16:59:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-04-10 16:59:04,679 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 77 [2018-04-10 16:59:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:04,679 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-04-10 16:59:04,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:59:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-04-10 16:59:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 16:59:04,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:04,680 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:04,680 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash -784074512, now seen corresponding path program 7 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-04-10 16:59:04,690 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-10 16:59:04,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:04,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 16:59:04,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-04-10 16:59:04,801 INFO L182 omatonBuilderFactory]: Interpolants [7120#(= 1 main_~x~0), 7140#(= main_~x~0 5), 7125#(= main_~x~0 2), 7111#true, 7112#false, 7145#(= main_~x~0 6), 7130#(= main_~x~0 3), 7115#(= 0 main_~x~0), 7150#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 7135#(= main_~x~0 4)] [2018-04-10 16:59:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-10 16:59:04,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:59:04,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:59:04,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:59:04,802 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 10 states. [2018-04-10 16:59:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:04,882 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-04-10 16:59:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:59:04,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-04-10 16:59:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:04,883 INFO L225 Difference]: With dead ends: 140 [2018-04-10 16:59:04,883 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 16:59:04,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-04-10 16:59:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 16:59:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-04-10 16:59:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-10 16:59:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-04-10 16:59:04,885 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 87 [2018-04-10 16:59:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:04,885 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-04-10 16:59:04,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:59:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-04-10 16:59:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 16:59:04,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:04,886 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:04,886 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1151808713, now seen corresponding path program 15 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-04-10 16:59:04,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:05,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:59:05,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,086 INFO L182 omatonBuilderFactory]: Interpolants [7431#true, 7432#false, 7435#(= main_~i~0 0), 7436#(= main_~i~0 1), 7437#(= main_~i~0 2), 7438#(= main_~i~0 3), 7439#(= main_~i~0 4), 7440#(= main_~i~0 5), 7441#(= main_~i~0 6), 7442#(= main_~i~0 7), 7443#(= main_~i~0 8), 7444#(= main_~i~0 9), 7445#(= main_~i~0 10), 7446#(= main_~i~0 11), 7447#(= main_~i~0 12), 7448#(= main_~i~0 13), 7449#(= main_~i~0 14), 7450#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:59:05,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:59:05,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:59:05,088 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 18 states. [2018-04-10 16:59:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:05,590 INFO L93 Difference]: Finished difference Result 887 states and 1021 transitions. [2018-04-10 16:59:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:59:05,591 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-04-10 16:59:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:05,593 INFO L225 Difference]: With dead ends: 887 [2018-04-10 16:59:05,593 INFO L226 Difference]: Without dead ends: 887 [2018-04-10 16:59:05,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:59:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-04-10 16:59:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 145. [2018-04-10 16:59:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 16:59:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-04-10 16:59:05,598 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 82 [2018-04-10 16:59:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:05,599 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-04-10 16:59:05,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:59:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-04-10 16:59:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 16:59:05,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:05,599 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:05,599 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1685653542, now seen corresponding path program 16 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-04-10 16:59:05,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:05,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:59:05,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,795 INFO L182 omatonBuilderFactory]: Interpolants [8483#true, 8484#false, 8487#(= main_~i~0 0), 8488#(= main_~i~0 1), 8489#(= main_~i~0 2), 8490#(= main_~i~0 3), 8491#(= main_~i~0 4), 8492#(= main_~i~0 5), 8493#(= main_~i~0 6), 8494#(= main_~i~0 7), 8495#(= main_~i~0 8), 8496#(= main_~i~0 9), 8497#(= main_~i~0 10), 8498#(= main_~i~0 11), 8499#(= main_~i~0 12), 8500#(= main_~i~0 13), 8501#(= main_~i~0 14), 8502#(= main_~i~0 15), 8503#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:05,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:59:05,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:59:05,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:59:05,796 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 19 states. [2018-04-10 16:59:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:06,250 INFO L93 Difference]: Finished difference Result 945 states and 1088 transitions. [2018-04-10 16:59:06,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:59:06,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-10 16:59:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:06,252 INFO L225 Difference]: With dead ends: 945 [2018-04-10 16:59:06,253 INFO L226 Difference]: Without dead ends: 945 [2018-04-10 16:59:06,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:59:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-04-10 16:59:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 150. [2018-04-10 16:59:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 16:59:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2018-04-10 16:59:06,262 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 87 [2018-04-10 16:59:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:06,262 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2018-04-10 16:59:06,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:59:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2018-04-10 16:59:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 16:59:06,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:06,263 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:06,263 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -820613619, now seen corresponding path program 8 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-04-10 16:59:06,267 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-04-10 16:59:06,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:06,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 16:59:06,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-10 16:59:06,331 INFO L182 omatonBuilderFactory]: Interpolants [9600#false, 9633#(= main_~x~0 6), 9618#(= main_~x~0 3), 9603#(= 0 main_~x~0), 9638#(= main_~x~0 7), 9623#(= main_~x~0 4), 9608#(= 1 main_~x~0), 9643#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 9628#(= main_~x~0 5), 9613#(= main_~x~0 2), 9599#true] [2018-04-10 16:59:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-04-10 16:59:06,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:59:06,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:59:06,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:59:06,332 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand 11 states. [2018-04-10 16:59:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:06,426 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-04-10 16:59:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:59:06,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-04-10 16:59:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:06,427 INFO L225 Difference]: With dead ends: 156 [2018-04-10 16:59:06,427 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 16:59:06,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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-04-10 16:59:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 16:59:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-04-10 16:59:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 16:59:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-04-10 16:59:06,430 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 97 [2018-04-10 16:59:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:06,430 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-04-10 16:59:06,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:59:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-04-10 16:59:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-10 16:59:06,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:06,432 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:06,432 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1777633431, now seen corresponding path program 17 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-04-10 16:59:06,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:06,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:06,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:59:06,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:06,590 INFO L182 omatonBuilderFactory]: Interpolants [9956#true, 9957#false, 9960#(= main_~i~0 0), 9961#(= main_~i~0 1), 9962#(= main_~i~0 2), 9963#(= main_~i~0 3), 9964#(= main_~i~0 4), 9965#(= main_~i~0 5), 9966#(= main_~i~0 6), 9967#(= main_~i~0 7), 9968#(= main_~i~0 8), 9969#(= main_~i~0 9), 9970#(= main_~i~0 10), 9971#(= main_~i~0 11), 9972#(= main_~i~0 12), 9973#(= main_~i~0 13), 9974#(= main_~i~0 14), 9975#(= main_~i~0 15), 9976#(= main_~i~0 16), 9977#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:06,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:59:06,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:59:06,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:59:06,590 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 20 states. [2018-04-10 16:59:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:07,042 INFO L93 Difference]: Finished difference Result 1105 states and 1274 transitions. [2018-04-10 16:59:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:59:07,042 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-04-10 16:59:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:07,044 INFO L225 Difference]: With dead ends: 1105 [2018-04-10 16:59:07,044 INFO L226 Difference]: Without dead ends: 1105 [2018-04-10 16:59:07,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:59:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-04-10 16:59:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 161. [2018-04-10 16:59:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 16:59:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-04-10 16:59:07,050 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 92 [2018-04-10 16:59:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:07,050 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-04-10 16:59:07,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:59:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-04-10 16:59:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 16:59:07,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:07,051 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:07,051 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash -964909370, now seen corresponding path program 18 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-04-10 16:59:07,053 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:07,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:07,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:59:07,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:07,188 INFO L182 omatonBuilderFactory]: Interpolants [11264#(= main_~i~0 16), 11265#(= main_~i~0 17), 11266#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 11244#true, 11245#false, 11248#(= main_~i~0 0), 11249#(= main_~i~0 1), 11250#(= main_~i~0 2), 11251#(= main_~i~0 3), 11252#(= main_~i~0 4), 11253#(= main_~i~0 5), 11254#(= main_~i~0 6), 11255#(= main_~i~0 7), 11256#(= main_~i~0 8), 11257#(= main_~i~0 9), 11258#(= main_~i~0 10), 11259#(= main_~i~0 11), 11260#(= main_~i~0 12), 11261#(= main_~i~0 13), 11262#(= main_~i~0 14), 11263#(= main_~i~0 15)] [2018-04-10 16:59:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:07,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:59:07,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:59:07,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:59:07,188 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 21 states. [2018-04-10 16:59:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:07,663 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2018-04-10 16:59:07,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:59:07,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-04-10 16:59:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:07,666 INFO L225 Difference]: With dead ends: 1169 [2018-04-10 16:59:07,666 INFO L226 Difference]: Without dead ends: 1169 [2018-04-10 16:59:07,666 INFO L567 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-04-10 16:59:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-04-10 16:59:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 166. [2018-04-10 16:59:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 16:59:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-04-10 16:59:07,674 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 97 [2018-04-10 16:59:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:07,675 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-04-10 16:59:07,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:59:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-04-10 16:59:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-10 16:59:07,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:07,676 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:07,676 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1845304598, now seen corresponding path program 9 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-04-10 16:59:07,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-04-10 16:59:07,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:07,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 16:59:07,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-04-10 16:59:07,800 INFO L182 omatonBuilderFactory]: Interpolants [12641#(= main_~x~0 7), 12626#(= main_~x~0 4), 12611#(= 1 main_~x~0), 12646#(= main_~x~0 8), 12631#(= main_~x~0 5), 12616#(= main_~x~0 2), 12602#true, 12603#false, 12651#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 12636#(= main_~x~0 6), 12621#(= main_~x~0 3), 12606#(= 0 main_~x~0)] [2018-04-10 16:59:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-04-10 16:59:07,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:59:07,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:59:07,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:59:07,800 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 12 states. [2018-04-10 16:59:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:07,964 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2018-04-10 16:59:07,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:59:07,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-04-10 16:59:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:07,964 INFO L225 Difference]: With dead ends: 172 [2018-04-10 16:59:07,965 INFO L226 Difference]: Without dead ends: 172 [2018-04-10 16:59:07,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 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-04-10 16:59:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-10 16:59:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-04-10 16:59:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-10 16:59:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2018-04-10 16:59:07,967 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 107 [2018-04-10 16:59:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:07,967 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2018-04-10 16:59:07,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:59:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2018-04-10 16:59:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-10 16:59:07,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:07,968 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:07,968 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2138370569, now seen corresponding path program 19 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-04-10 16:59:07,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:08,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:08,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:59:08,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:08,132 INFO L182 omatonBuilderFactory]: Interpolants [12996#true, 12997#false, 13000#(= main_~i~0 0), 13001#(= main_~i~0 1), 13002#(= main_~i~0 2), 13003#(= main_~i~0 3), 13004#(= main_~i~0 4), 13005#(= main_~i~0 5), 13006#(= main_~i~0 6), 13007#(= main_~i~0 7), 13008#(= main_~i~0 8), 13009#(= main_~i~0 9), 13010#(= main_~i~0 10), 13011#(= main_~i~0 11), 13012#(= main_~i~0 12), 13013#(= main_~i~0 13), 13014#(= main_~i~0 14), 13015#(= main_~i~0 15), 13016#(= main_~i~0 16), 13017#(= main_~i~0 17), 13018#(= main_~i~0 18), 13019#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:08,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:59:08,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:59:08,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:59:08,133 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand 22 states. [2018-04-10 16:59:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:08,663 INFO L93 Difference]: Finished difference Result 1347 states and 1555 transitions. [2018-04-10 16:59:08,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:59:08,664 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-04-10 16:59:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:08,666 INFO L225 Difference]: With dead ends: 1347 [2018-04-10 16:59:08,666 INFO L226 Difference]: Without dead ends: 1347 [2018-04-10 16:59:08,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:59:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-04-10 16:59:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 177. [2018-04-10 16:59:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-10 16:59:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2018-04-10 16:59:08,674 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 102 [2018-04-10 16:59:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:08,675 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2018-04-10 16:59:08,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:59:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-04-10 16:59:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 16:59:08,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:08,676 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:08,676 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash -933451897, now seen corresponding path program 10 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-04-10 16:59:08,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-04-10 16:59:08,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:08,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 16:59:08,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-04-10 16:59:08,816 INFO L182 omatonBuilderFactory]: Interpolants [14593#(= main_~x~0 9), 14563#(= main_~x~0 3), 14598#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 14568#(= main_~x~0 4), 14573#(= main_~x~0 5), 14544#true, 14545#false, 14578#(= main_~x~0 6), 14548#(= 0 main_~x~0), 14583#(= main_~x~0 7), 14553#(= 1 main_~x~0), 14588#(= main_~x~0 8), 14558#(= main_~x~0 2)] [2018-04-10 16:59:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-04-10 16:59:08,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:59:08,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:59:08,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:59:08,816 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 13 states. [2018-04-10 16:59:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:08,947 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2018-04-10 16:59:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:59:08,947 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-04-10 16:59:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:08,948 INFO L225 Difference]: With dead ends: 183 [2018-04-10 16:59:08,948 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 16:59:08,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 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-04-10 16:59:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 16:59:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-10 16:59:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-10 16:59:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2018-04-10 16:59:08,950 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 117 [2018-04-10 16:59:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:08,951 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2018-04-10 16:59:08,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:59:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2018-04-10 16:59:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-10 16:59:08,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:08,951 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:08,951 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash -167608986, now seen corresponding path program 20 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-04-10 16:59:08,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:09,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:09,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:59:09,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:09,118 INFO L182 omatonBuilderFactory]: Interpolants [14976#(= main_~i~0 7), 14977#(= main_~i~0 8), 14978#(= main_~i~0 9), 14979#(= main_~i~0 10), 14980#(= main_~i~0 11), 14981#(= main_~i~0 12), 14982#(= main_~i~0 13), 14983#(= main_~i~0 14), 14984#(= main_~i~0 15), 14985#(= main_~i~0 16), 14986#(= main_~i~0 17), 14987#(= main_~i~0 18), 14988#(= main_~i~0 19), 14989#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 14965#true, 14966#false, 14969#(= main_~i~0 0), 14970#(= main_~i~0 1), 14971#(= main_~i~0 2), 14972#(= main_~i~0 3), 14973#(= main_~i~0 4), 14974#(= main_~i~0 5), 14975#(= main_~i~0 6)] [2018-04-10 16:59:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:09,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:59:09,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:59:09,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:59:09,119 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 23 states. [2018-04-10 16:59:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:09,735 INFO L93 Difference]: Finished difference Result 1537 states and 1776 transitions. [2018-04-10 16:59:09,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:59:09,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2018-04-10 16:59:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:09,737 INFO L225 Difference]: With dead ends: 1537 [2018-04-10 16:59:09,738 INFO L226 Difference]: Without dead ends: 1537 [2018-04-10 16:59:09,738 INFO L567 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-04-10 16:59:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-04-10 16:59:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 188. [2018-04-10 16:59:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 16:59:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2018-04-10 16:59:09,744 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 107 [2018-04-10 16:59:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:09,744 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2018-04-10 16:59:09,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:59:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2018-04-10 16:59:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-10 16:59:09,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:09,745 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:09,745 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2051169111, now seen corresponding path program 21 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-04-10 16:59:09,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:10,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:10,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:59:10,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:10,015 INFO L182 omatonBuilderFactory]: Interpolants [16736#(= main_~i~0 17), 16737#(= main_~i~0 18), 16738#(= main_~i~0 19), 16739#(= main_~i~0 20), 16740#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 16715#true, 16716#false, 16719#(= main_~i~0 0), 16720#(= main_~i~0 1), 16721#(= main_~i~0 2), 16722#(= main_~i~0 3), 16723#(= main_~i~0 4), 16724#(= main_~i~0 5), 16725#(= main_~i~0 6), 16726#(= main_~i~0 7), 16727#(= main_~i~0 8), 16728#(= main_~i~0 9), 16729#(= main_~i~0 10), 16730#(= main_~i~0 11), 16731#(= main_~i~0 12), 16732#(= main_~i~0 13), 16733#(= main_~i~0 14), 16734#(= main_~i~0 15), 16735#(= main_~i~0 16)] [2018-04-10 16:59:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:10,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:59:10,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:59:10,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:59:10,016 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 24 states. [2018-04-10 16:59:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:10,832 INFO L93 Difference]: Finished difference Result 1613 states and 1864 transitions. [2018-04-10 16:59:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:59:10,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2018-04-10 16:59:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:10,837 INFO L225 Difference]: With dead ends: 1613 [2018-04-10 16:59:10,837 INFO L226 Difference]: Without dead ends: 1613 [2018-04-10 16:59:10,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:59:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-04-10 16:59:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 193. [2018-04-10 16:59:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 16:59:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-04-10 16:59:10,847 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 112 [2018-04-10 16:59:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:10,848 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-04-10 16:59:10,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:59:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-04-10 16:59:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-10 16:59:10,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:10,849 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:10,849 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 210963428, now seen corresponding path program 11 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-04-10 16:59:10,852 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-04-10 16:59:10,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:10,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 16:59:10,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-04-10 16:59:10,987 INFO L182 omatonBuilderFactory]: Interpolants [18561#(= main_~x~0 2), 18596#(= main_~x~0 9), 18566#(= main_~x~0 3), 18601#(= main_~x~0 10), 18571#(= main_~x~0 4), 18606#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 18576#(= main_~x~0 5), 18547#true, 18548#false, 18581#(= main_~x~0 6), 18551#(= 0 main_~x~0), 18586#(= main_~x~0 7), 18556#(= 1 main_~x~0), 18591#(= main_~x~0 8)] [2018-04-10 16:59:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-04-10 16:59:10,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:59:10,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:59:10,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:59:10,988 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 14 states. [2018-04-10 16:59:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:11,123 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2018-04-10 16:59:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:59:11,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-04-10 16:59:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:11,124 INFO L225 Difference]: With dead ends: 199 [2018-04-10 16:59:11,124 INFO L226 Difference]: Without dead ends: 199 [2018-04-10 16:59:11,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 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-04-10 16:59:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-10 16:59:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-04-10 16:59:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 16:59:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-04-10 16:59:11,126 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 127 [2018-04-10 16:59:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:11,126 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-04-10 16:59:11,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:59:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-04-10 16:59:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 16:59:11,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:11,127 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:11,127 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2141490182, now seen corresponding path program 22 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-04-10 16:59:11,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:11,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:11,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:59:11,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:11,294 INFO L182 omatonBuilderFactory]: Interpolants [19009#(= main_~i~0 0), 19010#(= main_~i~0 1), 19011#(= main_~i~0 2), 19012#(= main_~i~0 3), 19013#(= main_~i~0 4), 19014#(= main_~i~0 5), 19015#(= main_~i~0 6), 19016#(= main_~i~0 7), 19017#(= main_~i~0 8), 19018#(= main_~i~0 9), 19019#(= main_~i~0 10), 19020#(= main_~i~0 11), 19021#(= main_~i~0 12), 19022#(= main_~i~0 13), 19023#(= main_~i~0 14), 19024#(= main_~i~0 15), 19025#(= main_~i~0 16), 19026#(= main_~i~0 17), 19027#(= main_~i~0 18), 19028#(= main_~i~0 19), 19029#(= main_~i~0 20), 19030#(= main_~i~0 21), 19031#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 19005#true, 19006#false] [2018-04-10 16:59:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:11,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:59:11,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:59:11,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:59:11,294 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 25 states. [2018-04-10 16:59:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:12,022 INFO L93 Difference]: Finished difference Result 1821 states and 2106 transitions. [2018-04-10 16:59:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:59:12,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-04-10 16:59:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:12,025 INFO L225 Difference]: With dead ends: 1821 [2018-04-10 16:59:12,025 INFO L226 Difference]: Without dead ends: 1821 [2018-04-10 16:59:12,026 INFO L567 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-04-10 16:59:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-04-10 16:59:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 204. [2018-04-10 16:59:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-10 16:59:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2018-04-10 16:59:12,033 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 117 [2018-04-10 16:59:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:12,033 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2018-04-10 16:59:12,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:59:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2018-04-10 16:59:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 16:59:12,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:12,034 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:12,034 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1698664265, now seen corresponding path program 23 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-04-10 16:59:12,036 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:12,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:12,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:59:12,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:12,247 INFO L182 omatonBuilderFactory]: Interpolants [21057#true, 21058#false, 21061#(= main_~i~0 0), 21062#(= main_~i~0 1), 21063#(= main_~i~0 2), 21064#(= main_~i~0 3), 21065#(= main_~i~0 4), 21066#(= main_~i~0 5), 21067#(= main_~i~0 6), 21068#(= main_~i~0 7), 21069#(= main_~i~0 8), 21070#(= main_~i~0 9), 21071#(= main_~i~0 10), 21072#(= main_~i~0 11), 21073#(= main_~i~0 12), 21074#(= main_~i~0 13), 21075#(= main_~i~0 14), 21076#(= main_~i~0 15), 21077#(= main_~i~0 16), 21078#(= main_~i~0 17), 21079#(= main_~i~0 18), 21080#(= main_~i~0 19), 21081#(= main_~i~0 20), 21082#(= main_~i~0 21), 21083#(= main_~i~0 22), 21084#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:59:12,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:59:12,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:59:12,248 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand 26 states. [2018-04-10 16:59:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:13,117 INFO L93 Difference]: Finished difference Result 1903 states and 2201 transitions. [2018-04-10 16:59:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:59:13,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-04-10 16:59:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:13,121 INFO L225 Difference]: With dead ends: 1903 [2018-04-10 16:59:13,121 INFO L226 Difference]: Without dead ends: 1903 [2018-04-10 16:59:13,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:59:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-04-10 16:59:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 209. [2018-04-10 16:59:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 16:59:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2018-04-10 16:59:13,127 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 122 [2018-04-10 16:59:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:13,128 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2018-04-10 16:59:13,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:59:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2018-04-10 16:59:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 16:59:13,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:13,128 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:13,128 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1915838465, now seen corresponding path program 12 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-04-10 16:59:13,131 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-04-10 16:59:13,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:13,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:59:13,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-04-10 16:59:13,242 INFO L182 omatonBuilderFactory]: Interpolants [23201#(= 0 main_~x~0), 23236#(= main_~x~0 7), 23206#(= 1 main_~x~0), 23241#(= main_~x~0 8), 23211#(= main_~x~0 2), 23246#(= main_~x~0 9), 23216#(= main_~x~0 3), 23251#(= main_~x~0 10), 23221#(= main_~x~0 4), 23256#(= main_~x~0 11), 23226#(= main_~x~0 5), 23197#true, 23261#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 23198#false, 23231#(= main_~x~0 6)] [2018-04-10 16:59:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-04-10 16:59:13,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:59:13,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:59:13,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:59:13,243 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand 15 states. [2018-04-10 16:59:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:13,414 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-04-10 16:59:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:59:13,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-04-10 16:59:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:13,415 INFO L225 Difference]: With dead ends: 215 [2018-04-10 16:59:13,415 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 16:59:13,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 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-04-10 16:59:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 16:59:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-04-10 16:59:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 16:59:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 250 transitions. [2018-04-10 16:59:13,417 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 250 transitions. Word has length 137 [2018-04-10 16:59:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:13,418 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 250 transitions. [2018-04-10 16:59:13,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:59:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 250 transitions. [2018-04-10 16:59:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-10 16:59:13,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:13,419 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:13,419 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2004669094, now seen corresponding path program 24 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:13,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:13,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:13,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 16:59:13,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:13,619 INFO L182 omatonBuilderFactory]: Interpolants [23692#true, 23693#false, 23696#(= main_~i~0 0), 23697#(= main_~i~0 1), 23698#(= main_~i~0 2), 23699#(= main_~i~0 3), 23700#(= main_~i~0 4), 23701#(= main_~i~0 5), 23702#(= main_~i~0 6), 23703#(= main_~i~0 7), 23704#(= main_~i~0 8), 23705#(= main_~i~0 9), 23706#(= main_~i~0 10), 23707#(= main_~i~0 11), 23708#(= main_~i~0 12), 23709#(= main_~i~0 13), 23710#(= main_~i~0 14), 23711#(= main_~i~0 15), 23712#(= main_~i~0 16), 23713#(= main_~i~0 17), 23714#(= main_~i~0 18), 23715#(= main_~i~0 19), 23716#(= main_~i~0 20), 23717#(= main_~i~0 21), 23718#(= main_~i~0 22), 23719#(= main_~i~0 23), 23720#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:13,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:59:13,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:59:13,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:59:13,619 INFO L87 Difference]: Start difference. First operand 215 states and 250 transitions. Second operand 27 states. [2018-04-10 16:59:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:14,453 INFO L93 Difference]: Finished difference Result 2129 states and 2464 transitions. [2018-04-10 16:59:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:59:14,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2018-04-10 16:59:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:14,456 INFO L225 Difference]: With dead ends: 2129 [2018-04-10 16:59:14,457 INFO L226 Difference]: Without dead ends: 2129 [2018-04-10 16:59:14,457 INFO L567 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-04-10 16:59:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-04-10 16:59:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 220. [2018-04-10 16:59:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 16:59:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2018-04-10 16:59:14,464 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 127 [2018-04-10 16:59:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:14,465 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2018-04-10 16:59:14,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:59:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2018-04-10 16:59:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 16:59:14,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:14,465 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:14,465 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460887, now seen corresponding path program 25 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-04-10 16:59:14,468 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:14,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:14,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 16:59:14,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:14,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-04-10 16:59:14,671 INFO L182 omatonBuilderFactory]: Interpolants [26070#true, 26071#false, 26074#(= main_~i~0 0), 26075#(= main_~i~0 1), 26076#(= main_~i~0 2), 26077#(= main_~i~0 3), 26078#(= main_~i~0 4), 26079#(= main_~i~0 5), 26080#(= main_~i~0 6), 26081#(= main_~i~0 7), 26082#(= main_~i~0 8), 26083#(= main_~i~0 9), 26084#(= main_~i~0 10), 26085#(= main_~i~0 11), 26086#(= main_~i~0 12), 26087#(= main_~i~0 13), 26088#(= main_~i~0 14), 26089#(= main_~i~0 15), 26090#(= main_~i~0 16), 26091#(= main_~i~0 17), 26092#(= main_~i~0 18), 26093#(= main_~i~0 19), 26094#(= main_~i~0 20), 26095#(= main_~i~0 21), 26096#(= main_~i~0 22), 26097#(= main_~i~0 23), 26098#(= main_~i~0 24), 26099#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:14,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:59:14,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:59:14,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:59:14,671 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 28 states. [2018-04-10 16:59:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:15,539 INFO L93 Difference]: Finished difference Result 2217 states and 2566 transitions. [2018-04-10 16:59:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:59:15,539 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 132 [2018-04-10 16:59:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:15,543 INFO L225 Difference]: With dead ends: 2217 [2018-04-10 16:59:15,543 INFO L226 Difference]: Without dead ends: 2217 [2018-04-10 16:59:15,544 INFO L567 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-04-10 16:59:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-04-10 16:59:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 225. [2018-04-10 16:59:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-10 16:59:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-04-10 16:59:15,553 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 132 [2018-04-10 16:59:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:15,554 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-04-10 16:59:15,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:59:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-04-10 16:59:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 16:59:15,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:15,555 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:15,555 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -757140514, now seen corresponding path program 13 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-04-10 16:59:15,558 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-10 16:59:15,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:15,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:59:15,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-04-10 16:59:15,686 INFO L182 omatonBuilderFactory]: Interpolants [28576#(= main_~x~0 6), 28546#(= 0 main_~x~0), 28611#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 28581#(= main_~x~0 7), 28551#(= 1 main_~x~0), 28586#(= main_~x~0 8), 28556#(= main_~x~0 2), 28591#(= main_~x~0 9), 28561#(= main_~x~0 3), 28596#(= main_~x~0 10), 28566#(= main_~x~0 4), 28601#(= main_~x~0 11), 28571#(= main_~x~0 5), 28542#true, 28606#(= main_~x~0 12), 28543#false] [2018-04-10 16:59:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-10 16:59:15,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:59:15,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:59:15,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:59:15,686 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-04-10 16:59:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:15,873 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2018-04-10 16:59:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:59:16,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2018-04-10 16:59:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:16,005 INFO L225 Difference]: With dead ends: 231 [2018-04-10 16:59:16,005 INFO L226 Difference]: Without dead ends: 231 [2018-04-10 16:59:16,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 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-04-10 16:59:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-10 16:59:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-04-10 16:59:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-10 16:59:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-04-10 16:59:16,008 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 147 [2018-04-10 16:59:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:16,009 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-04-10 16:59:16,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:59:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-04-10 16:59:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 16:59:16,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:16,010 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:16,010 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash 421876038, now seen corresponding path program 26 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-04-10 16:59:16,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:16,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:16,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 16:59:16,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:16,236 INFO L182 omatonBuilderFactory]: Interpolants [29074#true, 29075#false, 29078#(= main_~i~0 0), 29079#(= main_~i~0 1), 29080#(= main_~i~0 2), 29081#(= main_~i~0 3), 29082#(= main_~i~0 4), 29083#(= main_~i~0 5), 29084#(= main_~i~0 6), 29085#(= main_~i~0 7), 29086#(= main_~i~0 8), 29087#(= main_~i~0 9), 29088#(= main_~i~0 10), 29089#(= main_~i~0 11), 29090#(= main_~i~0 12), 29091#(= main_~i~0 13), 29092#(= main_~i~0 14), 29093#(= main_~i~0 15), 29094#(= main_~i~0 16), 29095#(= main_~i~0 17), 29096#(= main_~i~0 18), 29097#(= main_~i~0 19), 29098#(= main_~i~0 20), 29099#(= main_~i~0 21), 29100#(= main_~i~0 22), 29101#(= main_~i~0 23), 29102#(= main_~i~0 24), 29103#(= main_~i~0 25), 29104#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:16,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 16:59:16,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 16:59:16,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:59:16,237 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 29 states. [2018-04-10 16:59:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:17,198 INFO L93 Difference]: Finished difference Result 2461 states and 2850 transitions. [2018-04-10 16:59:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:59:17,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 137 [2018-04-10 16:59:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:17,203 INFO L225 Difference]: With dead ends: 2461 [2018-04-10 16:59:17,203 INFO L226 Difference]: Without dead ends: 2461 [2018-04-10 16:59:17,204 INFO L567 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-04-10 16:59:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2018-04-10 16:59:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 236. [2018-04-10 16:59:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:59:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-10 16:59:17,213 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 137 [2018-04-10 16:59:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:17,213 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-10 16:59:17,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 16:59:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-10 16:59:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-10 16:59:17,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:17,214 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:17,214 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1993804937, now seen corresponding path program 27 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-04-10 16:59:17,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:17,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:17,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 16:59:17,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:17,454 INFO L182 omatonBuilderFactory]: Interpolants [31808#(= main_~i~0 2), 31809#(= main_~i~0 3), 31810#(= main_~i~0 4), 31811#(= main_~i~0 5), 31812#(= main_~i~0 6), 31813#(= main_~i~0 7), 31814#(= main_~i~0 8), 31815#(= main_~i~0 9), 31816#(= main_~i~0 10), 31817#(= main_~i~0 11), 31818#(= main_~i~0 12), 31819#(= main_~i~0 13), 31820#(= main_~i~0 14), 31821#(= main_~i~0 15), 31822#(= main_~i~0 16), 31823#(= main_~i~0 17), 31824#(= main_~i~0 18), 31825#(= main_~i~0 19), 31826#(= main_~i~0 20), 31827#(= main_~i~0 21), 31828#(= main_~i~0 22), 31829#(= main_~i~0 23), 31830#(= main_~i~0 24), 31831#(= main_~i~0 25), 31832#(= main_~i~0 26), 31833#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 31802#true, 31803#false, 31806#(= main_~i~0 0), 31807#(= main_~i~0 1)] [2018-04-10 16:59:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:17,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:59:17,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:59:17,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:59:17,455 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 30 states. [2018-04-10 16:59:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:18,432 INFO L93 Difference]: Finished difference Result 2555 states and 2959 transitions. [2018-04-10 16:59:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 16:59:18,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 142 [2018-04-10 16:59:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:18,437 INFO L225 Difference]: With dead ends: 2555 [2018-04-10 16:59:18,438 INFO L226 Difference]: Without dead ends: 2555 [2018-04-10 16:59:18,438 INFO L567 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-04-10 16:59:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-04-10 16:59:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 241. [2018-04-10 16:59:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-10 16:59:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2018-04-10 16:59:18,447 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 142 [2018-04-10 16:59:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:18,447 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2018-04-10 16:59:18,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:59:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2018-04-10 16:59:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-10 16:59:18,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:18,448 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:18,448 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -614525061, now seen corresponding path program 14 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-04-10 16:59:18,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-04-10 16:59:18,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:18,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:59:18,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-04-10 16:59:18,566 INFO L182 omatonBuilderFactory]: Interpolants [34689#(= main_~x~0 11), 34659#(= main_~x~0 5), 34630#true, 34694#(= main_~x~0 12), 34631#false, 34664#(= main_~x~0 6), 34634#(= 0 main_~x~0), 34699#(= main_~x~0 13), 34669#(= main_~x~0 7), 34639#(= 1 main_~x~0), 34704#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 34674#(= main_~x~0 8), 34644#(= main_~x~0 2), 34679#(= main_~x~0 9), 34649#(= main_~x~0 3), 34684#(= main_~x~0 10), 34654#(= main_~x~0 4)] [2018-04-10 16:59:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-04-10 16:59:18,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:59:18,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:59:18,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:59:18,567 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand 17 states. [2018-04-10 16:59:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:18,777 INFO L93 Difference]: Finished difference Result 247 states and 288 transitions. [2018-04-10 16:59:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:59:18,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2018-04-10 16:59:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:18,778 INFO L225 Difference]: With dead ends: 247 [2018-04-10 16:59:18,778 INFO L226 Difference]: Without dead ends: 247 [2018-04-10 16:59:18,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-04-10 16:59:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-10 16:59:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-04-10 16:59:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-10 16:59:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 288 transitions. [2018-04-10 16:59:18,782 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 288 transitions. Word has length 157 [2018-04-10 16:59:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:18,782 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 288 transitions. [2018-04-10 16:59:18,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:59:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 288 transitions. [2018-04-10 16:59:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 16:59:18,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:18,783 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:18,783 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1740113894, now seen corresponding path program 28 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-04-10 16:59:18,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:19,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:19,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 16:59:19,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:19,021 INFO L182 omatonBuilderFactory]: Interpolants [35200#false, 35203#(= main_~i~0 0), 35204#(= main_~i~0 1), 35205#(= main_~i~0 2), 35206#(= main_~i~0 3), 35207#(= main_~i~0 4), 35208#(= main_~i~0 5), 35209#(= main_~i~0 6), 35210#(= main_~i~0 7), 35211#(= main_~i~0 8), 35212#(= main_~i~0 9), 35213#(= main_~i~0 10), 35214#(= main_~i~0 11), 35215#(= main_~i~0 12), 35216#(= main_~i~0 13), 35217#(= main_~i~0 14), 35218#(= main_~i~0 15), 35219#(= main_~i~0 16), 35220#(= main_~i~0 17), 35221#(= main_~i~0 18), 35222#(= main_~i~0 19), 35223#(= main_~i~0 20), 35224#(= main_~i~0 21), 35225#(= main_~i~0 22), 35226#(= main_~i~0 23), 35227#(= main_~i~0 24), 35228#(= main_~i~0 25), 35229#(= main_~i~0 26), 35230#(= main_~i~0 27), 35231#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 35199#true] [2018-04-10 16:59:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:19,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 16:59:19,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 16:59:19,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:59:19,022 INFO L87 Difference]: Start difference. First operand 247 states and 288 transitions. Second operand 31 states. [2018-04-10 16:59:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:20,131 INFO L93 Difference]: Finished difference Result 2817 states and 3264 transitions. [2018-04-10 16:59:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 16:59:20,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-04-10 16:59:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:20,135 INFO L225 Difference]: With dead ends: 2817 [2018-04-10 16:59:20,135 INFO L226 Difference]: Without dead ends: 2817 [2018-04-10 16:59:20,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:59:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-04-10 16:59:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 252. [2018-04-10 16:59:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-10 16:59:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 294 transitions. [2018-04-10 16:59:20,145 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 294 transitions. Word has length 147 [2018-04-10 16:59:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:20,145 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 294 transitions. [2018-04-10 16:59:20,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 16:59:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 294 transitions. [2018-04-10 16:59:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 16:59:20,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:20,146 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:20,146 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -661579048, now seen corresponding path program 15 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-04-10 16:59:20,156 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-04-10 16:59:20,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:20,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:59:20,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-04-10 16:59:20,291 INFO L182 omatonBuilderFactory]: Interpolants [38305#(= 0 main_~x~0), 38370#(= main_~x~0 13), 38340#(= main_~x~0 7), 38310#(= 1 main_~x~0), 38375#(= main_~x~0 14), 38345#(= main_~x~0 8), 38315#(= main_~x~0 2), 38380#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 38350#(= main_~x~0 9), 38320#(= main_~x~0 3), 38355#(= main_~x~0 10), 38325#(= main_~x~0 4), 38360#(= main_~x~0 11), 38330#(= main_~x~0 5), 38301#true, 38365#(= main_~x~0 12), 38302#false, 38335#(= main_~x~0 6)] [2018-04-10 16:59:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-04-10 16:59:20,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:59:20,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:59:20,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:59:20,292 INFO L87 Difference]: Start difference. First operand 252 states and 294 transitions. Second operand 18 states. [2018-04-10 16:59:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:20,574 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2018-04-10 16:59:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:59:20,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2018-04-10 16:59:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:20,575 INFO L225 Difference]: With dead ends: 258 [2018-04-10 16:59:20,576 INFO L226 Difference]: Without dead ends: 258 [2018-04-10 16:59:20,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 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-04-10 16:59:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-10 16:59:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-10 16:59:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-10 16:59:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 301 transitions. [2018-04-10 16:59:20,579 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 301 transitions. Word has length 167 [2018-04-10 16:59:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:20,579 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 301 transitions. [2018-04-10 16:59:20,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:59:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 301 transitions. [2018-04-10 16:59:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-10 16:59:20,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:20,580 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:20,580 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash 685727959, now seen corresponding path program 29 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-04-10 16:59:20,585 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:20,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:20,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 16:59:20,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:20,842 INFO L182 omatonBuilderFactory]: Interpolants [38912#(= main_~i~0 11), 38913#(= main_~i~0 12), 38914#(= main_~i~0 13), 38915#(= main_~i~0 14), 38916#(= main_~i~0 15), 38917#(= main_~i~0 16), 38918#(= main_~i~0 17), 38919#(= main_~i~0 18), 38920#(= main_~i~0 19), 38921#(= main_~i~0 20), 38922#(= main_~i~0 21), 38923#(= main_~i~0 22), 38924#(= main_~i~0 23), 38925#(= main_~i~0 24), 38926#(= main_~i~0 25), 38927#(= main_~i~0 26), 38928#(= main_~i~0 27), 38929#(= main_~i~0 28), 38930#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 38897#true, 38898#false, 38901#(= main_~i~0 0), 38902#(= main_~i~0 1), 38903#(= main_~i~0 2), 38904#(= main_~i~0 3), 38905#(= main_~i~0 4), 38906#(= main_~i~0 5), 38907#(= main_~i~0 6), 38908#(= main_~i~0 7), 38909#(= main_~i~0 8), 38910#(= main_~i~0 9), 38911#(= main_~i~0 10)] [2018-04-10 16:59:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:20,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:59:20,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:59:20,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:59:20,843 INFO L87 Difference]: Start difference. First operand 258 states and 301 transitions. Second operand 32 states. [2018-04-10 16:59:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:22,052 INFO L93 Difference]: Finished difference Result 3091 states and 3583 transitions. [2018-04-10 16:59:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:59:22,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 152 [2018-04-10 16:59:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:22,056 INFO L225 Difference]: With dead ends: 3091 [2018-04-10 16:59:22,056 INFO L226 Difference]: Without dead ends: 3091 [2018-04-10 16:59:22,056 INFO L567 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-04-10 16:59:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2018-04-10 16:59:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 263. [2018-04-10 16:59:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 16:59:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 307 transitions. [2018-04-10 16:59:22,067 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 307 transitions. Word has length 152 [2018-04-10 16:59:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:22,067 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 307 transitions. [2018-04-10 16:59:22,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:59:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 307 transitions. [2018-04-10 16:59:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-10 16:59:22,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:22,068 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:22,068 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -842074490, now seen corresponding path program 30 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-04-10 16:59:22,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:22,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:22,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 16:59:22,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:22,349 INFO L182 omatonBuilderFactory]: Interpolants [42304#(= main_~i~0 15), 42305#(= main_~i~0 16), 42306#(= main_~i~0 17), 42307#(= main_~i~0 18), 42308#(= main_~i~0 19), 42309#(= main_~i~0 20), 42310#(= main_~i~0 21), 42311#(= main_~i~0 22), 42312#(= main_~i~0 23), 42313#(= main_~i~0 24), 42314#(= main_~i~0 25), 42315#(= main_~i~0 26), 42316#(= main_~i~0 27), 42317#(= main_~i~0 28), 42318#(= main_~i~0 29), 42319#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 42285#true, 42286#false, 42289#(= main_~i~0 0), 42290#(= main_~i~0 1), 42291#(= main_~i~0 2), 42292#(= main_~i~0 3), 42293#(= main_~i~0 4), 42294#(= main_~i~0 5), 42295#(= main_~i~0 6), 42296#(= main_~i~0 7), 42297#(= main_~i~0 8), 42298#(= main_~i~0 9), 42299#(= main_~i~0 10), 42300#(= main_~i~0 11), 42301#(= main_~i~0 12), 42302#(= main_~i~0 13), 42303#(= main_~i~0 14)] [2018-04-10 16:59:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:22,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 16:59:22,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 16:59:22,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:59:22,350 INFO L87 Difference]: Start difference. First operand 263 states and 307 transitions. Second operand 33 states. [2018-04-10 16:59:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:23,774 INFO L93 Difference]: Finished difference Result 3197 states and 3706 transitions. [2018-04-10 16:59:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 16:59:23,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2018-04-10 16:59:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:23,780 INFO L225 Difference]: With dead ends: 3197 [2018-04-10 16:59:23,780 INFO L226 Difference]: Without dead ends: 3197 [2018-04-10 16:59:23,781 INFO L567 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-04-10 16:59:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-04-10 16:59:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 268. [2018-04-10 16:59:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 16:59:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 313 transitions. [2018-04-10 16:59:23,801 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 313 transitions. Word has length 157 [2018-04-10 16:59:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:23,801 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 313 transitions. [2018-04-10 16:59:23,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 16:59:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 313 transitions. [2018-04-10 16:59:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 16:59:23,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:23,802 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:23,802 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1148210677, now seen corresponding path program 16 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-04-10 16:59:23,805 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-04-10 16:59:23,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:23,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:59:23,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-04-10 16:59:23,991 INFO L182 omatonBuilderFactory]: Interpolants [45824#(= main_~x~0 7), 45794#(= 1 main_~x~0), 45859#(= main_~x~0 14), 45829#(= main_~x~0 8), 45799#(= main_~x~0 2), 45864#(= main_~x~0 15), 45834#(= main_~x~0 9), 45804#(= main_~x~0 3), 45869#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 45839#(= main_~x~0 10), 45809#(= main_~x~0 4), 45844#(= main_~x~0 11), 45814#(= main_~x~0 5), 45785#true, 45849#(= main_~x~0 12), 45786#false, 45819#(= main_~x~0 6), 45789#(= 0 main_~x~0), 45854#(= main_~x~0 13)] [2018-04-10 16:59:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-04-10 16:59:23,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:59:23,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:59:23,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:59:23,992 INFO L87 Difference]: Start difference. First operand 268 states and 313 transitions. Second operand 19 states. [2018-04-10 16:59:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:24,264 INFO L93 Difference]: Finished difference Result 274 states and 320 transitions. [2018-04-10 16:59:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:59:24,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 177 [2018-04-10 16:59:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:24,265 INFO L225 Difference]: With dead ends: 274 [2018-04-10 16:59:24,265 INFO L226 Difference]: Without dead ends: 274 [2018-04-10 16:59:24,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:59:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-10 16:59:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-04-10 16:59:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-10 16:59:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 320 transitions. [2018-04-10 16:59:24,268 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 320 transitions. Word has length 177 [2018-04-10 16:59:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:24,269 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 320 transitions. [2018-04-10 16:59:24,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:59:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 320 transitions. [2018-04-10 16:59:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 16:59:24,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:24,270 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:24,270 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760951, now seen corresponding path program 31 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-04-10 16:59:24,285 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:24,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:24,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 16:59:24,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:24,691 INFO L182 omatonBuilderFactory]: Interpolants [46418#true, 46419#false, 46422#(= main_~i~0 0), 46423#(= main_~i~0 1), 46424#(= main_~i~0 2), 46425#(= main_~i~0 3), 46426#(= main_~i~0 4), 46427#(= main_~i~0 5), 46428#(= main_~i~0 6), 46429#(= main_~i~0 7), 46430#(= main_~i~0 8), 46431#(= main_~i~0 9), 46432#(= main_~i~0 10), 46433#(= main_~i~0 11), 46434#(= main_~i~0 12), 46435#(= main_~i~0 13), 46436#(= main_~i~0 14), 46437#(= main_~i~0 15), 46438#(= main_~i~0 16), 46439#(= main_~i~0 17), 46440#(= main_~i~0 18), 46441#(= main_~i~0 19), 46442#(= main_~i~0 20), 46443#(= main_~i~0 21), 46444#(= main_~i~0 22), 46445#(= main_~i~0 23), 46446#(= main_~i~0 24), 46447#(= main_~i~0 25), 46448#(= main_~i~0 26), 46449#(= main_~i~0 27), 46450#(= main_~i~0 28), 46451#(= main_~i~0 29), 46452#(= main_~i~0 30), 46453#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:24,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 16:59:24,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 16:59:24,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:59:24,691 INFO L87 Difference]: Start difference. First operand 274 states and 320 transitions. Second operand 34 states. [2018-04-10 16:59:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:26,052 INFO L93 Difference]: Finished difference Result 3489 states and 4046 transitions. [2018-04-10 16:59:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:59:26,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2018-04-10 16:59:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:26,056 INFO L225 Difference]: With dead ends: 3489 [2018-04-10 16:59:26,056 INFO L226 Difference]: Without dead ends: 3489 [2018-04-10 16:59:26,056 INFO L567 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-04-10 16:59:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2018-04-10 16:59:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 279. [2018-04-10 16:59:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-10 16:59:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 326 transitions. [2018-04-10 16:59:26,072 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 326 transitions. Word has length 162 [2018-04-10 16:59:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:26,073 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 326 transitions. [2018-04-10 16:59:26,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 16:59:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 326 transitions. [2018-04-10 16:59:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 16:59:26,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:26,073 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:26,073 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1115415258, now seen corresponding path program 32 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-04-10 16:59:26,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:26,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:26,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 16:59:26,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:26,463 INFO L182 omatonBuilderFactory]: Interpolants [50240#(= main_~i~0 14), 50241#(= main_~i~0 15), 50242#(= main_~i~0 16), 50243#(= main_~i~0 17), 50244#(= main_~i~0 18), 50245#(= main_~i~0 19), 50246#(= main_~i~0 20), 50247#(= main_~i~0 21), 50248#(= main_~i~0 22), 50249#(= main_~i~0 23), 50250#(= main_~i~0 24), 50251#(= main_~i~0 25), 50252#(= main_~i~0 26), 50253#(= main_~i~0 27), 50254#(= main_~i~0 28), 50255#(= main_~i~0 29), 50256#(= main_~i~0 30), 50257#(= main_~i~0 31), 50258#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 50222#true, 50223#false, 50226#(= main_~i~0 0), 50227#(= main_~i~0 1), 50228#(= main_~i~0 2), 50229#(= main_~i~0 3), 50230#(= main_~i~0 4), 50231#(= main_~i~0 5), 50232#(= main_~i~0 6), 50233#(= main_~i~0 7), 50234#(= main_~i~0 8), 50235#(= main_~i~0 9), 50236#(= main_~i~0 10), 50237#(= main_~i~0 11), 50238#(= main_~i~0 12), 50239#(= main_~i~0 13)] [2018-04-10 16:59:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:26,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 16:59:26,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 16:59:26,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:59:26,464 INFO L87 Difference]: Start difference. First operand 279 states and 326 transitions. Second operand 35 states. [2018-04-10 16:59:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:27,900 INFO L93 Difference]: Finished difference Result 3601 states and 4176 transitions. [2018-04-10 16:59:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:59:27,907 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-10 16:59:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:27,915 INFO L225 Difference]: With dead ends: 3601 [2018-04-10 16:59:27,915 INFO L226 Difference]: Without dead ends: 3601 [2018-04-10 16:59:27,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:59:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2018-04-10 16:59:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 284. [2018-04-10 16:59:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-10 16:59:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2018-04-10 16:59:27,938 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 167 [2018-04-10 16:59:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:27,938 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2018-04-10 16:59:27,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 16:59:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2018-04-10 16:59:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-10 16:59:27,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:27,939 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:27,939 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 320078034, now seen corresponding path program 17 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) [2018-04-10 16:59:27,949 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-04-10 16:59:28,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:28,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:59:28,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-04-10 16:59:28,166 INFO L182 omatonBuilderFactory]: Interpolants [54144#true, 54208#(= main_~x~0 12), 54145#false, 54178#(= main_~x~0 6), 54148#(= 0 main_~x~0), 54213#(= main_~x~0 13), 54183#(= main_~x~0 7), 54153#(= 1 main_~x~0), 54218#(= main_~x~0 14), 54188#(= main_~x~0 8), 54158#(= main_~x~0 2), 54223#(= main_~x~0 15), 54193#(= main_~x~0 9), 54163#(= main_~x~0 3), 54228#(= main_~x~0 16), 54198#(= main_~x~0 10), 54168#(= main_~x~0 4), 54233#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 54203#(= main_~x~0 11), 54173#(= main_~x~0 5)] [2018-04-10 16:59:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-04-10 16:59:28,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:59:28,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:59:28,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:59:28,167 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand 20 states. [2018-04-10 16:59:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:28,554 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-04-10 16:59:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:59:28,555 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 187 [2018-04-10 16:59:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:28,556 INFO L225 Difference]: With dead ends: 290 [2018-04-10 16:59:28,556 INFO L226 Difference]: Without dead ends: 290 [2018-04-10 16:59:28,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:59:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-10 16:59:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-04-10 16:59:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-10 16:59:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2018-04-10 16:59:28,558 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 187 [2018-04-10 16:59:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:28,558 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2018-04-10 16:59:28,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:59:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2018-04-10 16:59:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:59:28,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:28,559 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:28,559 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash -712076393, now seen corresponding path program 33 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-04-10 16:59:28,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:28,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:28,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 16:59:28,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:28,957 INFO L182 omatonBuilderFactory]: Interpolants [54848#(= main_~i~0 30), 54849#(= main_~i~0 31), 54850#(= main_~i~0 32), 54851#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 54814#true, 54815#false, 54818#(= main_~i~0 0), 54819#(= main_~i~0 1), 54820#(= main_~i~0 2), 54821#(= main_~i~0 3), 54822#(= main_~i~0 4), 54823#(= main_~i~0 5), 54824#(= main_~i~0 6), 54825#(= main_~i~0 7), 54826#(= main_~i~0 8), 54827#(= main_~i~0 9), 54828#(= main_~i~0 10), 54829#(= main_~i~0 11), 54830#(= main_~i~0 12), 54831#(= main_~i~0 13), 54832#(= main_~i~0 14), 54833#(= main_~i~0 15), 54834#(= main_~i~0 16), 54835#(= main_~i~0 17), 54836#(= main_~i~0 18), 54837#(= main_~i~0 19), 54838#(= main_~i~0 20), 54839#(= main_~i~0 21), 54840#(= main_~i~0 22), 54841#(= main_~i~0 23), 54842#(= main_~i~0 24), 54843#(= main_~i~0 25), 54844#(= main_~i~0 26), 54845#(= main_~i~0 27), 54846#(= main_~i~0 28), 54847#(= main_~i~0 29)] [2018-04-10 16:59:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:28,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 16:59:28,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 16:59:28,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:59:28,958 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand 36 states. [2018-04-10 16:59:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:30,499 INFO L93 Difference]: Finished difference Result 3911 states and 4537 transitions. [2018-04-10 16:59:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 16:59:30,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 172 [2018-04-10 16:59:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:30,504 INFO L225 Difference]: With dead ends: 3911 [2018-04-10 16:59:30,504 INFO L226 Difference]: Without dead ends: 3911 [2018-04-10 16:59:30,504 INFO L567 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-04-10 16:59:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2018-04-10 16:59:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 295. [2018-04-10 16:59:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-10 16:59:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2018-04-10 16:59:30,517 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 172 [2018-04-10 16:59:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:30,517 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2018-04-10 16:59:30,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 16:59:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2018-04-10 16:59:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 16:59:30,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:30,518 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:30,518 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1349614534, now seen corresponding path program 34 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-04-10 16:59:30,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:30,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:30,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 16:59:30,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:30,870 INFO L182 omatonBuilderFactory]: Interpolants [59072#(= main_~i~0 10), 59073#(= main_~i~0 11), 59074#(= main_~i~0 12), 59075#(= main_~i~0 13), 59076#(= main_~i~0 14), 59077#(= main_~i~0 15), 59078#(= main_~i~0 16), 59079#(= main_~i~0 17), 59080#(= main_~i~0 18), 59081#(= main_~i~0 19), 59082#(= main_~i~0 20), 59083#(= main_~i~0 21), 59084#(= main_~i~0 22), 59085#(= main_~i~0 23), 59086#(= main_~i~0 24), 59087#(= main_~i~0 25), 59088#(= main_~i~0 26), 59089#(= main_~i~0 27), 59090#(= main_~i~0 28), 59091#(= main_~i~0 29), 59092#(= main_~i~0 30), 59093#(= main_~i~0 31), 59094#(= main_~i~0 32), 59095#(= main_~i~0 33), 59096#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 59058#true, 59059#false, 59062#(= main_~i~0 0), 59063#(= main_~i~0 1), 59064#(= main_~i~0 2), 59065#(= main_~i~0 3), 59066#(= main_~i~0 4), 59067#(= main_~i~0 5), 59068#(= main_~i~0 6), 59069#(= main_~i~0 7), 59070#(= main_~i~0 8), 59071#(= main_~i~0 9)] [2018-04-10 16:59:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:30,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:59:30,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:59:30,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:59:30,871 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand 37 states. [2018-04-10 16:59:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:32,491 INFO L93 Difference]: Finished difference Result 4029 states and 4674 transitions. [2018-04-10 16:59:32,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 16:59:32,492 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 177 [2018-04-10 16:59:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:32,494 INFO L225 Difference]: With dead ends: 4029 [2018-04-10 16:59:32,494 INFO L226 Difference]: Without dead ends: 4029 [2018-04-10 16:59:32,494 INFO L567 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-04-10 16:59:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2018-04-10 16:59:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 300. [2018-04-10 16:59:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-10 16:59:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 351 transitions. [2018-04-10 16:59:32,516 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 351 transitions. Word has length 177 [2018-04-10 16:59:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:32,517 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 351 transitions. [2018-04-10 16:59:32,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:59:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 351 transitions. [2018-04-10 16:59:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 16:59:32,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:32,517 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:32,517 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1079016593, now seen corresponding path program 18 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-04-10 16:59:32,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 16:59:32,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:32,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:59:32,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-04-10 16:59:32,716 INFO L182 omatonBuilderFactory]: Interpolants [63520#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 63426#true, 63490#(= main_~x~0 12), 63427#false, 63460#(= main_~x~0 6), 63430#(= 0 main_~x~0), 63495#(= main_~x~0 13), 63465#(= main_~x~0 7), 63435#(= 1 main_~x~0), 63500#(= main_~x~0 14), 63470#(= main_~x~0 8), 63440#(= main_~x~0 2), 63505#(= main_~x~0 15), 63475#(= main_~x~0 9), 63445#(= main_~x~0 3), 63510#(= main_~x~0 16), 63480#(= main_~x~0 10), 63450#(= main_~x~0 4), 63515#(= main_~x~0 17), 63485#(= main_~x~0 11), 63455#(= main_~x~0 5)] [2018-04-10 16:59:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 16:59:32,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:59:32,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:59:32,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:59:32,716 INFO L87 Difference]: Start difference. First operand 300 states and 351 transitions. Second operand 21 states. [2018-04-10 16:59:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:33,101 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2018-04-10 16:59:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:59:33,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 197 [2018-04-10 16:59:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:33,101 INFO L225 Difference]: With dead ends: 306 [2018-04-10 16:59:33,101 INFO L226 Difference]: Without dead ends: 306 [2018-04-10 16:59:33,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:59:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-10 16:59:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-04-10 16:59:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-10 16:59:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2018-04-10 16:59:33,103 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 197 [2018-04-10 16:59:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:33,103 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2018-04-10 16:59:33,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:59:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2018-04-10 16:59:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-10 16:59:33,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:33,104 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:33,104 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2024580873, now seen corresponding path program 35 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-04-10 16:59:33,107 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:33,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:33,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 16:59:33,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:33,455 INFO L182 omatonBuilderFactory]: Interpolants [64133#true, 64134#false, 64137#(= main_~i~0 0), 64138#(= main_~i~0 1), 64139#(= main_~i~0 2), 64140#(= main_~i~0 3), 64141#(= main_~i~0 4), 64142#(= main_~i~0 5), 64143#(= main_~i~0 6), 64144#(= main_~i~0 7), 64145#(= main_~i~0 8), 64146#(= main_~i~0 9), 64147#(= main_~i~0 10), 64148#(= main_~i~0 11), 64149#(= main_~i~0 12), 64150#(= main_~i~0 13), 64151#(= main_~i~0 14), 64152#(= main_~i~0 15), 64153#(= main_~i~0 16), 64154#(= main_~i~0 17), 64155#(= main_~i~0 18), 64156#(= main_~i~0 19), 64157#(= main_~i~0 20), 64158#(= main_~i~0 21), 64159#(= main_~i~0 22), 64160#(= main_~i~0 23), 64161#(= main_~i~0 24), 64162#(= main_~i~0 25), 64163#(= main_~i~0 26), 64164#(= main_~i~0 27), 64165#(= main_~i~0 28), 64166#(= main_~i~0 29), 64167#(= main_~i~0 30), 64168#(= main_~i~0 31), 64169#(= main_~i~0 32), 64170#(= main_~i~0 33), 64171#(= main_~i~0 34), 64172#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:33,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 16:59:33,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 16:59:33,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:59:33,455 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand 38 states. [2018-04-10 16:59:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:35,104 INFO L93 Difference]: Finished difference Result 4357 states and 5056 transitions. [2018-04-10 16:59:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:59:35,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 182 [2018-04-10 16:59:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:35,107 INFO L225 Difference]: With dead ends: 4357 [2018-04-10 16:59:35,107 INFO L226 Difference]: Without dead ends: 4357 [2018-04-10 16:59:35,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:59:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2018-04-10 16:59:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 311. [2018-04-10 16:59:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-10 16:59:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 364 transitions. [2018-04-10 16:59:35,124 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 364 transitions. Word has length 182 [2018-04-10 16:59:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:35,124 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 364 transitions. [2018-04-10 16:59:35,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 16:59:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 364 transitions. [2018-04-10 16:59:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-10 16:59:35,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:35,125 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:35,125 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash -407825818, now seen corresponding path program 36 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-04-10 16:59:35,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:35,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:35,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 16:59:35,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:35,523 INFO L182 omatonBuilderFactory]: Interpolants [68865#(= main_~i~0 20), 68864#(= main_~i~0 19), 68867#(= main_~i~0 22), 68866#(= main_~i~0 21), 68869#(= main_~i~0 24), 68868#(= main_~i~0 23), 68871#(= main_~i~0 26), 68870#(= main_~i~0 25), 68873#(= main_~i~0 28), 68872#(= main_~i~0 27), 68875#(= main_~i~0 30), 68874#(= main_~i~0 29), 68877#(= main_~i~0 32), 68876#(= main_~i~0 31), 68879#(= main_~i~0 34), 68878#(= main_~i~0 33), 68881#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 68880#(= main_~i~0 35), 68841#true, 68842#false, 68845#(= main_~i~0 0), 68847#(= main_~i~0 2), 68846#(= main_~i~0 1), 68849#(= main_~i~0 4), 68848#(= main_~i~0 3), 68851#(= main_~i~0 6), 68850#(= main_~i~0 5), 68853#(= main_~i~0 8), 68852#(= main_~i~0 7), 68855#(= main_~i~0 10), 68854#(= main_~i~0 9), 68857#(= main_~i~0 12), 68856#(= main_~i~0 11), 68859#(= main_~i~0 14), 68858#(= main_~i~0 13), 68861#(= main_~i~0 16), 68860#(= main_~i~0 15), 68863#(= main_~i~0 18), 68862#(= main_~i~0 17)] [2018-04-10 16:59:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:35,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 16:59:35,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 16:59:35,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:59:35,524 INFO L87 Difference]: Start difference. First operand 311 states and 364 transitions. Second operand 39 states. [2018-04-10 16:59:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:37,350 INFO L93 Difference]: Finished difference Result 4481 states and 5200 transitions. [2018-04-10 16:59:37,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 16:59:37,395 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 187 [2018-04-10 16:59:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:37,398 INFO L225 Difference]: With dead ends: 4481 [2018-04-10 16:59:37,398 INFO L226 Difference]: Without dead ends: 4481 [2018-04-10 16:59:37,399 INFO L567 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-04-10 16:59:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2018-04-10 16:59:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 316. [2018-04-10 16:59:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-10 16:59:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 370 transitions. [2018-04-10 16:59:37,415 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 370 transitions. Word has length 187 [2018-04-10 16:59:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:37,415 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 370 transitions. [2018-04-10 16:59:37,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 16:59:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 370 transitions. [2018-04-10 16:59:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 16:59:37,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:37,416 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:37,416 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 429008332, now seen corresponding path program 19 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-04-10 16:59:37,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-04-10 16:59:37,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:37,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:59:37,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-04-10 16:59:37,625 INFO L182 omatonBuilderFactory]: Interpolants [73728#(= main_~x~0 9), 73763#(= main_~x~0 16), 73698#(= main_~x~0 3), 73733#(= main_~x~0 10), 73703#(= main_~x~0 4), 73768#(= main_~x~0 17), 73738#(= main_~x~0 11), 73773#(= main_~x~0 18), 73708#(= main_~x~0 5), 73679#true, 73743#(= main_~x~0 12), 73713#(= main_~x~0 6), 73680#false, 73683#(= 0 main_~x~0), 73778#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 73748#(= main_~x~0 13), 73718#(= main_~x~0 7), 73753#(= main_~x~0 14), 73688#(= 1 main_~x~0), 73723#(= main_~x~0 8), 73693#(= main_~x~0 2), 73758#(= main_~x~0 15)] [2018-04-10 16:59:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-04-10 16:59:37,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:59:37,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:59:37,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:59:37,625 INFO L87 Difference]: Start difference. First operand 316 states and 370 transitions. Second operand 22 states. [2018-04-10 16:59:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:38,102 INFO L93 Difference]: Finished difference Result 322 states and 377 transitions. [2018-04-10 16:59:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:59:38,103 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 207 [2018-04-10 16:59:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:38,103 INFO L225 Difference]: With dead ends: 322 [2018-04-10 16:59:38,103 INFO L226 Difference]: Without dead ends: 322 [2018-04-10 16:59:38,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:59:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-10 16:59:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-04-10 16:59:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-04-10 16:59:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 377 transitions. [2018-04-10 16:59:38,105 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 377 transitions. Word has length 207 [2018-04-10 16:59:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:38,105 INFO L459 AbstractCegarLoop]: Abstraction has 322 states and 377 transitions. [2018-04-10 16:59:38,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:59:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 377 transitions. [2018-04-10 16:59:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-10 16:59:38,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:38,106 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:38,106 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1486297513, now seen corresponding path program 37 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-04-10 16:59:38,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:38,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:38,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-10 16:59:38,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:38,582 INFO L182 omatonBuilderFactory]: Interpolants [74433#(= main_~i~0 6), 74432#(= main_~i~0 5), 74435#(= main_~i~0 8), 74434#(= main_~i~0 7), 74437#(= main_~i~0 10), 74436#(= main_~i~0 9), 74439#(= main_~i~0 12), 74438#(= main_~i~0 11), 74441#(= main_~i~0 14), 74440#(= main_~i~0 13), 74443#(= main_~i~0 16), 74442#(= main_~i~0 15), 74445#(= main_~i~0 18), 74444#(= main_~i~0 17), 74447#(= main_~i~0 20), 74446#(= main_~i~0 19), 74449#(= main_~i~0 22), 74448#(= main_~i~0 21), 74451#(= main_~i~0 24), 74450#(= main_~i~0 23), 74453#(= main_~i~0 26), 74452#(= main_~i~0 25), 74455#(= main_~i~0 28), 74454#(= main_~i~0 27), 74457#(= main_~i~0 30), 74456#(= main_~i~0 29), 74459#(= main_~i~0 32), 74458#(= main_~i~0 31), 74461#(= main_~i~0 34), 74460#(= main_~i~0 33), 74463#(= main_~i~0 36), 74462#(= main_~i~0 35), 74464#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 74423#true, 74424#false, 74427#(= main_~i~0 0), 74429#(= main_~i~0 2), 74428#(= main_~i~0 1), 74431#(= main_~i~0 4), 74430#(= main_~i~0 3)] [2018-04-10 16:59:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:38,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 16:59:38,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 16:59:38,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 16:59:38,582 INFO L87 Difference]: Start difference. First operand 322 states and 377 transitions. Second operand 40 states. [2018-04-10 16:59:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:40,560 INFO L93 Difference]: Finished difference Result 4827 states and 5603 transitions. [2018-04-10 16:59:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 16:59:40,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2018-04-10 16:59:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:40,563 INFO L225 Difference]: With dead ends: 4827 [2018-04-10 16:59:40,563 INFO L226 Difference]: Without dead ends: 4827 [2018-04-10 16:59:40,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 16:59:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2018-04-10 16:59:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 327. [2018-04-10 16:59:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-10 16:59:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 383 transitions. [2018-04-10 16:59:40,580 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 383 transitions. Word has length 192 [2018-04-10 16:59:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:40,580 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 383 transitions. [2018-04-10 16:59:40,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 16:59:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 383 transitions. [2018-04-10 16:59:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 16:59:40,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:40,581 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:40,581 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash -785958935, now seen corresponding path program 20 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-04-10 16:59:40,583 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-04-10 16:59:40,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:40,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:59:40,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-04-10 16:59:40,786 INFO L182 omatonBuilderFactory]: Interpolants [79713#(= main_~x~0 18), 79648#(= main_~x~0 5), 79619#true, 79683#(= main_~x~0 12), 79653#(= main_~x~0 6), 79620#false, 79623#(= 0 main_~x~0), 79718#(= main_~x~0 19), 79688#(= main_~x~0 13), 79723#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 79658#(= main_~x~0 7), 79693#(= main_~x~0 14), 79628#(= 1 main_~x~0), 79663#(= main_~x~0 8), 79633#(= main_~x~0 2), 79698#(= main_~x~0 15), 79668#(= main_~x~0 9), 79703#(= main_~x~0 16), 79638#(= main_~x~0 3), 79673#(= main_~x~0 10), 79643#(= main_~x~0 4), 79708#(= main_~x~0 17), 79678#(= main_~x~0 11)] [2018-04-10 16:59:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-04-10 16:59:40,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:59:40,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:59:40,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:59:40,787 INFO L87 Difference]: Start difference. First operand 327 states and 383 transitions. Second operand 23 states. [2018-04-10 16:59:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:41,198 INFO L93 Difference]: Finished difference Result 333 states and 390 transitions. [2018-04-10 16:59:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:59:41,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 217 [2018-04-10 16:59:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:41,199 INFO L225 Difference]: With dead ends: 333 [2018-04-10 16:59:41,199 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 16:59:41,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 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-04-10 16:59:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 16:59:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-10 16:59:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-10 16:59:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 390 transitions. [2018-04-10 16:59:41,201 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 390 transitions. Word has length 217 [2018-04-10 16:59:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:41,201 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 390 transitions. [2018-04-10 16:59:41,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:59:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 390 transitions. [2018-04-10 16:59:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 16:59:41,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:41,202 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:41,202 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -874716922, now seen corresponding path program 38 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-04-10 16:59:41,204 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:41,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:41,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 16:59:41,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:41,618 INFO L182 omatonBuilderFactory]: Interpolants [80391#false, 80390#true, 80395#(= main_~i~0 1), 80394#(= main_~i~0 0), 80397#(= main_~i~0 3), 80396#(= main_~i~0 2), 80399#(= main_~i~0 5), 80398#(= main_~i~0 4), 80401#(= main_~i~0 7), 80400#(= main_~i~0 6), 80403#(= main_~i~0 9), 80402#(= main_~i~0 8), 80405#(= main_~i~0 11), 80404#(= main_~i~0 10), 80407#(= main_~i~0 13), 80406#(= main_~i~0 12), 80409#(= main_~i~0 15), 80408#(= main_~i~0 14), 80411#(= main_~i~0 17), 80410#(= main_~i~0 16), 80413#(= main_~i~0 19), 80412#(= main_~i~0 18), 80415#(= main_~i~0 21), 80414#(= main_~i~0 20), 80417#(= main_~i~0 23), 80416#(= main_~i~0 22), 80419#(= main_~i~0 25), 80418#(= main_~i~0 24), 80421#(= main_~i~0 27), 80420#(= main_~i~0 26), 80423#(= main_~i~0 29), 80422#(= main_~i~0 28), 80425#(= main_~i~0 31), 80424#(= main_~i~0 30), 80427#(= main_~i~0 33), 80426#(= main_~i~0 32), 80429#(= main_~i~0 35), 80428#(= main_~i~0 34), 80431#(= main_~i~0 37), 80430#(= main_~i~0 36), 80432#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 16:59:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:41,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:59:41,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:59:41,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:59:41,618 INFO L87 Difference]: Start difference. First operand 333 states and 390 transitions. Second operand 41 states. [2018-04-10 16:59:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:43,601 INFO L93 Difference]: Finished difference Result 5185 states and 6020 transitions. [2018-04-10 16:59:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 16:59:43,602 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 197 [2018-04-10 16:59:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:43,605 INFO L225 Difference]: With dead ends: 5185 [2018-04-10 16:59:43,605 INFO L226 Difference]: Without dead ends: 5185 [2018-04-10 16:59:43,605 INFO L567 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-04-10 16:59:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2018-04-10 16:59:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 338. [2018-04-10 16:59:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 16:59:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 396 transitions. [2018-04-10 16:59:43,623 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 396 transitions. Word has length 197 [2018-04-10 16:59:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:43,623 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 396 transitions. [2018-04-10 16:59:43,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:59:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 396 transitions. [2018-04-10 16:59:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 16:59:43,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:43,624 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:43,624 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093175, now seen corresponding path program 39 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-04-10 16:59:43,629 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:44,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:44,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-10 16:59:44,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:44,152 INFO L182 omatonBuilderFactory]: Interpolants [85957#false, 85956#true, 85961#(= main_~i~0 1), 85960#(= main_~i~0 0), 85963#(= main_~i~0 3), 85962#(= main_~i~0 2), 85965#(= main_~i~0 5), 85964#(= main_~i~0 4), 85967#(= main_~i~0 7), 85966#(= main_~i~0 6), 85969#(= main_~i~0 9), 85968#(= main_~i~0 8), 85971#(= main_~i~0 11), 85970#(= main_~i~0 10), 85973#(= main_~i~0 13), 85972#(= main_~i~0 12), 85975#(= main_~i~0 15), 85974#(= main_~i~0 14), 85977#(= main_~i~0 17), 85976#(= main_~i~0 16), 85979#(= main_~i~0 19), 85978#(= main_~i~0 18), 85981#(= main_~i~0 21), 85980#(= main_~i~0 20), 85983#(= main_~i~0 23), 85982#(= main_~i~0 22), 85985#(= main_~i~0 25), 85984#(= main_~i~0 24), 85987#(= main_~i~0 27), 85986#(= main_~i~0 26), 85989#(= main_~i~0 29), 85988#(= main_~i~0 28), 85991#(= main_~i~0 31), 85990#(= main_~i~0 30), 85993#(= main_~i~0 33), 85992#(= main_~i~0 32), 85995#(= main_~i~0 35), 85994#(= main_~i~0 34), 85997#(= main_~i~0 37), 85996#(= main_~i~0 36), 85999#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 85998#(= main_~i~0 38)] [2018-04-10 16:59:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:44,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:59:44,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:59:44,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:59:44,152 INFO L87 Difference]: Start difference. First operand 338 states and 396 transitions. Second operand 42 states. [2018-04-10 16:59:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:46,416 INFO L93 Difference]: Finished difference Result 5321 states and 6178 transitions. [2018-04-10 16:59:46,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 16:59:46,416 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-04-10 16:59:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:46,420 INFO L225 Difference]: With dead ends: 5321 [2018-04-10 16:59:46,420 INFO L226 Difference]: Without dead ends: 5321 [2018-04-10 16:59:46,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:59:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2018-04-10 16:59:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 343. [2018-04-10 16:59:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 16:59:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 402 transitions. [2018-04-10 16:59:46,439 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 402 transitions. Word has length 202 [2018-04-10 16:59:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:46,439 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 402 transitions. [2018-04-10 16:59:46,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:59:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 402 transitions. [2018-04-10 16:59:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 16:59:46,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:46,440 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:46,440 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -990508602, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:46,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-04-10 16:59:46,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:46,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:59:46,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-04-10 16:59:46,625 INFO L182 omatonBuilderFactory]: Interpolants [91713#(= main_~x~0 9), 91683#(= main_~x~0 3), 91748#(= main_~x~0 16), 91718#(= main_~x~0 10), 91753#(= main_~x~0 17), 91688#(= main_~x~0 4), 91723#(= main_~x~0 11), 91693#(= main_~x~0 5), 91758#(= main_~x~0 18), 91665#false, 91664#true, 91728#(= main_~x~0 12), 91763#(= main_~x~0 19), 91698#(= main_~x~0 6), 91733#(= main_~x~0 13), 91668#(= 0 main_~x~0), 91703#(= main_~x~0 7), 91673#(= 1 main_~x~0), 91768#(= main_~x~0 20), 91738#(= main_~x~0 14), 91773#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 91708#(= main_~x~0 8), 91743#(= main_~x~0 15), 91678#(= main_~x~0 2)] [2018-04-10 16:59:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-04-10 16:59:46,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:59:46,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:59:46,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:59:46,625 INFO L87 Difference]: Start difference. First operand 343 states and 402 transitions. Second operand 24 states. [2018-04-10 16:59:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:47,103 INFO L93 Difference]: Finished difference Result 349 states and 409 transitions. [2018-04-10 16:59:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:59:47,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 227 [2018-04-10 16:59:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:47,104 INFO L225 Difference]: With dead ends: 349 [2018-04-10 16:59:47,104 INFO L226 Difference]: Without dead ends: 349 [2018-04-10 16:59:47,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 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-04-10 16:59:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-10 16:59:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-04-10 16:59:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-10 16:59:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 409 transitions. [2018-04-10 16:59:47,106 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 409 transitions. Word has length 227 [2018-04-10 16:59:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:47,106 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 409 transitions. [2018-04-10 16:59:47,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:59:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 409 transitions. [2018-04-10 16:59:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 16:59:47,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:47,106 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:47,107 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -854661210, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:47,109 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:47,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:47,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 16:59:47,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:47,586 INFO L182 omatonBuilderFactory]: Interpolants [92481#(= main_~i~0 5), 92480#(= main_~i~0 4), 92483#(= main_~i~0 7), 92482#(= main_~i~0 6), 92485#(= main_~i~0 9), 92484#(= main_~i~0 8), 92487#(= main_~i~0 11), 92486#(= main_~i~0 10), 92489#(= main_~i~0 13), 92488#(= main_~i~0 12), 92491#(= main_~i~0 15), 92490#(= main_~i~0 14), 92493#(= main_~i~0 17), 92492#(= main_~i~0 16), 92495#(= main_~i~0 19), 92494#(= main_~i~0 18), 92497#(= main_~i~0 21), 92496#(= main_~i~0 20), 92499#(= main_~i~0 23), 92498#(= main_~i~0 22), 92501#(= main_~i~0 25), 92500#(= main_~i~0 24), 92503#(= main_~i~0 27), 92502#(= main_~i~0 26), 92505#(= main_~i~0 29), 92504#(= main_~i~0 28), 92507#(= main_~i~0 31), 92506#(= main_~i~0 30), 92509#(= main_~i~0 33), 92508#(= main_~i~0 32), 92511#(= main_~i~0 35), 92510#(= main_~i~0 34), 92513#(= main_~i~0 37), 92512#(= main_~i~0 36), 92515#(= main_~i~0 39), 92514#(= main_~i~0 38), 92516#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 92473#false, 92472#true, 92477#(= main_~i~0 1), 92476#(= main_~i~0 0), 92479#(= main_~i~0 3), 92478#(= main_~i~0 2)] [2018-04-10 16:59:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:47,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 16:59:47,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 16:59:47,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:59:47,586 INFO L87 Difference]: Start difference. First operand 349 states and 409 transitions. Second operand 43 states. [2018-04-10 16:59:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:49,762 INFO L93 Difference]: Finished difference Result 5697 states and 6616 transitions. [2018-04-10 16:59:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 16:59:49,763 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 207 [2018-04-10 16:59:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:49,767 INFO L225 Difference]: With dead ends: 5697 [2018-04-10 16:59:49,767 INFO L226 Difference]: Without dead ends: 5697 [2018-04-10 16:59:49,767 INFO L567 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-04-10 16:59:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2018-04-10 16:59:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 354. [2018-04-10 16:59:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-10 16:59:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 415 transitions. [2018-04-10 16:59:49,787 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 415 transitions. Word has length 207 [2018-04-10 16:59:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:49,787 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 415 transitions. [2018-04-10 16:59:49,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 16:59:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 415 transitions. [2018-04-10 16:59:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 16:59:49,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:49,787 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:49,788 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2040420631, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:49,792 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:50,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:50,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-10 16:59:50,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:50,300 INFO L182 omatonBuilderFactory]: Interpolants [98569#false, 98568#true, 98573#(= main_~i~0 1), 98572#(= main_~i~0 0), 98575#(= main_~i~0 3), 98574#(= main_~i~0 2), 98577#(= main_~i~0 5), 98576#(= main_~i~0 4), 98579#(= main_~i~0 7), 98578#(= main_~i~0 6), 98581#(= main_~i~0 9), 98580#(= main_~i~0 8), 98583#(= main_~i~0 11), 98582#(= main_~i~0 10), 98585#(= main_~i~0 13), 98584#(= main_~i~0 12), 98587#(= main_~i~0 15), 98586#(= main_~i~0 14), 98589#(= main_~i~0 17), 98588#(= main_~i~0 16), 98591#(= main_~i~0 19), 98590#(= main_~i~0 18), 98593#(= main_~i~0 21), 98592#(= main_~i~0 20), 98595#(= main_~i~0 23), 98594#(= main_~i~0 22), 98597#(= main_~i~0 25), 98596#(= main_~i~0 24), 98599#(= main_~i~0 27), 98598#(= main_~i~0 26), 98601#(= main_~i~0 29), 98600#(= main_~i~0 28), 98603#(= main_~i~0 31), 98602#(= main_~i~0 30), 98605#(= main_~i~0 33), 98604#(= main_~i~0 32), 98607#(= main_~i~0 35), 98606#(= main_~i~0 34), 98609#(= main_~i~0 37), 98608#(= main_~i~0 36), 98611#(= main_~i~0 39), 98610#(= main_~i~0 38), 98613#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 98612#(= main_~i~0 40)] [2018-04-10 16:59:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:50,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 16:59:50,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 16:59:50,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:59:50,301 INFO L87 Difference]: Start difference. First operand 354 states and 415 transitions. Second operand 44 states. [2018-04-10 16:59:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:52,636 INFO L93 Difference]: Finished difference Result 5839 states and 6781 transitions. [2018-04-10 16:59:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 16:59:52,672 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-04-10 16:59:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:52,676 INFO L225 Difference]: With dead ends: 5839 [2018-04-10 16:59:52,676 INFO L226 Difference]: Without dead ends: 5839 [2018-04-10 16:59:52,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:59:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2018-04-10 16:59:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 359. [2018-04-10 16:59:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-10 16:59:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2018-04-10 16:59:52,696 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 212 [2018-04-10 16:59:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:52,696 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2018-04-10 16:59:52,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 16:59:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2018-04-10 16:59:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-10 16:59:52,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:52,697 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:52,697 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash 245492579, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:52,699 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-04-10 16:59:52,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:52,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:59:52,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-04-10 16:59:52,895 INFO L182 omatonBuilderFactory]: Interpolants [104896#(= main_~x~0 16), 104901#(= main_~x~0 17), 104836#(= main_~x~0 4), 104841#(= main_~x~0 5), 104906#(= main_~x~0 18), 104911#(= main_~x~0 19), 104846#(= main_~x~0 6), 104851#(= main_~x~0 7), 104916#(= main_~x~0 20), 104921#(= main_~x~0 21), 104856#(= main_~x~0 8), 104861#(= main_~x~0 9), 104926#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 104866#(= main_~x~0 10), 104871#(= main_~x~0 11), 104813#false, 104812#true, 104876#(= main_~x~0 12), 104881#(= main_~x~0 13), 104816#(= 0 main_~x~0), 104821#(= 1 main_~x~0), 104886#(= main_~x~0 14), 104891#(= main_~x~0 15), 104826#(= main_~x~0 2), 104831#(= main_~x~0 3)] [2018-04-10 16:59:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-04-10 16:59:52,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:59:52,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:59:52,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:59:52,895 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand 25 states. [2018-04-10 16:59:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:53,416 INFO L93 Difference]: Finished difference Result 365 states and 428 transitions. [2018-04-10 16:59:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:59:53,416 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 237 [2018-04-10 16:59:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:53,416 INFO L225 Difference]: With dead ends: 365 [2018-04-10 16:59:53,416 INFO L226 Difference]: Without dead ends: 365 [2018-04-10 16:59:53,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 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-04-10 16:59:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-10 16:59:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-04-10 16:59:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-10 16:59:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 428 transitions. [2018-04-10 16:59:53,418 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 428 transitions. Word has length 237 [2018-04-10 16:59:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:53,418 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 428 transitions. [2018-04-10 16:59:53,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:59:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 428 transitions. [2018-04-10 16:59:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 16:59:53,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:53,419 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:53,419 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash -488561082, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:53,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:53,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:53,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 16:59:53,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:53,909 INFO L182 omatonBuilderFactory]: Interpolants [105665#(= main_~i~0 4), 105664#(= main_~i~0 3), 105667#(= main_~i~0 6), 105666#(= main_~i~0 5), 105669#(= main_~i~0 8), 105668#(= main_~i~0 7), 105671#(= main_~i~0 10), 105670#(= main_~i~0 9), 105673#(= main_~i~0 12), 105672#(= main_~i~0 11), 105675#(= main_~i~0 14), 105674#(= main_~i~0 13), 105677#(= main_~i~0 16), 105676#(= main_~i~0 15), 105679#(= main_~i~0 18), 105678#(= main_~i~0 17), 105681#(= main_~i~0 20), 105680#(= main_~i~0 19), 105683#(= main_~i~0 22), 105682#(= main_~i~0 21), 105685#(= main_~i~0 24), 105684#(= main_~i~0 23), 105687#(= main_~i~0 26), 105686#(= main_~i~0 25), 105689#(= main_~i~0 28), 105688#(= main_~i~0 27), 105691#(= main_~i~0 30), 105690#(= main_~i~0 29), 105693#(= main_~i~0 32), 105692#(= main_~i~0 31), 105695#(= main_~i~0 34), 105694#(= main_~i~0 33), 105697#(= main_~i~0 36), 105696#(= main_~i~0 35), 105699#(= main_~i~0 38), 105698#(= main_~i~0 37), 105701#(= main_~i~0 40), 105700#(= main_~i~0 39), 105703#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 105702#(= main_~i~0 41), 105657#true, 105658#false, 105661#(= main_~i~0 0), 105663#(= main_~i~0 2), 105662#(= main_~i~0 1)] [2018-04-10 16:59:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:53,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 16:59:53,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 16:59:53,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:59:53,909 INFO L87 Difference]: Start difference. First operand 365 states and 428 transitions. Second operand 45 states. [2018-04-10 16:59:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:56,326 INFO L93 Difference]: Finished difference Result 6233 states and 7240 transitions. [2018-04-10 16:59:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 16:59:56,327 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 217 [2018-04-10 16:59:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:56,331 INFO L225 Difference]: With dead ends: 6233 [2018-04-10 16:59:56,331 INFO L226 Difference]: Without dead ends: 6233 [2018-04-10 16:59:56,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:59:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2018-04-10 16:59:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 370. [2018-04-10 16:59:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-10 16:59:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 434 transitions. [2018-04-10 16:59:56,352 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 434 transitions. Word has length 217 [2018-04-10 16:59:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:56,352 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 434 transitions. [2018-04-10 16:59:56,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 16:59:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 434 transitions. [2018-04-10 16:59:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-10 16:59:56,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:56,353 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:56,353 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash 344604279, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:56,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:56,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:56,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-10 16:59:56,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:56,847 INFO L182 omatonBuilderFactory]: Interpolants [112321#(= main_~i~0 10), 112320#(= main_~i~0 9), 112323#(= main_~i~0 12), 112322#(= main_~i~0 11), 112325#(= main_~i~0 14), 112324#(= main_~i~0 13), 112327#(= main_~i~0 16), 112326#(= main_~i~0 15), 112329#(= main_~i~0 18), 112328#(= main_~i~0 17), 112331#(= main_~i~0 20), 112330#(= main_~i~0 19), 112333#(= main_~i~0 22), 112332#(= main_~i~0 21), 112335#(= main_~i~0 24), 112334#(= main_~i~0 23), 112337#(= main_~i~0 26), 112336#(= main_~i~0 25), 112339#(= main_~i~0 28), 112338#(= main_~i~0 27), 112341#(= main_~i~0 30), 112340#(= main_~i~0 29), 112343#(= main_~i~0 32), 112342#(= main_~i~0 31), 112345#(= main_~i~0 34), 112344#(= main_~i~0 33), 112347#(= main_~i~0 36), 112346#(= main_~i~0 35), 112349#(= main_~i~0 38), 112348#(= main_~i~0 37), 112351#(= main_~i~0 40), 112350#(= main_~i~0 39), 112353#(= main_~i~0 42), 112352#(= main_~i~0 41), 112354#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 112307#true, 112308#false, 112311#(= main_~i~0 0), 112313#(= main_~i~0 2), 112312#(= main_~i~0 1), 112315#(= main_~i~0 4), 112314#(= main_~i~0 3), 112317#(= main_~i~0 6), 112316#(= main_~i~0 5), 112319#(= main_~i~0 8), 112318#(= main_~i~0 7)] [2018-04-10 16:59:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:59:56,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 16:59:56,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 16:59:56,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 16:59:56,848 INFO L87 Difference]: Start difference. First operand 370 states and 434 transitions. Second operand 46 states. [2018-04-10 16:59:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:59:59,381 INFO L93 Difference]: Finished difference Result 6381 states and 7412 transitions. [2018-04-10 16:59:59,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 16:59:59,381 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 222 [2018-04-10 16:59:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:59:59,386 INFO L225 Difference]: With dead ends: 6381 [2018-04-10 16:59:59,386 INFO L226 Difference]: Without dead ends: 6381 [2018-04-10 16:59:59,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 16:59:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2018-04-10 16:59:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 375. [2018-04-10 16:59:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-04-10 16:59:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2018-04-10 16:59:59,425 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 222 [2018-04-10 16:59:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:59:59,425 INFO L459 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2018-04-10 16:59:59,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 16:59:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2018-04-10 16:59:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 16:59:59,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:59:59,426 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:59:59,426 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:59:59,426 INFO L82 PathProgramCache]: Analyzing trace with hash -806736704, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 16:59:59,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 16:59:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:59:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-04-10 16:59:59,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:59:59,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:59:59,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 16:59:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-04-10 16:59:59,641 INFO L182 omatonBuilderFactory]: Interpolants [119170#(= main_~x~0 11), 119111#true, 119175#(= main_~x~0 12), 119112#false, 119115#(= 0 main_~x~0), 119180#(= main_~x~0 13), 119185#(= main_~x~0 14), 119120#(= 1 main_~x~0), 119125#(= main_~x~0 2), 119190#(= main_~x~0 15), 119195#(= main_~x~0 16), 119130#(= main_~x~0 3), 119135#(= main_~x~0 4), 119200#(= main_~x~0 17), 119205#(= main_~x~0 18), 119140#(= main_~x~0 5), 119145#(= main_~x~0 6), 119210#(= main_~x~0 19), 119215#(= main_~x~0 20), 119150#(= main_~x~0 7), 119155#(= main_~x~0 8), 119220#(= main_~x~0 21), 119225#(= main_~x~0 22), 119160#(= main_~x~0 9), 119165#(= main_~x~0 10), 119230#(and (< main_~x~0 100000) (<= 0 main_~x~0))] [2018-04-10 16:59:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-04-10 16:59:59,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:59:59,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:59:59,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:59:59,642 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand 26 states. [2018-04-10 17:00:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:00,202 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-04-10 17:00:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 17:00:00,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 247 [2018-04-10 17:00:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:00,203 INFO L225 Difference]: With dead ends: 381 [2018-04-10 17:00:00,203 INFO L226 Difference]: Without dead ends: 381 [2018-04-10 17:00:00,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-10 17:00:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-10 17:00:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-04-10 17:00:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-10 17:00:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 447 transitions. [2018-04-10 17:00:00,205 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 447 transitions. Word has length 247 [2018-04-10 17:00:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:00,205 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 447 transitions. [2018-04-10 17:00:00,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 17:00:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 447 transitions. [2018-04-10 17:00:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 17:00:00,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:00,206 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:00,206 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -865231642, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:00,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:00,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:00,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 17:00:00,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:00,731 INFO L182 omatonBuilderFactory]: Interpolants [120001#(= main_~i~0 4), 120000#(= main_~i~0 3), 120003#(= main_~i~0 6), 120002#(= main_~i~0 5), 120005#(= main_~i~0 8), 120004#(= main_~i~0 7), 120007#(= main_~i~0 10), 120006#(= main_~i~0 9), 120009#(= main_~i~0 12), 120008#(= main_~i~0 11), 120011#(= main_~i~0 14), 120010#(= main_~i~0 13), 120013#(= main_~i~0 16), 120012#(= main_~i~0 15), 120015#(= main_~i~0 18), 120014#(= main_~i~0 17), 120017#(= main_~i~0 20), 120016#(= main_~i~0 19), 120019#(= main_~i~0 22), 120018#(= main_~i~0 21), 120021#(= main_~i~0 24), 120020#(= main_~i~0 23), 120023#(= main_~i~0 26), 120022#(= main_~i~0 25), 120025#(= main_~i~0 28), 120024#(= main_~i~0 27), 120027#(= main_~i~0 30), 120026#(= main_~i~0 29), 120029#(= main_~i~0 32), 120028#(= main_~i~0 31), 120031#(= main_~i~0 34), 120030#(= main_~i~0 33), 120033#(= main_~i~0 36), 120032#(= main_~i~0 35), 120035#(= main_~i~0 38), 120034#(= main_~i~0 37), 120037#(= main_~i~0 40), 120036#(= main_~i~0 39), 120039#(= main_~i~0 42), 120038#(= main_~i~0 41), 120041#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 120040#(= main_~i~0 43), 119993#true, 119994#false, 119997#(= main_~i~0 0), 119999#(= main_~i~0 2), 119998#(= main_~i~0 1)] [2018-04-10 17:00:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:00,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 17:00:00,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 17:00:00,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 17:00:00,732 INFO L87 Difference]: Start difference. First operand 381 states and 447 transitions. Second operand 47 states. [2018-04-10 17:00:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:03,685 INFO L93 Difference]: Finished difference Result 6793 states and 7892 transitions. [2018-04-10 17:00:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 17:00:03,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 227 [2018-04-10 17:00:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:03,691 INFO L225 Difference]: With dead ends: 6793 [2018-04-10 17:00:03,691 INFO L226 Difference]: Without dead ends: 6793 [2018-04-10 17:00:03,691 INFO L567 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-04-10 17:00:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2018-04-10 17:00:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 386. [2018-04-10 17:00:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-10 17:00:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 453 transitions. [2018-04-10 17:00:03,733 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 453 transitions. Word has length 227 [2018-04-10 17:00:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:03,733 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 453 transitions. [2018-04-10 17:00:03,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 17:00:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 453 transitions. [2018-04-10 17:00:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 17:00:03,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:03,735 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:03,735 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1352733737, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:03,737 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:04,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:04,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 17:00:04,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:04,267 INFO L182 omatonBuilderFactory]: Interpolants [127233#(= main_~i~0 8), 127232#(= main_~i~0 7), 127235#(= main_~i~0 10), 127234#(= main_~i~0 9), 127237#(= main_~i~0 12), 127236#(= main_~i~0 11), 127239#(= main_~i~0 14), 127238#(= main_~i~0 13), 127241#(= main_~i~0 16), 127240#(= main_~i~0 15), 127243#(= main_~i~0 18), 127242#(= main_~i~0 17), 127245#(= main_~i~0 20), 127244#(= main_~i~0 19), 127247#(= main_~i~0 22), 127246#(= main_~i~0 21), 127249#(= main_~i~0 24), 127248#(= main_~i~0 23), 127251#(= main_~i~0 26), 127250#(= main_~i~0 25), 127253#(= main_~i~0 28), 127252#(= main_~i~0 27), 127255#(= main_~i~0 30), 127254#(= main_~i~0 29), 127257#(= main_~i~0 32), 127256#(= main_~i~0 31), 127259#(= main_~i~0 34), 127258#(= main_~i~0 33), 127261#(= main_~i~0 36), 127260#(= main_~i~0 35), 127263#(= main_~i~0 38), 127262#(= main_~i~0 37), 127265#(= main_~i~0 40), 127264#(= main_~i~0 39), 127267#(= main_~i~0 42), 127266#(= main_~i~0 41), 127269#(= main_~i~0 44), 127268#(= main_~i~0 43), 127270#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 127221#true, 127222#false, 127225#(= main_~i~0 0), 127227#(= main_~i~0 2), 127226#(= main_~i~0 1), 127229#(= main_~i~0 4), 127228#(= main_~i~0 3), 127231#(= main_~i~0 6), 127230#(= main_~i~0 5)] [2018-04-10 17:00:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:04,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 17:00:04,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 17:00:04,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 17:00:04,268 INFO L87 Difference]: Start difference. First operand 386 states and 453 transitions. Second operand 48 states. [2018-04-10 17:00:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:07,026 INFO L93 Difference]: Finished difference Result 6947 states and 8071 transitions. [2018-04-10 17:00:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 17:00:07,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 232 [2018-04-10 17:00:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:07,031 INFO L225 Difference]: With dead ends: 6947 [2018-04-10 17:00:07,032 INFO L226 Difference]: Without dead ends: 6947 [2018-04-10 17:00:07,032 INFO L567 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-04-10 17:00:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2018-04-10 17:00:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 391. [2018-04-10 17:00:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 17:00:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 459 transitions. [2018-04-10 17:00:07,056 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 459 transitions. Word has length 232 [2018-04-10 17:00:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:07,056 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 459 transitions. [2018-04-10 17:00:07,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 17:00:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 459 transitions. [2018-04-10 17:00:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-10 17:00:07,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:07,057 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:07,057 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1079370275, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:07,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-04-10 17:00:07,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:07,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 17:00:07,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-04-10 17:00:07,293 INFO L182 omatonBuilderFactory]: Interpolants [134658#(= main_~x~0 9), 134723#(= main_~x~0 22), 134663#(= main_~x~0 10), 134728#(= main_~x~0 23), 134668#(= main_~x~0 11), 134733#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 134610#false, 134609#true, 134673#(= main_~x~0 12), 134678#(= main_~x~0 13), 134613#(= 0 main_~x~0), 134618#(= 1 main_~x~0), 134683#(= main_~x~0 14), 134623#(= main_~x~0 2), 134688#(= main_~x~0 15), 134628#(= main_~x~0 3), 134693#(= main_~x~0 16), 134698#(= main_~x~0 17), 134633#(= main_~x~0 4), 134638#(= main_~x~0 5), 134703#(= main_~x~0 18), 134643#(= main_~x~0 6), 134708#(= main_~x~0 19), 134648#(= main_~x~0 7), 134713#(= main_~x~0 20), 134718#(= main_~x~0 21), 134653#(= main_~x~0 8)] [2018-04-10 17:00:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-04-10 17:00:07,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 17:00:07,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 17:00:07,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-10 17:00:07,294 INFO L87 Difference]: Start difference. First operand 391 states and 459 transitions. Second operand 27 states. [2018-04-10 17:00:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:07,901 INFO L93 Difference]: Finished difference Result 397 states and 466 transitions. [2018-04-10 17:00:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 17:00:07,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 257 [2018-04-10 17:00:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:07,901 INFO L225 Difference]: With dead ends: 397 [2018-04-10 17:00:07,902 INFO L226 Difference]: Without dead ends: 397 [2018-04-10 17:00:07,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 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-04-10 17:00:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-10 17:00:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-04-10 17:00:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-10 17:00:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 466 transitions. [2018-04-10 17:00:07,903 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 466 transitions. Word has length 257 [2018-04-10 17:00:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:07,904 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 466 transitions. [2018-04-10 17:00:07,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 17:00:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 466 transitions. [2018-04-10 17:00:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-10 17:00:07,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:07,904 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:07,904 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1337046138, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:07,907 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:08,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:08,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 17:00:08,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:08,513 INFO L182 omatonBuilderFactory]: Interpolants [135554#(= main_~i~0 22), 135555#(= main_~i~0 23), 135552#(= main_~i~0 20), 135553#(= main_~i~0 21), 135558#(= main_~i~0 26), 135559#(= main_~i~0 27), 135556#(= main_~i~0 24), 135557#(= main_~i~0 25), 135562#(= main_~i~0 30), 135563#(= main_~i~0 31), 135560#(= main_~i~0 28), 135561#(= main_~i~0 29), 135566#(= main_~i~0 34), 135567#(= main_~i~0 35), 135564#(= main_~i~0 32), 135565#(= main_~i~0 33), 135570#(= main_~i~0 38), 135571#(= main_~i~0 39), 135568#(= main_~i~0 36), 135569#(= main_~i~0 37), 135574#(= main_~i~0 42), 135575#(= main_~i~0 43), 135572#(= main_~i~0 40), 135573#(= main_~i~0 41), 135578#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 135576#(= main_~i~0 44), 135577#(= main_~i~0 45), 135528#true, 135529#false, 135534#(= main_~i~0 2), 135535#(= main_~i~0 3), 135532#(= main_~i~0 0), 135533#(= main_~i~0 1), 135538#(= main_~i~0 6), 135539#(= main_~i~0 7), 135536#(= main_~i~0 4), 135537#(= main_~i~0 5), 135542#(= main_~i~0 10), 135543#(= main_~i~0 11), 135540#(= main_~i~0 8), 135541#(= main_~i~0 9), 135546#(= main_~i~0 14), 135547#(= main_~i~0 15), 135544#(= main_~i~0 12), 135545#(= main_~i~0 13), 135550#(= main_~i~0 18), 135551#(= main_~i~0 19), 135548#(= main_~i~0 16), 135549#(= main_~i~0 17)] [2018-04-10 17:00:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:08,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 17:00:08,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 17:00:08,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 17:00:08,513 INFO L87 Difference]: Start difference. First operand 397 states and 466 transitions. Second operand 49 states. [2018-04-10 17:00:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:11,469 INFO L93 Difference]: Finished difference Result 7377 states and 8572 transitions. [2018-04-10 17:00:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 17:00:11,469 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 237 [2018-04-10 17:00:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:11,474 INFO L225 Difference]: With dead ends: 7377 [2018-04-10 17:00:11,475 INFO L226 Difference]: Without dead ends: 7377 [2018-04-10 17:00:11,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 17:00:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2018-04-10 17:00:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 402. [2018-04-10 17:00:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-10 17:00:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 472 transitions. [2018-04-10 17:00:11,501 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 472 transitions. Word has length 237 [2018-04-10 17:00:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:11,501 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 472 transitions. [2018-04-10 17:00:11,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 17:00:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 472 transitions. [2018-04-10 17:00:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-10 17:00:11,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:11,502 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:11,502 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1993936570, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:11,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-04-10 17:00:11,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:11,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 17:00:11,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-04-10 17:00:11,742 INFO L182 omatonBuilderFactory]: Interpolants [143362#(= 0 main_~x~0), 143427#(= main_~x~0 13), 143367#(= 1 main_~x~0), 143432#(= main_~x~0 14), 143372#(= main_~x~0 2), 143437#(= main_~x~0 15), 143442#(= main_~x~0 16), 143377#(= main_~x~0 3), 143382#(= main_~x~0 4), 143447#(= main_~x~0 17), 143387#(= main_~x~0 5), 143452#(= main_~x~0 18), 143392#(= main_~x~0 6), 143457#(= main_~x~0 19), 143462#(= main_~x~0 20), 143397#(= main_~x~0 7), 143402#(= main_~x~0 8), 143467#(= main_~x~0 21), 143407#(= main_~x~0 9), 143472#(= main_~x~0 22), 143412#(= main_~x~0 10), 143477#(= main_~x~0 23), 143482#(= main_~x~0 24), 143417#(= main_~x~0 11), 143358#true, 143422#(= main_~x~0 12), 143359#false, 143487#(and (< main_~x~0 100000) (<= 0 main_~x~0))] [2018-04-10 17:00:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-04-10 17:00:11,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 17:00:11,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 17:00:11,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-10 17:00:11,742 INFO L87 Difference]: Start difference. First operand 402 states and 472 transitions. Second operand 28 states. [2018-04-10 17:00:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:12,384 INFO L93 Difference]: Finished difference Result 408 states and 479 transitions. [2018-04-10 17:00:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 17:00:12,385 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 267 [2018-04-10 17:00:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:12,385 INFO L225 Difference]: With dead ends: 408 [2018-04-10 17:00:12,385 INFO L226 Difference]: Without dead ends: 408 [2018-04-10 17:00:12,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 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-04-10 17:00:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-10 17:00:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-04-10 17:00:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-10 17:00:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 479 transitions. [2018-04-10 17:00:12,387 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 479 transitions. Word has length 267 [2018-04-10 17:00:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:12,387 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 479 transitions. [2018-04-10 17:00:12,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 17:00:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 479 transitions. [2018-04-10 17:00:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-10 17:00:12,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:12,388 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:12,388 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 868376887, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:12,390 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:12,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:12,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-10 17:00:12,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:12,988 INFO L182 omatonBuilderFactory]: Interpolants [144304#true, 144305#false, 144310#(= main_~i~0 2), 144311#(= main_~i~0 3), 144308#(= main_~i~0 0), 144309#(= main_~i~0 1), 144314#(= main_~i~0 6), 144315#(= main_~i~0 7), 144312#(= main_~i~0 4), 144313#(= main_~i~0 5), 144318#(= main_~i~0 10), 144319#(= main_~i~0 11), 144316#(= main_~i~0 8), 144317#(= main_~i~0 9), 144322#(= main_~i~0 14), 144323#(= main_~i~0 15), 144320#(= main_~i~0 12), 144321#(= main_~i~0 13), 144326#(= main_~i~0 18), 144327#(= main_~i~0 19), 144324#(= main_~i~0 16), 144325#(= main_~i~0 17), 144330#(= main_~i~0 22), 144331#(= main_~i~0 23), 144328#(= main_~i~0 20), 144329#(= main_~i~0 21), 144334#(= main_~i~0 26), 144335#(= main_~i~0 27), 144332#(= main_~i~0 24), 144333#(= main_~i~0 25), 144338#(= main_~i~0 30), 144339#(= main_~i~0 31), 144336#(= main_~i~0 28), 144337#(= main_~i~0 29), 144342#(= main_~i~0 34), 144343#(= main_~i~0 35), 144340#(= main_~i~0 32), 144341#(= main_~i~0 33), 144346#(= main_~i~0 38), 144347#(= main_~i~0 39), 144344#(= main_~i~0 36), 144345#(= main_~i~0 37), 144350#(= main_~i~0 42), 144351#(= main_~i~0 43), 144348#(= main_~i~0 40), 144349#(= main_~i~0 41), 144354#(= main_~i~0 46), 144355#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 144352#(= main_~i~0 44), 144353#(= main_~i~0 45)] [2018-04-10 17:00:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:12,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 17:00:12,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 17:00:12,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 17:00:12,988 INFO L87 Difference]: Start difference. First operand 408 states and 479 transitions. Second operand 50 states. [2018-04-10 17:00:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:16,043 INFO L93 Difference]: Finished difference Result 7819 states and 9087 transitions. [2018-04-10 17:00:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 17:00:16,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 242 [2018-04-10 17:00:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:16,067 INFO L225 Difference]: With dead ends: 7819 [2018-04-10 17:00:16,067 INFO L226 Difference]: Without dead ends: 7819 [2018-04-10 17:00:16,067 INFO L567 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-04-10 17:00:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2018-04-10 17:00:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 413. [2018-04-10 17:00:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 17:00:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 485 transitions. [2018-04-10 17:00:16,095 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 485 transitions. Word has length 242 [2018-04-10 17:00:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:16,095 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 485 transitions. [2018-04-10 17:00:16,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 17:00:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 485 transitions. [2018-04-10 17:00:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 17:00:16,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:16,096 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:16,096 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1130548698, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:16,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:16,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:16,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 17:00:16,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:16,705 INFO L182 omatonBuilderFactory]: Interpolants [152588#true, 152589#false, 152594#(= main_~i~0 2), 152595#(= main_~i~0 3), 152592#(= main_~i~0 0), 152593#(= main_~i~0 1), 152598#(= main_~i~0 6), 152599#(= main_~i~0 7), 152596#(= main_~i~0 4), 152597#(= main_~i~0 5), 152602#(= main_~i~0 10), 152603#(= main_~i~0 11), 152600#(= main_~i~0 8), 152601#(= main_~i~0 9), 152606#(= main_~i~0 14), 152607#(= main_~i~0 15), 152604#(= main_~i~0 12), 152605#(= main_~i~0 13), 152610#(= main_~i~0 18), 152611#(= main_~i~0 19), 152608#(= main_~i~0 16), 152609#(= main_~i~0 17), 152614#(= main_~i~0 22), 152615#(= main_~i~0 23), 152612#(= main_~i~0 20), 152613#(= main_~i~0 21), 152618#(= main_~i~0 26), 152619#(= main_~i~0 27), 152616#(= main_~i~0 24), 152617#(= main_~i~0 25), 152622#(= main_~i~0 30), 152623#(= main_~i~0 31), 152620#(= main_~i~0 28), 152621#(= main_~i~0 29), 152626#(= main_~i~0 34), 152627#(= main_~i~0 35), 152624#(= main_~i~0 32), 152625#(= main_~i~0 33), 152630#(= main_~i~0 38), 152631#(= main_~i~0 39), 152628#(= main_~i~0 36), 152629#(= main_~i~0 37), 152634#(= main_~i~0 42), 152635#(= main_~i~0 43), 152632#(= main_~i~0 40), 152633#(= main_~i~0 41), 152638#(= main_~i~0 46), 152639#(= main_~i~0 47), 152636#(= main_~i~0 44), 152637#(= main_~i~0 45), 152640#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 17:00:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:16,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 17:00:16,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 17:00:16,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 17:00:16,706 INFO L87 Difference]: Start difference. First operand 413 states and 485 transitions. Second operand 51 states. [2018-04-10 17:00:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:19,828 INFO L93 Difference]: Finished difference Result 7985 states and 9280 transitions. [2018-04-10 17:00:19,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 17:00:19,829 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 247 [2018-04-10 17:00:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:19,834 INFO L225 Difference]: With dead ends: 7985 [2018-04-10 17:00:19,834 INFO L226 Difference]: Without dead ends: 7985 [2018-04-10 17:00:19,834 INFO L567 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-04-10 17:00:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2018-04-10 17:00:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 418. [2018-04-10 17:00:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-10 17:00:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 491 transitions. [2018-04-10 17:00:19,862 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 491 transitions. Word has length 247 [2018-04-10 17:00:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:19,862 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 491 transitions. [2018-04-10 17:00:19,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 17:00:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 491 transitions. [2018-04-10 17:00:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-10 17:00:19,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:19,863 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:19,864 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2106216279, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:19,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3331 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-04-10 17:00:20,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:20,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 17:00:20,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-04-10 17:00:20,143 INFO L182 omatonBuilderFactory]: Interpolants [161088#(= main_~x~0 8), 161153#(= main_~x~0 21), 161158#(= main_~x~0 22), 161093#(= main_~x~0 9), 161098#(= main_~x~0 10), 161163#(= main_~x~0 23), 161103#(= main_~x~0 11), 161168#(= main_~x~0 24), 161044#true, 161108#(= main_~x~0 12), 161045#false, 161173#(= main_~x~0 25), 161178#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 161048#(= 0 main_~x~0), 161113#(= main_~x~0 13), 161118#(= main_~x~0 14), 161053#(= 1 main_~x~0), 161058#(= main_~x~0 2), 161123#(= main_~x~0 15), 161063#(= main_~x~0 3), 161128#(= main_~x~0 16), 161068#(= main_~x~0 4), 161133#(= main_~x~0 17), 161138#(= main_~x~0 18), 161073#(= main_~x~0 5), 161078#(= main_~x~0 6), 161143#(= main_~x~0 19), 161083#(= main_~x~0 7), 161148#(= main_~x~0 20)] [2018-04-10 17:00:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3331 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-04-10 17:00:20,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 17:00:20,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 17:00:20,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-04-10 17:00:20,144 INFO L87 Difference]: Start difference. First operand 418 states and 491 transitions. Second operand 29 states. [2018-04-10 17:00:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:20,847 INFO L93 Difference]: Finished difference Result 424 states and 498 transitions. [2018-04-10 17:00:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 17:00:20,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 277 [2018-04-10 17:00:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:20,848 INFO L225 Difference]: With dead ends: 424 [2018-04-10 17:00:20,848 INFO L226 Difference]: Without dead ends: 424 [2018-04-10 17:00:20,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 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-04-10 17:00:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-10 17:00:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-04-10 17:00:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 17:00:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 498 transitions. [2018-04-10 17:00:20,850 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 498 transitions. Word has length 277 [2018-04-10 17:00:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:20,850 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 498 transitions. [2018-04-10 17:00:20,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 17:00:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 498 transitions. [2018-04-10 17:00:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-10 17:00:20,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:20,851 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:20,851 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 869965463, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:20,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:21,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:21,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 17:00:21,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:21,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-04-10 17:00:21,525 INFO L182 omatonBuilderFactory]: Interpolants [162050#(= main_~i~0 19), 162051#(= main_~i~0 20), 162048#(= main_~i~0 17), 162049#(= main_~i~0 18), 162054#(= main_~i~0 23), 162055#(= main_~i~0 24), 162052#(= main_~i~0 21), 162053#(= main_~i~0 22), 162058#(= main_~i~0 27), 162059#(= main_~i~0 28), 162056#(= main_~i~0 25), 162057#(= main_~i~0 26), 162062#(= main_~i~0 31), 162063#(= main_~i~0 32), 162060#(= main_~i~0 29), 162061#(= main_~i~0 30), 162066#(= main_~i~0 35), 162067#(= main_~i~0 36), 162064#(= main_~i~0 33), 162065#(= main_~i~0 34), 162070#(= main_~i~0 39), 162071#(= main_~i~0 40), 162068#(= main_~i~0 37), 162069#(= main_~i~0 38), 162074#(= main_~i~0 43), 162075#(= main_~i~0 44), 162072#(= main_~i~0 41), 162073#(= main_~i~0 42), 162078#(= main_~i~0 47), 162079#(= main_~i~0 48), 162076#(= main_~i~0 45), 162077#(= main_~i~0 46), 162080#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 162027#true, 162031#(= main_~i~0 0), 162028#false, 162034#(= main_~i~0 3), 162035#(= main_~i~0 4), 162032#(= main_~i~0 1), 162033#(= main_~i~0 2), 162038#(= main_~i~0 7), 162039#(= main_~i~0 8), 162036#(= main_~i~0 5), 162037#(= main_~i~0 6), 162042#(= main_~i~0 11), 162043#(= main_~i~0 12), 162040#(= main_~i~0 9), 162041#(= main_~i~0 10), 162046#(= main_~i~0 15), 162047#(= main_~i~0 16), 162044#(= main_~i~0 13), 162045#(= main_~i~0 14)] [2018-04-10 17:00:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 17:00:21,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 17:00:21,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 17:00:21,526 INFO L87 Difference]: Start difference. First operand 424 states and 498 transitions. Second operand 52 states. [2018-04-10 17:00:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:24,761 INFO L93 Difference]: Finished difference Result 8445 states and 9816 transitions. [2018-04-10 17:00:24,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 17:00:24,761 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 252 [2018-04-10 17:00:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:24,767 INFO L225 Difference]: With dead ends: 8445 [2018-04-10 17:00:24,767 INFO L226 Difference]: Without dead ends: 8445 [2018-04-10 17:00:24,767 INFO L567 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-04-10 17:00:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2018-04-10 17:00:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 429. [2018-04-10 17:00:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-10 17:00:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 504 transitions. [2018-04-10 17:00:24,798 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 504 transitions. Word has length 252 [2018-04-10 17:00:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:24,798 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 504 transitions. [2018-04-10 17:00:24,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 17:00:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 504 transitions. [2018-04-10 17:00:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-10 17:00:24,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:24,799 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:24,799 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -957067066, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:24,802 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:25,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:25,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 17:00:25,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:25,437 INFO L182 omatonBuilderFactory]: Interpolants [171008#(= main_~i~0 49), 171009#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 170955#true, 170959#(= main_~i~0 0), 170956#false, 170962#(= main_~i~0 3), 170963#(= main_~i~0 4), 170960#(= main_~i~0 1), 170961#(= main_~i~0 2), 170966#(= main_~i~0 7), 170967#(= main_~i~0 8), 170964#(= main_~i~0 5), 170965#(= main_~i~0 6), 170970#(= main_~i~0 11), 170971#(= main_~i~0 12), 170968#(= main_~i~0 9), 170969#(= main_~i~0 10), 170974#(= main_~i~0 15), 170975#(= main_~i~0 16), 170972#(= main_~i~0 13), 170973#(= main_~i~0 14), 170978#(= main_~i~0 19), 170979#(= main_~i~0 20), 170976#(= main_~i~0 17), 170977#(= main_~i~0 18), 170982#(= main_~i~0 23), 170983#(= main_~i~0 24), 170980#(= main_~i~0 21), 170981#(= main_~i~0 22), 170986#(= main_~i~0 27), 170987#(= main_~i~0 28), 170984#(= main_~i~0 25), 170985#(= main_~i~0 26), 170990#(= main_~i~0 31), 170991#(= main_~i~0 32), 170988#(= main_~i~0 29), 170989#(= main_~i~0 30), 170994#(= main_~i~0 35), 170995#(= main_~i~0 36), 170992#(= main_~i~0 33), 170993#(= main_~i~0 34), 170998#(= main_~i~0 39), 170999#(= main_~i~0 40), 170996#(= main_~i~0 37), 170997#(= main_~i~0 38), 171002#(= main_~i~0 43), 171003#(= main_~i~0 44), 171000#(= main_~i~0 41), 171001#(= main_~i~0 42), 171006#(= main_~i~0 47), 171007#(= main_~i~0 48), 171004#(= main_~i~0 45), 171005#(= main_~i~0 46)] [2018-04-10 17:00:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:25,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 17:00:25,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 17:00:25,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 17:00:25,438 INFO L87 Difference]: Start difference. First operand 429 states and 504 transitions. Second operand 53 states. [2018-04-10 17:00:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:28,891 INFO L93 Difference]: Finished difference Result 8617 states and 10016 transitions. [2018-04-10 17:00:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 17:00:28,892 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 257 [2018-04-10 17:00:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:28,898 INFO L225 Difference]: With dead ends: 8617 [2018-04-10 17:00:28,898 INFO L226 Difference]: Without dead ends: 8617 [2018-04-10 17:00:28,898 INFO L567 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-04-10 17:00:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2018-04-10 17:00:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 434. [2018-04-10 17:00:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 17:00:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 510 transitions. [2018-04-10 17:00:28,929 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 510 transitions. Word has length 257 [2018-04-10 17:00:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:28,929 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 510 transitions. [2018-04-10 17:00:28,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 17:00:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 510 transitions. [2018-04-10 17:00:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 17:00:28,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:28,930 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:28,930 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash 401420212, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:28,932 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2018-04-10 17:00:29,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:29,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 17:00:29,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-04-10 17:00:29,213 INFO L182 omatonBuilderFactory]: Interpolants [180160#(= main_~x~0 19), 180100#(= main_~x~0 7), 180165#(= main_~x~0 20), 180170#(= main_~x~0 21), 180105#(= main_~x~0 8), 180110#(= main_~x~0 9), 180175#(= main_~x~0 22), 180115#(= main_~x~0 10), 180180#(= main_~x~0 23), 180120#(= main_~x~0 11), 180185#(= main_~x~0 24), 180062#false, 180190#(= main_~x~0 25), 180061#true, 180125#(= main_~x~0 12), 180130#(= main_~x~0 13), 180195#(= main_~x~0 26), 180065#(= 0 main_~x~0), 180070#(= 1 main_~x~0), 180135#(= main_~x~0 14), 180075#(= main_~x~0 2), 180200#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 180140#(= main_~x~0 15), 180080#(= main_~x~0 3), 180145#(= main_~x~0 16), 180150#(= main_~x~0 17), 180085#(= main_~x~0 4), 180090#(= main_~x~0 5), 180155#(= main_~x~0 18), 180095#(= main_~x~0 6)] [2018-04-10 17:00:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2018-04-10 17:00:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 17:00:29,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 17:00:29,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-04-10 17:00:29,214 INFO L87 Difference]: Start difference. First operand 434 states and 510 transitions. Second operand 30 states. [2018-04-10 17:00:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:29,965 INFO L93 Difference]: Finished difference Result 440 states and 517 transitions. [2018-04-10 17:00:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 17:00:29,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 287 [2018-04-10 17:00:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:29,965 INFO L225 Difference]: With dead ends: 440 [2018-04-10 17:00:29,965 INFO L226 Difference]: Without dead ends: 440 [2018-04-10 17:00:29,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 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-04-10 17:00:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-10 17:00:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-04-10 17:00:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-10 17:00:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 517 transitions. [2018-04-10 17:00:29,967 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 517 transitions. Word has length 287 [2018-04-10 17:00:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:29,968 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 517 transitions. [2018-04-10 17:00:29,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 17:00:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 517 transitions. [2018-04-10 17:00:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-10 17:00:29,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:29,968 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:29,969 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1246602231, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:29,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:30,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:30,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-10 17:00:30,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:30,682 INFO L182 omatonBuilderFactory]: Interpolants [181122#(= main_~i~0 37), 181123#(= main_~i~0 38), 181120#(= main_~i~0 35), 181121#(= main_~i~0 36), 181126#(= main_~i~0 41), 181127#(= main_~i~0 42), 181124#(= main_~i~0 39), 181125#(= main_~i~0 40), 181130#(= main_~i~0 45), 181131#(= main_~i~0 46), 181128#(= main_~i~0 43), 181129#(= main_~i~0 44), 181134#(= main_~i~0 49), 181135#(= main_~i~0 50), 181132#(= main_~i~0 47), 181133#(= main_~i~0 48), 181136#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 181082#false, 181081#true, 181086#(= main_~i~0 1), 181087#(= main_~i~0 2), 181085#(= main_~i~0 0), 181090#(= main_~i~0 5), 181091#(= main_~i~0 6), 181088#(= main_~i~0 3), 181089#(= main_~i~0 4), 181094#(= main_~i~0 9), 181095#(= main_~i~0 10), 181092#(= main_~i~0 7), 181093#(= main_~i~0 8), 181098#(= main_~i~0 13), 181099#(= main_~i~0 14), 181096#(= main_~i~0 11), 181097#(= main_~i~0 12), 181102#(= main_~i~0 17), 181103#(= main_~i~0 18), 181100#(= main_~i~0 15), 181101#(= main_~i~0 16), 181106#(= main_~i~0 21), 181107#(= main_~i~0 22), 181104#(= main_~i~0 19), 181105#(= main_~i~0 20), 181110#(= main_~i~0 25), 181111#(= main_~i~0 26), 181108#(= main_~i~0 23), 181109#(= main_~i~0 24), 181114#(= main_~i~0 29), 181115#(= main_~i~0 30), 181112#(= main_~i~0 27), 181113#(= main_~i~0 28), 181118#(= main_~i~0 33), 181119#(= main_~i~0 34), 181116#(= main_~i~0 31), 181117#(= main_~i~0 32)] [2018-04-10 17:00:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:30,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 17:00:30,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 17:00:30,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 17:00:30,683 INFO L87 Difference]: Start difference. First operand 440 states and 517 transitions. Second operand 54 states. [2018-04-10 17:00:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:34,235 INFO L93 Difference]: Finished difference Result 9095 states and 10573 transitions. [2018-04-10 17:00:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 17:00:34,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 262 [2018-04-10 17:00:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:34,242 INFO L225 Difference]: With dead ends: 9095 [2018-04-10 17:00:34,242 INFO L226 Difference]: Without dead ends: 9095 [2018-04-10 17:00:34,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 17:00:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2018-04-10 17:00:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 445. [2018-04-10 17:00:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-10 17:00:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 523 transitions. [2018-04-10 17:00:34,276 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 523 transitions. Word has length 262 [2018-04-10 17:00:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:34,276 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 523 transitions. [2018-04-10 17:00:34,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 17:00:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 523 transitions. [2018-04-10 17:00:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-10 17:00:34,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:34,277 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:34,277 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -328358042, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:34,281 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:34,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:34,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-10 17:00:34,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:34,974 INFO L182 omatonBuilderFactory]: Interpolants [190722#(= main_~i~0 41), 190723#(= main_~i~0 42), 190720#(= main_~i~0 39), 190721#(= main_~i~0 40), 190726#(= main_~i~0 45), 190727#(= main_~i~0 46), 190724#(= main_~i~0 43), 190725#(= main_~i~0 44), 190730#(= main_~i~0 49), 190731#(= main_~i~0 50), 190728#(= main_~i~0 47), 190729#(= main_~i~0 48), 190732#(= main_~i~0 51), 190733#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 190678#false, 190677#true, 190682#(= main_~i~0 1), 190683#(= main_~i~0 2), 190681#(= main_~i~0 0), 190686#(= main_~i~0 5), 190687#(= main_~i~0 6), 190684#(= main_~i~0 3), 190685#(= main_~i~0 4), 190690#(= main_~i~0 9), 190691#(= main_~i~0 10), 190688#(= main_~i~0 7), 190689#(= main_~i~0 8), 190694#(= main_~i~0 13), 190695#(= main_~i~0 14), 190692#(= main_~i~0 11), 190693#(= main_~i~0 12), 190698#(= main_~i~0 17), 190699#(= main_~i~0 18), 190696#(= main_~i~0 15), 190697#(= main_~i~0 16), 190702#(= main_~i~0 21), 190703#(= main_~i~0 22), 190700#(= main_~i~0 19), 190701#(= main_~i~0 20), 190706#(= main_~i~0 25), 190707#(= main_~i~0 26), 190704#(= main_~i~0 23), 190705#(= main_~i~0 24), 190710#(= main_~i~0 29), 190711#(= main_~i~0 30), 190708#(= main_~i~0 27), 190709#(= main_~i~0 28), 190714#(= main_~i~0 33), 190715#(= main_~i~0 34), 190712#(= main_~i~0 31), 190713#(= main_~i~0 32), 190718#(= main_~i~0 37), 190719#(= main_~i~0 38), 190716#(= main_~i~0 35), 190717#(= main_~i~0 36)] [2018-04-10 17:00:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:34,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 17:00:34,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 17:00:34,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 17:00:34,975 INFO L87 Difference]: Start difference. First operand 445 states and 523 transitions. Second operand 55 states. [2018-04-10 17:00:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:38,668 INFO L93 Difference]: Finished difference Result 9273 states and 10780 transitions. [2018-04-10 17:00:38,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 17:00:38,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 267 [2018-04-10 17:00:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:38,675 INFO L225 Difference]: With dead ends: 9273 [2018-04-10 17:00:38,675 INFO L226 Difference]: Without dead ends: 9273 [2018-04-10 17:00:38,675 INFO L567 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-04-10 17:00:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-04-10 17:00:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 450. [2018-04-10 17:00:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-10 17:00:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 529 transitions. [2018-04-10 17:00:38,709 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 529 transitions. Word has length 267 [2018-04-10 17:00:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:38,709 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 529 transitions. [2018-04-10 17:00:38,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 17:00:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 529 transitions. [2018-04-10 17:00:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 17:00:38,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:38,710 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:38,710 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash -749928495, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:38,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2018-04-10 17:00:39,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:39,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 17:00:39,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-04-10 17:00:39,009 INFO L182 omatonBuilderFactory]: Interpolants [200576#(= main_~x~0 23), 200581#(= main_~x~0 24), 200516#(= main_~x~0 11), 200458#false, 200586#(= main_~x~0 25), 200457#true, 200521#(= main_~x~0 12), 200591#(= main_~x~0 26), 200526#(= main_~x~0 13), 200461#(= 0 main_~x~0), 200531#(= main_~x~0 14), 200466#(= 1 main_~x~0), 200471#(= main_~x~0 2), 200596#(= main_~x~0 27), 200601#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 200536#(= main_~x~0 15), 200541#(= main_~x~0 16), 200476#(= main_~x~0 3), 200546#(= main_~x~0 17), 200481#(= main_~x~0 4), 200551#(= main_~x~0 18), 200486#(= main_~x~0 5), 200491#(= main_~x~0 6), 200556#(= main_~x~0 19), 200561#(= main_~x~0 20), 200496#(= main_~x~0 7), 200566#(= main_~x~0 21), 200501#(= main_~x~0 8), 200571#(= main_~x~0 22), 200506#(= main_~x~0 9), 200511#(= main_~x~0 10)] [2018-04-10 17:00:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2018-04-10 17:00:39,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 17:00:39,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 17:00:39,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-10 17:00:39,010 INFO L87 Difference]: Start difference. First operand 450 states and 529 transitions. Second operand 31 states. [2018-04-10 17:00:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:39,824 INFO L93 Difference]: Finished difference Result 456 states and 536 transitions. [2018-04-10 17:00:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 17:00:39,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 297 [2018-04-10 17:00:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:39,824 INFO L225 Difference]: With dead ends: 456 [2018-04-10 17:00:39,824 INFO L226 Difference]: Without dead ends: 456 [2018-04-10 17:00:39,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 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-04-10 17:00:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-10 17:00:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2018-04-10 17:00:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-04-10 17:00:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 536 transitions. [2018-04-10 17:00:39,827 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 536 transitions. Word has length 297 [2018-04-10 17:00:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:39,827 INFO L459 AbstractCegarLoop]: Abstraction has 456 states and 536 transitions. [2018-04-10 17:00:39,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 17:00:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 536 transitions. [2018-04-10 17:00:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 17:00:39,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:39,829 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:39,829 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2051109207, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:39,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:40,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:40,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-10 17:00:40,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:40,549 INFO L182 omatonBuilderFactory]: Interpolants [201515#false, 201514#true, 201519#(= main_~i~0 1), 201518#(= main_~i~0 0), 201523#(= main_~i~0 5), 201522#(= main_~i~0 4), 201521#(= main_~i~0 3), 201520#(= main_~i~0 2), 201527#(= main_~i~0 9), 201526#(= main_~i~0 8), 201525#(= main_~i~0 7), 201524#(= main_~i~0 6), 201531#(= main_~i~0 13), 201530#(= main_~i~0 12), 201529#(= main_~i~0 11), 201528#(= main_~i~0 10), 201535#(= main_~i~0 17), 201534#(= main_~i~0 16), 201533#(= main_~i~0 15), 201532#(= main_~i~0 14), 201539#(= main_~i~0 21), 201538#(= main_~i~0 20), 201537#(= main_~i~0 19), 201536#(= main_~i~0 18), 201543#(= main_~i~0 25), 201542#(= main_~i~0 24), 201541#(= main_~i~0 23), 201540#(= main_~i~0 22), 201547#(= main_~i~0 29), 201546#(= main_~i~0 28), 201545#(= main_~i~0 27), 201544#(= main_~i~0 26), 201551#(= main_~i~0 33), 201550#(= main_~i~0 32), 201549#(= main_~i~0 31), 201548#(= main_~i~0 30), 201555#(= main_~i~0 37), 201554#(= main_~i~0 36), 201553#(= main_~i~0 35), 201552#(= main_~i~0 34), 201559#(= main_~i~0 41), 201558#(= main_~i~0 40), 201557#(= main_~i~0 39), 201556#(= main_~i~0 38), 201563#(= main_~i~0 45), 201562#(= main_~i~0 44), 201561#(= main_~i~0 43), 201560#(= main_~i~0 42), 201567#(= main_~i~0 49), 201566#(= main_~i~0 48), 201565#(= main_~i~0 47), 201564#(= main_~i~0 46), 201571#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 201570#(= main_~i~0 52), 201569#(= main_~i~0 51), 201568#(= main_~i~0 50)] [2018-04-10 17:00:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:40,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 17:00:40,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 17:00:40,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 17:00:40,550 INFO L87 Difference]: Start difference. First operand 456 states and 536 transitions. Second operand 56 states. [2018-04-10 17:00:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:44,375 INFO L93 Difference]: Finished difference Result 9769 states and 11358 transitions. [2018-04-10 17:00:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 17:00:44,375 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 272 [2018-04-10 17:00:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:44,383 INFO L225 Difference]: With dead ends: 9769 [2018-04-10 17:00:44,383 INFO L226 Difference]: Without dead ends: 9769 [2018-04-10 17:00:44,384 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 17:00:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2018-04-10 17:00:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 461. [2018-04-10 17:00:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-10 17:00:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 542 transitions. [2018-04-10 17:00:44,422 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 542 transitions. Word has length 272 [2018-04-10 17:00:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:44,422 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 542 transitions. [2018-04-10 17:00:44,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 17:00:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 542 transitions. [2018-04-10 17:00:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-10 17:00:44,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:44,423 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:44,423 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash 832779782, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:44,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:45,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:45,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-10 17:00:45,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:45,208 INFO L182 omatonBuilderFactory]: Interpolants [211843#(= main_~i~0 37), 211842#(= main_~i~0 36), 211841#(= main_~i~0 35), 211840#(= main_~i~0 34), 211847#(= main_~i~0 41), 211846#(= main_~i~0 40), 211845#(= main_~i~0 39), 211844#(= main_~i~0 38), 211851#(= main_~i~0 45), 211850#(= main_~i~0 44), 211849#(= main_~i~0 43), 211848#(= main_~i~0 42), 211855#(= main_~i~0 49), 211854#(= main_~i~0 48), 211853#(= main_~i~0 47), 211852#(= main_~i~0 46), 211859#(= main_~i~0 53), 211858#(= main_~i~0 52), 211857#(= main_~i~0 51), 211856#(= main_~i~0 50), 211860#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 211803#false, 211802#true, 211807#(= main_~i~0 1), 211806#(= main_~i~0 0), 211811#(= main_~i~0 5), 211810#(= main_~i~0 4), 211809#(= main_~i~0 3), 211808#(= main_~i~0 2), 211815#(= main_~i~0 9), 211814#(= main_~i~0 8), 211813#(= main_~i~0 7), 211812#(= main_~i~0 6), 211819#(= main_~i~0 13), 211818#(= main_~i~0 12), 211817#(= main_~i~0 11), 211816#(= main_~i~0 10), 211823#(= main_~i~0 17), 211822#(= main_~i~0 16), 211821#(= main_~i~0 15), 211820#(= main_~i~0 14), 211827#(= main_~i~0 21), 211826#(= main_~i~0 20), 211825#(= main_~i~0 19), 211824#(= main_~i~0 18), 211831#(= main_~i~0 25), 211830#(= main_~i~0 24), 211829#(= main_~i~0 23), 211828#(= main_~i~0 22), 211835#(= main_~i~0 29), 211834#(= main_~i~0 28), 211833#(= main_~i~0 27), 211832#(= main_~i~0 26), 211839#(= main_~i~0 33), 211838#(= main_~i~0 32), 211837#(= main_~i~0 31), 211836#(= main_~i~0 30)] [2018-04-10 17:00:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:45,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 17:00:45,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 17:00:45,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 17:00:45,209 INFO L87 Difference]: Start difference. First operand 461 states and 542 transitions. Second operand 57 states. [2018-04-10 17:00:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:49,173 INFO L93 Difference]: Finished difference Result 9953 states and 11572 transitions. [2018-04-10 17:00:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 17:00:49,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 277 [2018-04-10 17:00:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:49,217 INFO L225 Difference]: With dead ends: 9953 [2018-04-10 17:00:49,217 INFO L226 Difference]: Without dead ends: 9953 [2018-04-10 17:00:49,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 17:00:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2018-04-10 17:00:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 466. [2018-04-10 17:00:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-10 17:00:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 548 transitions. [2018-04-10 17:00:49,262 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 548 transitions. Word has length 277 [2018-04-10 17:00:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:49,262 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 548 transitions. [2018-04-10 17:00:49,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 17:00:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 548 transitions. [2018-04-10 17:00:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-10 17:00:49,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:49,264 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:49,264 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -753856594, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:49,267 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2018-04-10 17:00:49,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:49,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 17:00:49,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-04-10 17:00:49,569 INFO L182 omatonBuilderFactory]: Interpolants [222339#(= main_~x~0 11), 222404#(= main_~x~0 24), 222281#false, 222409#(= main_~x~0 25), 222280#true, 222344#(= main_~x~0 12), 222414#(= main_~x~0 26), 222349#(= main_~x~0 13), 222284#(= 0 main_~x~0), 222419#(= main_~x~0 27), 222354#(= main_~x~0 14), 222289#(= 1 main_~x~0), 222359#(= main_~x~0 15), 222294#(= main_~x~0 2), 222299#(= main_~x~0 3), 222424#(= main_~x~0 28), 222429#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 222364#(= main_~x~0 16), 222369#(= main_~x~0 17), 222304#(= main_~x~0 4), 222374#(= main_~x~0 18), 222309#(= main_~x~0 5), 222379#(= main_~x~0 19), 222314#(= main_~x~0 6), 222319#(= main_~x~0 7), 222384#(= main_~x~0 20), 222389#(= main_~x~0 21), 222324#(= main_~x~0 8), 222394#(= main_~x~0 22), 222329#(= main_~x~0 9), 222399#(= main_~x~0 23), 222334#(= main_~x~0 10)] [2018-04-10 17:00:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2018-04-10 17:00:49,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 17:00:49,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 17:00:49,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-10 17:00:49,570 INFO L87 Difference]: Start difference. First operand 466 states and 548 transitions. Second operand 32 states. [2018-04-10 17:00:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:50,398 INFO L93 Difference]: Finished difference Result 472 states and 555 transitions. [2018-04-10 17:00:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 17:00:50,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 307 [2018-04-10 17:00:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:50,399 INFO L225 Difference]: With dead ends: 472 [2018-04-10 17:00:50,399 INFO L226 Difference]: Without dead ends: 472 [2018-04-10 17:00:50,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-10 17:00:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-04-10 17:00:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2018-04-10 17:00:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-10 17:00:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 555 transitions. [2018-04-10 17:00:50,401 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 555 transitions. Word has length 307 [2018-04-10 17:00:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:50,401 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 555 transitions. [2018-04-10 17:00:50,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 17:00:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 555 transitions. [2018-04-10 17:00:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-10 17:00:50,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:50,402 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:50,402 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1889794377, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:50,404 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:51,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:51,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-10 17:00:51,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:51,190 INFO L182 omatonBuilderFactory]: Interpolants [223375#false, 223374#true, 223379#(= main_~i~0 1), 223378#(= main_~i~0 0), 223383#(= main_~i~0 5), 223382#(= main_~i~0 4), 223381#(= main_~i~0 3), 223380#(= main_~i~0 2), 223387#(= main_~i~0 9), 223386#(= main_~i~0 8), 223385#(= main_~i~0 7), 223384#(= main_~i~0 6), 223391#(= main_~i~0 13), 223390#(= main_~i~0 12), 223389#(= main_~i~0 11), 223388#(= main_~i~0 10), 223395#(= main_~i~0 17), 223394#(= main_~i~0 16), 223393#(= main_~i~0 15), 223392#(= main_~i~0 14), 223399#(= main_~i~0 21), 223398#(= main_~i~0 20), 223397#(= main_~i~0 19), 223396#(= main_~i~0 18), 223403#(= main_~i~0 25), 223402#(= main_~i~0 24), 223401#(= main_~i~0 23), 223400#(= main_~i~0 22), 223407#(= main_~i~0 29), 223406#(= main_~i~0 28), 223405#(= main_~i~0 27), 223404#(= main_~i~0 26), 223411#(= main_~i~0 33), 223410#(= main_~i~0 32), 223409#(= main_~i~0 31), 223408#(= main_~i~0 30), 223415#(= main_~i~0 37), 223414#(= main_~i~0 36), 223413#(= main_~i~0 35), 223412#(= main_~i~0 34), 223419#(= main_~i~0 41), 223418#(= main_~i~0 40), 223417#(= main_~i~0 39), 223416#(= main_~i~0 38), 223423#(= main_~i~0 45), 223422#(= main_~i~0 44), 223421#(= main_~i~0 43), 223420#(= main_~i~0 42), 223427#(= main_~i~0 49), 223426#(= main_~i~0 48), 223425#(= main_~i~0 47), 223424#(= main_~i~0 46), 223431#(= main_~i~0 53), 223430#(= main_~i~0 52), 223429#(= main_~i~0 51), 223428#(= main_~i~0 50), 223433#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 223432#(= main_~i~0 54)] [2018-04-10 17:00:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 17:00:51,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 17:00:51,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 17:00:51,191 INFO L87 Difference]: Start difference. First operand 472 states and 555 transitions. Second operand 58 states. [2018-04-10 17:00:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:55,337 INFO L93 Difference]: Finished difference Result 10467 states and 12171 transitions. [2018-04-10 17:00:55,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 17:00:55,337 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 282 [2018-04-10 17:00:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:55,346 INFO L225 Difference]: With dead ends: 10467 [2018-04-10 17:00:55,346 INFO L226 Difference]: Without dead ends: 10467 [2018-04-10 17:00:55,346 INFO L567 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-04-10 17:00:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10467 states. [2018-04-10 17:00:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10467 to 477. [2018-04-10 17:00:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-04-10 17:00:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 561 transitions. [2018-04-10 17:00:55,399 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 561 transitions. Word has length 282 [2018-04-10 17:00:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:55,399 INFO L459 AbstractCegarLoop]: Abstraction has 477 states and 561 transitions. [2018-04-10 17:00:55,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 17:00:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 561 transitions. [2018-04-10 17:00:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-10 17:00:55,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:55,400 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:55,400 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash -574836917, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:55,403 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2018-04-10 17:00:55,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:55,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 17:00:55,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-04-10 17:00:55,716 INFO L182 omatonBuilderFactory]: Interpolants [234497#(= main_~x~0 23), 234432#(= main_~x~0 10), 234502#(= main_~x~0 24), 234437#(= main_~x~0 11), 234379#false, 234507#(= main_~x~0 25), 234378#true, 234442#(= main_~x~0 12), 234447#(= main_~x~0 13), 234382#(= 0 main_~x~0), 234387#(= 1 main_~x~0), 234512#(= main_~x~0 26), 234517#(= main_~x~0 27), 234452#(= main_~x~0 14), 234522#(= main_~x~0 28), 234457#(= main_~x~0 15), 234392#(= main_~x~0 2), 234527#(= main_~x~0 29), 234462#(= main_~x~0 16), 234397#(= main_~x~0 3), 234467#(= main_~x~0 17), 234402#(= main_~x~0 4), 234407#(= main_~x~0 5), 234532#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 234472#(= main_~x~0 18), 234477#(= main_~x~0 19), 234412#(= main_~x~0 6), 234482#(= main_~x~0 20), 234417#(= main_~x~0 7), 234487#(= main_~x~0 21), 234422#(= main_~x~0 8), 234427#(= main_~x~0 9), 234492#(= main_~x~0 22)] [2018-04-10 17:00:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2018-04-10 17:00:55,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 17:00:55,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 17:00:55,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 17:00:55,717 INFO L87 Difference]: Start difference. First operand 477 states and 561 transitions. Second operand 33 states. [2018-04-10 17:00:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:00:56,633 INFO L93 Difference]: Finished difference Result 483 states and 568 transitions. [2018-04-10 17:00:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 17:00:56,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 317 [2018-04-10 17:00:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:00:56,634 INFO L225 Difference]: With dead ends: 483 [2018-04-10 17:00:56,634 INFO L226 Difference]: Without dead ends: 483 [2018-04-10 17:00:56,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 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-04-10 17:00:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-10 17:00:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-04-10 17:00:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-04-10 17:00:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 568 transitions. [2018-04-10 17:00:56,637 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 568 transitions. Word has length 317 [2018-04-10 17:00:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:00:56,638 INFO L459 AbstractCegarLoop]: Abstraction has 483 states and 568 transitions. [2018-04-10 17:00:56,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 17:00:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 568 transitions. [2018-04-10 17:00:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 17:00:56,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:00:56,639 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-10 17:00:56,640 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:00:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 581893286, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:00:56,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:00:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:00:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:57,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:00:57,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-10 17:00:57,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:00:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:57,605 INFO L182 omatonBuilderFactory]: Interpolants [235523#(= main_~i~0 20), 235522#(= main_~i~0 19), 235521#(= main_~i~0 18), 235520#(= main_~i~0 17), 235527#(= main_~i~0 24), 235526#(= main_~i~0 23), 235525#(= main_~i~0 22), 235524#(= main_~i~0 21), 235531#(= main_~i~0 28), 235530#(= main_~i~0 27), 235529#(= main_~i~0 26), 235528#(= main_~i~0 25), 235535#(= main_~i~0 32), 235534#(= main_~i~0 31), 235533#(= main_~i~0 30), 235532#(= main_~i~0 29), 235539#(= main_~i~0 36), 235538#(= main_~i~0 35), 235537#(= main_~i~0 34), 235536#(= main_~i~0 33), 235543#(= main_~i~0 40), 235542#(= main_~i~0 39), 235541#(= main_~i~0 38), 235540#(= main_~i~0 37), 235547#(= main_~i~0 44), 235546#(= main_~i~0 43), 235545#(= main_~i~0 42), 235544#(= main_~i~0 41), 235551#(= main_~i~0 48), 235550#(= main_~i~0 47), 235549#(= main_~i~0 46), 235548#(= main_~i~0 45), 235555#(= main_~i~0 52), 235554#(= main_~i~0 51), 235553#(= main_~i~0 50), 235552#(= main_~i~0 49), 235559#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 235558#(= main_~i~0 55), 235557#(= main_~i~0 54), 235556#(= main_~i~0 53), 235499#true, 235503#(= main_~i~0 0), 235500#false, 235507#(= main_~i~0 4), 235506#(= main_~i~0 3), 235505#(= main_~i~0 2), 235504#(= main_~i~0 1), 235511#(= main_~i~0 8), 235510#(= main_~i~0 7), 235509#(= main_~i~0 6), 235508#(= main_~i~0 5), 235515#(= main_~i~0 12), 235514#(= main_~i~0 11), 235513#(= main_~i~0 10), 235512#(= main_~i~0 9), 235519#(= main_~i~0 16), 235518#(= main_~i~0 15), 235517#(= main_~i~0 14), 235516#(= main_~i~0 13)] [2018-04-10 17:00:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:00:57,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 17:00:57,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 17:00:57,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 17:00:57,606 INFO L87 Difference]: Start difference. First operand 483 states and 568 transitions. Second operand 59 states. [2018-04-10 17:01:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:02,221 INFO L93 Difference]: Finished difference Result 10993 states and 12784 transitions. [2018-04-10 17:01:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 17:01:02,221 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 287 [2018-04-10 17:01:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:02,230 INFO L225 Difference]: With dead ends: 10993 [2018-04-10 17:01:02,230 INFO L226 Difference]: Without dead ends: 10993 [2018-04-10 17:01:02,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 17:01:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10993 states. [2018-04-10 17:01:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10993 to 488. [2018-04-10 17:01:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-04-10 17:01:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 574 transitions. [2018-04-10 17:01:02,271 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 574 transitions. Word has length 287 [2018-04-10 17:01:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:02,271 INFO L459 AbstractCegarLoop]: Abstraction has 488 states and 574 transitions. [2018-04-10 17:01:02,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 17:01:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 574 transitions. [2018-04-10 17:01:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 17:01:02,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:02,272 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:02,272 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2109957143, now seen corresponding path program 57 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:02,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:03,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:03,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-10 17:01:03,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:03,125 INFO L182 omatonBuilderFactory]: Interpolants [247042#false, 247041#true, 247047#(= main_~i~0 2), 247046#(= main_~i~0 1), 247045#(= main_~i~0 0), 247051#(= main_~i~0 6), 247050#(= main_~i~0 5), 247049#(= main_~i~0 4), 247048#(= main_~i~0 3), 247055#(= main_~i~0 10), 247054#(= main_~i~0 9), 247053#(= main_~i~0 8), 247052#(= main_~i~0 7), 247059#(= main_~i~0 14), 247058#(= main_~i~0 13), 247057#(= main_~i~0 12), 247056#(= main_~i~0 11), 247063#(= main_~i~0 18), 247062#(= main_~i~0 17), 247061#(= main_~i~0 16), 247060#(= main_~i~0 15), 247067#(= main_~i~0 22), 247066#(= main_~i~0 21), 247065#(= main_~i~0 20), 247064#(= main_~i~0 19), 247071#(= main_~i~0 26), 247070#(= main_~i~0 25), 247069#(= main_~i~0 24), 247068#(= main_~i~0 23), 247075#(= main_~i~0 30), 247074#(= main_~i~0 29), 247073#(= main_~i~0 28), 247072#(= main_~i~0 27), 247079#(= main_~i~0 34), 247078#(= main_~i~0 33), 247077#(= main_~i~0 32), 247076#(= main_~i~0 31), 247083#(= main_~i~0 38), 247082#(= main_~i~0 37), 247081#(= main_~i~0 36), 247080#(= main_~i~0 35), 247087#(= main_~i~0 42), 247086#(= main_~i~0 41), 247085#(= main_~i~0 40), 247084#(= main_~i~0 39), 247091#(= main_~i~0 46), 247090#(= main_~i~0 45), 247089#(= main_~i~0 44), 247088#(= main_~i~0 43), 247095#(= main_~i~0 50), 247094#(= main_~i~0 49), 247093#(= main_~i~0 48), 247092#(= main_~i~0 47), 247099#(= main_~i~0 54), 247098#(= main_~i~0 53), 247097#(= main_~i~0 52), 247096#(= main_~i~0 51), 247102#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 247101#(= main_~i~0 56), 247100#(= main_~i~0 55)] [2018-04-10 17:01:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:03,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 17:01:03,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 17:01:03,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 17:01:03,126 INFO L87 Difference]: Start difference. First operand 488 states and 574 transitions. Second operand 60 states. [2018-04-10 17:01:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:07,501 INFO L93 Difference]: Finished difference Result 11189 states and 13012 transitions. [2018-04-10 17:01:07,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 17:01:07,501 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-04-10 17:01:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:07,511 INFO L225 Difference]: With dead ends: 11189 [2018-04-10 17:01:07,511 INFO L226 Difference]: Without dead ends: 11189 [2018-04-10 17:01:07,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 17:01:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2018-04-10 17:01:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 493. [2018-04-10 17:01:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-10 17:01:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 580 transitions. [2018-04-10 17:01:07,554 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 580 transitions. Word has length 292 [2018-04-10 17:01:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:07,554 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 580 transitions. [2018-04-10 17:01:07,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 17:01:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 580 transitions. [2018-04-10 17:01:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-10 17:01:07,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:07,555 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:07,555 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash 703540904, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:07,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2018-04-10 17:01:07,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:07,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 17:01:07,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-04-10 17:01:07,909 INFO L182 omatonBuilderFactory]: Interpolants [258819#(= main_~x~0 6), 258944#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 258884#(= main_~x~0 19), 258889#(= main_~x~0 20), 258824#(= main_~x~0 7), 258894#(= main_~x~0 21), 258829#(= main_~x~0 8), 258899#(= main_~x~0 22), 258834#(= main_~x~0 9), 258839#(= main_~x~0 10), 258904#(= main_~x~0 23), 258909#(= main_~x~0 24), 258844#(= main_~x~0 11), 258786#false, 258914#(= main_~x~0 25), 258785#true, 258849#(= main_~x~0 12), 258919#(= main_~x~0 26), 258854#(= main_~x~0 13), 258789#(= 0 main_~x~0), 258859#(= main_~x~0 14), 258794#(= 1 main_~x~0), 258799#(= main_~x~0 2), 258924#(= main_~x~0 27), 258929#(= main_~x~0 28), 258864#(= main_~x~0 15), 258934#(= main_~x~0 29), 258869#(= main_~x~0 16), 258804#(= main_~x~0 3), 258939#(= main_~x~0 30), 258874#(= main_~x~0 17), 258809#(= main_~x~0 4), 258879#(= main_~x~0 18), 258814#(= main_~x~0 5)] [2018-04-10 17:01:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2018-04-10 17:01:07,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 17:01:07,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 17:01:07,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 17:01:07,910 INFO L87 Difference]: Start difference. First operand 493 states and 580 transitions. Second operand 34 states. [2018-04-10 17:01:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:08,878 INFO L93 Difference]: Finished difference Result 499 states and 587 transitions. [2018-04-10 17:01:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 17:01:08,879 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 327 [2018-04-10 17:01:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:08,879 INFO L225 Difference]: With dead ends: 499 [2018-04-10 17:01:08,879 INFO L226 Difference]: Without dead ends: 499 [2018-04-10 17:01:08,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 17:01:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-10 17:01:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-04-10 17:01:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-04-10 17:01:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 587 transitions. [2018-04-10 17:01:08,881 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 587 transitions. Word has length 327 [2018-04-10 17:01:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:08,882 INFO L459 AbstractCegarLoop]: Abstraction has 499 states and 587 transitions. [2018-04-10 17:01:08,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 17:01:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 587 transitions. [2018-04-10 17:01:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 17:01:08,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:08,883 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:08,883 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1932196678, now seen corresponding path program 58 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:08,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:09,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:09,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-10 17:01:09,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:09,762 INFO L182 omatonBuilderFactory]: Interpolants [259971#(= main_~i~0 24), 259970#(= main_~i~0 23), 259969#(= main_~i~0 22), 259968#(= main_~i~0 21), 259975#(= main_~i~0 28), 259974#(= main_~i~0 27), 259973#(= main_~i~0 26), 259972#(= main_~i~0 25), 259979#(= main_~i~0 32), 259978#(= main_~i~0 31), 259977#(= main_~i~0 30), 259976#(= main_~i~0 29), 259983#(= main_~i~0 36), 259982#(= main_~i~0 35), 259981#(= main_~i~0 34), 259980#(= main_~i~0 33), 259987#(= main_~i~0 40), 259986#(= main_~i~0 39), 259985#(= main_~i~0 38), 259984#(= main_~i~0 37), 259991#(= main_~i~0 44), 259990#(= main_~i~0 43), 259989#(= main_~i~0 42), 259988#(= main_~i~0 41), 259995#(= main_~i~0 48), 259994#(= main_~i~0 47), 259993#(= main_~i~0 46), 259992#(= main_~i~0 45), 259999#(= main_~i~0 52), 259998#(= main_~i~0 51), 259997#(= main_~i~0 50), 259996#(= main_~i~0 49), 260003#(= main_~i~0 56), 260002#(= main_~i~0 55), 260001#(= main_~i~0 54), 260000#(= main_~i~0 53), 260005#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 260004#(= main_~i~0 57), 259943#true, 259947#(= main_~i~0 0), 259944#false, 259951#(= main_~i~0 4), 259950#(= main_~i~0 3), 259949#(= main_~i~0 2), 259948#(= main_~i~0 1), 259955#(= main_~i~0 8), 259954#(= main_~i~0 7), 259953#(= main_~i~0 6), 259952#(= main_~i~0 5), 259959#(= main_~i~0 12), 259958#(= main_~i~0 11), 259957#(= main_~i~0 10), 259956#(= main_~i~0 9), 259963#(= main_~i~0 16), 259962#(= main_~i~0 15), 259961#(= main_~i~0 14), 259960#(= main_~i~0 13), 259967#(= main_~i~0 20), 259966#(= main_~i~0 19), 259965#(= main_~i~0 18), 259964#(= main_~i~0 17)] [2018-04-10 17:01:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:09,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 17:01:09,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 17:01:09,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 17:01:09,763 INFO L87 Difference]: Start difference. First operand 499 states and 587 transitions. Second operand 61 states. [2018-04-10 17:01:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:14,407 INFO L93 Difference]: Finished difference Result 11733 states and 13646 transitions. [2018-04-10 17:01:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 17:01:14,407 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 297 [2018-04-10 17:01:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:14,416 INFO L225 Difference]: With dead ends: 11733 [2018-04-10 17:01:14,416 INFO L226 Difference]: Without dead ends: 11733 [2018-04-10 17:01:14,416 INFO L567 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-04-10 17:01:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11733 states. [2018-04-10 17:01:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 504. [2018-04-10 17:01:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-04-10 17:01:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 593 transitions. [2018-04-10 17:01:14,460 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 593 transitions. Word has length 297 [2018-04-10 17:01:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:14,460 INFO L459 AbstractCegarLoop]: Abstraction has 504 states and 593 transitions. [2018-04-10 17:01:14,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 17:01:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 593 transitions. [2018-04-10 17:01:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-10 17:01:14,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:14,461 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:14,461 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1038251657, now seen corresponding path program 59 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:14,465 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:15,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:15,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-10 17:01:15,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:15,353 INFO L182 omatonBuilderFactory]: Interpolants [272260#(= main_~i~0 13), 272261#(= main_~i~0 14), 272262#(= main_~i~0 15), 272263#(= main_~i~0 16), 272256#(= main_~i~0 9), 272257#(= main_~i~0 10), 272258#(= main_~i~0 11), 272259#(= main_~i~0 12), 272268#(= main_~i~0 21), 272269#(= main_~i~0 22), 272270#(= main_~i~0 23), 272271#(= main_~i~0 24), 272264#(= main_~i~0 17), 272265#(= main_~i~0 18), 272266#(= main_~i~0 19), 272267#(= main_~i~0 20), 272276#(= main_~i~0 29), 272277#(= main_~i~0 30), 272278#(= main_~i~0 31), 272279#(= main_~i~0 32), 272272#(= main_~i~0 25), 272273#(= main_~i~0 26), 272274#(= main_~i~0 27), 272275#(= main_~i~0 28), 272284#(= main_~i~0 37), 272285#(= main_~i~0 38), 272286#(= main_~i~0 39), 272287#(= main_~i~0 40), 272280#(= main_~i~0 33), 272281#(= main_~i~0 34), 272282#(= main_~i~0 35), 272283#(= main_~i~0 36), 272292#(= main_~i~0 45), 272293#(= main_~i~0 46), 272294#(= main_~i~0 47), 272295#(= main_~i~0 48), 272288#(= main_~i~0 41), 272289#(= main_~i~0 42), 272290#(= main_~i~0 43), 272291#(= main_~i~0 44), 272300#(= main_~i~0 53), 272301#(= main_~i~0 54), 272302#(= main_~i~0 55), 272303#(= main_~i~0 56), 272296#(= main_~i~0 49), 272297#(= main_~i~0 50), 272298#(= main_~i~0 51), 272299#(= main_~i~0 52), 272304#(= main_~i~0 57), 272305#(= main_~i~0 58), 272306#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 272244#false, 272247#(= main_~i~0 0), 272243#true, 272252#(= main_~i~0 5), 272253#(= main_~i~0 6), 272254#(= main_~i~0 7), 272255#(= main_~i~0 8), 272248#(= main_~i~0 1), 272249#(= main_~i~0 2), 272250#(= main_~i~0 3), 272251#(= main_~i~0 4)] [2018-04-10 17:01:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:15,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 17:01:15,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 17:01:15,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 17:01:15,354 INFO L87 Difference]: Start difference. First operand 504 states and 593 transitions. Second operand 62 states. [2018-04-10 17:01:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:20,132 INFO L93 Difference]: Finished difference Result 11935 states and 13881 transitions. [2018-04-10 17:01:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 17:01:20,133 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 302 [2018-04-10 17:01:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:20,142 INFO L225 Difference]: With dead ends: 11935 [2018-04-10 17:01:20,143 INFO L226 Difference]: Without dead ends: 11935 [2018-04-10 17:01:20,143 INFO L567 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-04-10 17:01:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11935 states. [2018-04-10 17:01:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11935 to 509. [2018-04-10 17:01:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-04-10 17:01:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 599 transitions. [2018-04-10 17:01:20,190 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 599 transitions. Word has length 302 [2018-04-10 17:01:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:20,190 INFO L459 AbstractCegarLoop]: Abstraction has 509 states and 599 transitions. [2018-04-10 17:01:20,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 17:01:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 599 transitions. [2018-04-10 17:01:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-10 17:01:20,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:20,192 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:20,192 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -345776699, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:20,195 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 1987 trivial. 0 not checked. [2018-04-10 17:01:20,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:20,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 17:01:20,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-04-10 17:01:20,594 INFO L182 omatonBuilderFactory]: Interpolants [284805#(= main_~x~0 10), 284870#(= main_~x~0 23), 284800#(= main_~x~0 9), 284865#(= main_~x~0 22), 284751#true, 284815#(= main_~x~0 12), 284810#(= main_~x~0 11), 284875#(= main_~x~0 24), 284820#(= main_~x~0 13), 284885#(= main_~x~0 26), 284752#false, 284880#(= main_~x~0 25), 284755#(= 0 main_~x~0), 284765#(= main_~x~0 2), 284830#(= main_~x~0 15), 284895#(= main_~x~0 28), 284760#(= 1 main_~x~0), 284825#(= main_~x~0 14), 284890#(= main_~x~0 27), 284900#(= main_~x~0 29), 284775#(= main_~x~0 4), 284770#(= main_~x~0 3), 284835#(= main_~x~0 16), 284780#(= main_~x~0 5), 284845#(= main_~x~0 18), 284910#(= main_~x~0 31), 284840#(= main_~x~0 17), 284905#(= main_~x~0 30), 284790#(= main_~x~0 7), 284855#(= main_~x~0 20), 284785#(= main_~x~0 6), 284850#(= main_~x~0 19), 284915#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 284860#(= main_~x~0 21), 284795#(= main_~x~0 8)] [2018-04-10 17:01:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 1987 trivial. 0 not checked. [2018-04-10 17:01:20,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 17:01:20,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 17:01:20,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 17:01:20,595 INFO L87 Difference]: Start difference. First operand 509 states and 599 transitions. Second operand 35 states. [2018-04-10 17:01:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:21,653 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-04-10 17:01:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 17:01:21,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 337 [2018-04-10 17:01:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:21,654 INFO L225 Difference]: With dead ends: 515 [2018-04-10 17:01:21,654 INFO L226 Difference]: Without dead ends: 515 [2018-04-10 17:01:21,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 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-04-10 17:01:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-04-10 17:01:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-04-10 17:01:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-04-10 17:01:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-04-10 17:01:21,656 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 337 [2018-04-10 17:01:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:21,656 INFO L459 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-04-10 17:01:21,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 17:01:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-04-10 17:01:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-10 17:01:21,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:21,657 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:21,657 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1640943130, now seen corresponding path program 60 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:21,659 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:22,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:22,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-10 17:01:22,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:22,586 INFO L182 omatonBuilderFactory]: Interpolants [285956#(= main_~i~0 6), 285957#(= main_~i~0 7), 285958#(= main_~i~0 8), 285959#(= main_~i~0 9), 285952#(= main_~i~0 2), 285953#(= main_~i~0 3), 285954#(= main_~i~0 4), 285955#(= main_~i~0 5), 285964#(= main_~i~0 14), 285965#(= main_~i~0 15), 285966#(= main_~i~0 16), 285967#(= main_~i~0 17), 285960#(= main_~i~0 10), 285961#(= main_~i~0 11), 285962#(= main_~i~0 12), 285963#(= main_~i~0 13), 285972#(= main_~i~0 22), 285973#(= main_~i~0 23), 285974#(= main_~i~0 24), 285975#(= main_~i~0 25), 285968#(= main_~i~0 18), 285969#(= main_~i~0 19), 285970#(= main_~i~0 20), 285971#(= main_~i~0 21), 285980#(= main_~i~0 30), 285981#(= main_~i~0 31), 285982#(= main_~i~0 32), 285983#(= main_~i~0 33), 285976#(= main_~i~0 26), 285977#(= main_~i~0 27), 285978#(= main_~i~0 28), 285979#(= main_~i~0 29), 285988#(= main_~i~0 38), 285989#(= main_~i~0 39), 285990#(= main_~i~0 40), 285991#(= main_~i~0 41), 285984#(= main_~i~0 34), 285985#(= main_~i~0 35), 285986#(= main_~i~0 36), 285987#(= main_~i~0 37), 285996#(= main_~i~0 46), 285997#(= main_~i~0 47), 285998#(= main_~i~0 48), 285999#(= main_~i~0 49), 285992#(= main_~i~0 42), 285993#(= main_~i~0 43), 285994#(= main_~i~0 44), 285995#(= main_~i~0 45), 286004#(= main_~i~0 54), 286005#(= main_~i~0 55), 286006#(= main_~i~0 56), 286007#(= main_~i~0 57), 286000#(= main_~i~0 50), 286001#(= main_~i~0 51), 286002#(= main_~i~0 52), 286003#(= main_~i~0 53), 286008#(= main_~i~0 58), 286009#(= main_~i~0 59), 286010#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 285950#(= main_~i~0 0), 285951#(= main_~i~0 1), 285946#true, 285947#false] [2018-04-10 17:01:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:22,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 17:01:22,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 17:01:22,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 17:01:22,587 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 63 states. [2018-04-10 17:01:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:27,523 INFO L93 Difference]: Finished difference Result 12497 states and 14536 transitions. [2018-04-10 17:01:27,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 17:01:27,524 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 307 [2018-04-10 17:01:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:27,532 INFO L225 Difference]: With dead ends: 12497 [2018-04-10 17:01:27,532 INFO L226 Difference]: Without dead ends: 12497 [2018-04-10 17:01:27,532 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 17:01:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2018-04-10 17:01:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 520. [2018-04-10 17:01:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-04-10 17:01:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 612 transitions. [2018-04-10 17:01:27,576 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 612 transitions. Word has length 307 [2018-04-10 17:01:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:27,576 INFO L459 AbstractCegarLoop]: Abstraction has 520 states and 612 transitions. [2018-04-10 17:01:27,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 17:01:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 612 transitions. [2018-04-10 17:01:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 17:01:27,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:27,577 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:27,577 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1047497001, now seen corresponding path program 61 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:27,580 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:28,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:28,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-10 17:01:28,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:28,533 INFO L182 omatonBuilderFactory]: Interpolants [299028#true, 299029#false, 299036#(= main_~i~0 4), 299037#(= main_~i~0 5), 299038#(= main_~i~0 6), 299039#(= main_~i~0 7), 299032#(= main_~i~0 0), 299033#(= main_~i~0 1), 299034#(= main_~i~0 2), 299035#(= main_~i~0 3), 299044#(= main_~i~0 12), 299045#(= main_~i~0 13), 299046#(= main_~i~0 14), 299047#(= main_~i~0 15), 299040#(= main_~i~0 8), 299041#(= main_~i~0 9), 299042#(= main_~i~0 10), 299043#(= main_~i~0 11), 299052#(= main_~i~0 20), 299053#(= main_~i~0 21), 299054#(= main_~i~0 22), 299055#(= main_~i~0 23), 299048#(= main_~i~0 16), 299049#(= main_~i~0 17), 299050#(= main_~i~0 18), 299051#(= main_~i~0 19), 299060#(= main_~i~0 28), 299061#(= main_~i~0 29), 299062#(= main_~i~0 30), 299063#(= main_~i~0 31), 299056#(= main_~i~0 24), 299057#(= main_~i~0 25), 299058#(= main_~i~0 26), 299059#(= main_~i~0 27), 299068#(= main_~i~0 36), 299069#(= main_~i~0 37), 299070#(= main_~i~0 38), 299071#(= main_~i~0 39), 299064#(= main_~i~0 32), 299065#(= main_~i~0 33), 299066#(= main_~i~0 34), 299067#(= main_~i~0 35), 299076#(= main_~i~0 44), 299077#(= main_~i~0 45), 299078#(= main_~i~0 46), 299079#(= main_~i~0 47), 299072#(= main_~i~0 40), 299073#(= main_~i~0 41), 299074#(= main_~i~0 42), 299075#(= main_~i~0 43), 299084#(= main_~i~0 52), 299085#(= main_~i~0 53), 299086#(= main_~i~0 54), 299087#(= main_~i~0 55), 299080#(= main_~i~0 48), 299081#(= main_~i~0 49), 299082#(= main_~i~0 50), 299083#(= main_~i~0 51), 299092#(= main_~i~0 60), 299093#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 299088#(= main_~i~0 56), 299089#(= main_~i~0 57), 299090#(= main_~i~0 58), 299091#(= main_~i~0 59)] [2018-04-10 17:01:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:28,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 17:01:28,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 17:01:28,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 17:01:28,534 INFO L87 Difference]: Start difference. First operand 520 states and 612 transitions. Second operand 64 states. [2018-04-10 17:01:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:33,657 INFO L93 Difference]: Finished difference Result 12705 states and 14778 transitions. [2018-04-10 17:01:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 17:01:33,658 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 312 [2018-04-10 17:01:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:33,668 INFO L225 Difference]: With dead ends: 12705 [2018-04-10 17:01:33,668 INFO L226 Difference]: Without dead ends: 12705 [2018-04-10 17:01:33,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 17:01:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2018-04-10 17:01:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 525. [2018-04-10 17:01:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-10 17:01:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 618 transitions. [2018-04-10 17:01:33,717 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 618 transitions. Word has length 312 [2018-04-10 17:01:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:33,717 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 618 transitions. [2018-04-10 17:01:33,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 17:01:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 618 transitions. [2018-04-10 17:01:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-10 17:01:33,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:33,719 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:33,719 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1611527006, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:33,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5382 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-04-10 17:01:34,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:34,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 17:01:34,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-04-10 17:01:34,116 INFO L182 omatonBuilderFactory]: Interpolants [312324#true, 312388#(= main_~x~0 12), 312325#false, 312453#(= main_~x~0 25), 312448#(= main_~x~0 24), 312333#(= 1 main_~x~0), 312398#(= main_~x~0 14), 312463#(= main_~x~0 27), 312328#(= 0 main_~x~0), 312393#(= main_~x~0 13), 312458#(= main_~x~0 26), 312468#(= main_~x~0 28), 312343#(= main_~x~0 3), 312338#(= main_~x~0 2), 312403#(= main_~x~0 15), 312348#(= main_~x~0 4), 312413#(= main_~x~0 17), 312478#(= main_~x~0 30), 312408#(= main_~x~0 16), 312473#(= main_~x~0 29), 312358#(= main_~x~0 6), 312423#(= main_~x~0 19), 312353#(= main_~x~0 5), 312418#(= main_~x~0 18), 312483#(= main_~x~0 31), 312428#(= main_~x~0 20), 312493#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 312488#(= main_~x~0 32), 312363#(= main_~x~0 7), 312373#(= main_~x~0 9), 312438#(= main_~x~0 22), 312368#(= main_~x~0 8), 312433#(= main_~x~0 21), 312383#(= main_~x~0 11), 312378#(= main_~x~0 10), 312443#(= main_~x~0 23)] [2018-04-10 17:01:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5382 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-04-10 17:01:34,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 17:01:34,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 17:01:34,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 17:01:34,117 INFO L87 Difference]: Start difference. First operand 525 states and 618 transitions. Second operand 36 states. [2018-04-10 17:01:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:35,210 INFO L93 Difference]: Finished difference Result 531 states and 625 transitions. [2018-04-10 17:01:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 17:01:35,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-04-10 17:01:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:35,211 INFO L225 Difference]: With dead ends: 531 [2018-04-10 17:01:35,211 INFO L226 Difference]: Without dead ends: 531 [2018-04-10 17:01:35,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 17:01:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-10 17:01:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-04-10 17:01:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-04-10 17:01:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 625 transitions. [2018-04-10 17:01:35,219 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 625 transitions. Word has length 347 [2018-04-10 17:01:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:35,219 INFO L459 AbstractCegarLoop]: Abstraction has 531 states and 625 transitions. [2018-04-10 17:01:35,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 17:01:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 625 transitions. [2018-04-10 17:01:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-10 17:01:35,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:35,220 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:35,220 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2040815482, now seen corresponding path program 62 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:35,224 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:36,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:36,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-10 17:01:36,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:36,437 INFO L182 omatonBuilderFactory]: Interpolants [313604#(= main_~i~0 44), 313605#(= main_~i~0 45), 313606#(= main_~i~0 46), 313607#(= main_~i~0 47), 313600#(= main_~i~0 40), 313601#(= main_~i~0 41), 313602#(= main_~i~0 42), 313603#(= main_~i~0 43), 313612#(= main_~i~0 52), 313613#(= main_~i~0 53), 313614#(= main_~i~0 54), 313615#(= main_~i~0 55), 313608#(= main_~i~0 48), 313609#(= main_~i~0 49), 313610#(= main_~i~0 50), 313611#(= main_~i~0 51), 313620#(= main_~i~0 60), 313621#(= main_~i~0 61), 313622#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 313616#(= main_~i~0 56), 313617#(= main_~i~0 57), 313618#(= main_~i~0 58), 313619#(= main_~i~0 59), 313556#true, 313557#false, 313564#(= main_~i~0 4), 313565#(= main_~i~0 5), 313566#(= main_~i~0 6), 313567#(= main_~i~0 7), 313560#(= main_~i~0 0), 313561#(= main_~i~0 1), 313562#(= main_~i~0 2), 313563#(= main_~i~0 3), 313572#(= main_~i~0 12), 313573#(= main_~i~0 13), 313574#(= main_~i~0 14), 313575#(= main_~i~0 15), 313568#(= main_~i~0 8), 313569#(= main_~i~0 9), 313570#(= main_~i~0 10), 313571#(= main_~i~0 11), 313580#(= main_~i~0 20), 313581#(= main_~i~0 21), 313582#(= main_~i~0 22), 313583#(= main_~i~0 23), 313576#(= main_~i~0 16), 313577#(= main_~i~0 17), 313578#(= main_~i~0 18), 313579#(= main_~i~0 19), 313588#(= main_~i~0 28), 313589#(= main_~i~0 29), 313590#(= main_~i~0 30), 313591#(= main_~i~0 31), 313584#(= main_~i~0 24), 313585#(= main_~i~0 25), 313586#(= main_~i~0 26), 313587#(= main_~i~0 27), 313596#(= main_~i~0 36), 313597#(= main_~i~0 37), 313598#(= main_~i~0 38), 313599#(= main_~i~0 39), 313592#(= main_~i~0 32), 313593#(= main_~i~0 33), 313594#(= main_~i~0 34), 313595#(= main_~i~0 35)] [2018-04-10 17:01:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:36,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 17:01:36,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 17:01:36,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 17:01:36,438 INFO L87 Difference]: Start difference. First operand 531 states and 625 transitions. Second operand 65 states. [2018-04-10 17:01:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:41,770 INFO L93 Difference]: Finished difference Result 13285 states and 15454 transitions. [2018-04-10 17:01:41,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 17:01:41,770 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 317 [2018-04-10 17:01:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:41,781 INFO L225 Difference]: With dead ends: 13285 [2018-04-10 17:01:41,781 INFO L226 Difference]: Without dead ends: 13285 [2018-04-10 17:01:41,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 17:01:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2018-04-10 17:01:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 536. [2018-04-10 17:01:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-04-10 17:01:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 631 transitions. [2018-04-10 17:01:41,845 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 631 transitions. Word has length 317 [2018-04-10 17:01:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:41,845 INFO L459 AbstractCegarLoop]: Abstraction has 536 states and 631 transitions. [2018-04-10 17:01:41,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 17:01:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 631 transitions. [2018-04-10 17:01:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-10 17:01:41,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:41,847 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:41,847 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 700591159, now seen corresponding path program 63 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:41,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:42,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:42,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-10 17:01:42,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:42,862 INFO L182 omatonBuilderFactory]: Interpolants [327444#true, 327445#false, 327452#(= main_~i~0 4), 327453#(= main_~i~0 5), 327454#(= main_~i~0 6), 327455#(= main_~i~0 7), 327448#(= main_~i~0 0), 327449#(= main_~i~0 1), 327450#(= main_~i~0 2), 327451#(= main_~i~0 3), 327460#(= main_~i~0 12), 327461#(= main_~i~0 13), 327462#(= main_~i~0 14), 327463#(= main_~i~0 15), 327456#(= main_~i~0 8), 327457#(= main_~i~0 9), 327458#(= main_~i~0 10), 327459#(= main_~i~0 11), 327468#(= main_~i~0 20), 327469#(= main_~i~0 21), 327470#(= main_~i~0 22), 327471#(= main_~i~0 23), 327464#(= main_~i~0 16), 327465#(= main_~i~0 17), 327466#(= main_~i~0 18), 327467#(= main_~i~0 19), 327476#(= main_~i~0 28), 327477#(= main_~i~0 29), 327478#(= main_~i~0 30), 327479#(= main_~i~0 31), 327472#(= main_~i~0 24), 327473#(= main_~i~0 25), 327474#(= main_~i~0 26), 327475#(= main_~i~0 27), 327484#(= main_~i~0 36), 327485#(= main_~i~0 37), 327486#(= main_~i~0 38), 327487#(= main_~i~0 39), 327480#(= main_~i~0 32), 327481#(= main_~i~0 33), 327482#(= main_~i~0 34), 327483#(= main_~i~0 35), 327492#(= main_~i~0 44), 327493#(= main_~i~0 45), 327494#(= main_~i~0 46), 327495#(= main_~i~0 47), 327488#(= main_~i~0 40), 327489#(= main_~i~0 41), 327490#(= main_~i~0 42), 327491#(= main_~i~0 43), 327500#(= main_~i~0 52), 327501#(= main_~i~0 53), 327502#(= main_~i~0 54), 327503#(= main_~i~0 55), 327496#(= main_~i~0 48), 327497#(= main_~i~0 49), 327498#(= main_~i~0 50), 327499#(= main_~i~0 51), 327508#(= main_~i~0 60), 327509#(= main_~i~0 61), 327510#(= main_~i~0 62), 327511#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 327504#(= main_~i~0 56), 327505#(= main_~i~0 57), 327506#(= main_~i~0 58), 327507#(= main_~i~0 59)] [2018-04-10 17:01:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:42,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 17:01:42,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 17:01:42,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 17:01:42,863 INFO L87 Difference]: Start difference. First operand 536 states and 631 transitions. Second operand 66 states. [2018-04-10 17:01:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:48,247 INFO L93 Difference]: Finished difference Result 13499 states and 15703 transitions. [2018-04-10 17:01:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 17:01:48,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 322 [2018-04-10 17:01:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:48,259 INFO L225 Difference]: With dead ends: 13499 [2018-04-10 17:01:48,259 INFO L226 Difference]: Without dead ends: 13499 [2018-04-10 17:01:48,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 17:01:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13499 states. [2018-04-10 17:01:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13499 to 541. [2018-04-10 17:01:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-04-10 17:01:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 637 transitions. [2018-04-10 17:01:48,313 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 637 transitions. Word has length 322 [2018-04-10 17:01:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:48,314 INFO L459 AbstractCegarLoop]: Abstraction has 541 states and 637 transitions. [2018-04-10 17:01:48,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 17:01:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 637 transitions. [2018-04-10 17:01:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-10 17:01:48,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:48,315 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:48,315 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 479005503, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:48,318 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5715 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2018-04-10 17:01:48,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:48,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 17:01:48,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-04-10 17:01:48,707 INFO L182 omatonBuilderFactory]: Interpolants [341701#(= main_~x~0 29), 341636#(= main_~x~0 16), 341696#(= main_~x~0 28), 341571#(= main_~x~0 3), 341581#(= main_~x~0 5), 341711#(= main_~x~0 31), 341646#(= main_~x~0 18), 341641#(= main_~x~0 17), 341576#(= main_~x~0 4), 341706#(= main_~x~0 30), 341716#(= main_~x~0 32), 341591#(= main_~x~0 7), 341651#(= main_~x~0 19), 341586#(= main_~x~0 6), 341661#(= main_~x~0 21), 341596#(= main_~x~0 8), 341726#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 341721#(= main_~x~0 33), 341656#(= main_~x~0 20), 341671#(= main_~x~0 23), 341606#(= main_~x~0 10), 341601#(= main_~x~0 9), 341666#(= main_~x~0 22), 341676#(= main_~x~0 24), 341611#(= main_~x~0 11), 341621#(= main_~x~0 13), 341556#(= 0 main_~x~0), 341686#(= main_~x~0 26), 341553#false, 341681#(= main_~x~0 25), 341552#true, 341616#(= main_~x~0 12), 341631#(= main_~x~0 15), 341566#(= main_~x~0 2), 341561#(= 1 main_~x~0), 341691#(= main_~x~0 27), 341626#(= main_~x~0 14)] [2018-04-10 17:01:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5715 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2018-04-10 17:01:48,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 17:01:48,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 17:01:48,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 17:01:48,707 INFO L87 Difference]: Start difference. First operand 541 states and 637 transitions. Second operand 37 states. [2018-04-10 17:01:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:49,864 INFO L93 Difference]: Finished difference Result 547 states and 644 transitions. [2018-04-10 17:01:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 17:01:49,864 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 357 [2018-04-10 17:01:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:49,865 INFO L225 Difference]: With dead ends: 547 [2018-04-10 17:01:49,865 INFO L226 Difference]: Without dead ends: 547 [2018-04-10 17:01:49,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 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-04-10 17:01:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-10 17:01:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2018-04-10 17:01:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-04-10 17:01:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 644 transitions. [2018-04-10 17:01:49,868 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 644 transitions. Word has length 357 [2018-04-10 17:01:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:49,868 INFO L459 AbstractCegarLoop]: Abstraction has 547 states and 644 transitions. [2018-04-10 17:01:49,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 17:01:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 644 transitions. [2018-04-10 17:01:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-10 17:01:49,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:49,869 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:49,869 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 365184806, now seen corresponding path program 64 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:49,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:50,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:50,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-10 17:01:50,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:50,943 INFO L182 omatonBuilderFactory]: Interpolants [342821#true, 342822#false, 342829#(= main_~i~0 4), 342828#(= main_~i~0 3), 342831#(= main_~i~0 6), 342830#(= main_~i~0 5), 342825#(= main_~i~0 0), 342827#(= main_~i~0 2), 342826#(= main_~i~0 1), 342837#(= main_~i~0 12), 342836#(= main_~i~0 11), 342839#(= main_~i~0 14), 342838#(= main_~i~0 13), 342833#(= main_~i~0 8), 342832#(= main_~i~0 7), 342835#(= main_~i~0 10), 342834#(= main_~i~0 9), 342845#(= main_~i~0 20), 342844#(= main_~i~0 19), 342847#(= main_~i~0 22), 342846#(= main_~i~0 21), 342841#(= main_~i~0 16), 342840#(= main_~i~0 15), 342843#(= main_~i~0 18), 342842#(= main_~i~0 17), 342853#(= main_~i~0 28), 342852#(= main_~i~0 27), 342855#(= main_~i~0 30), 342854#(= main_~i~0 29), 342849#(= main_~i~0 24), 342848#(= main_~i~0 23), 342851#(= main_~i~0 26), 342850#(= main_~i~0 25), 342861#(= main_~i~0 36), 342860#(= main_~i~0 35), 342863#(= main_~i~0 38), 342862#(= main_~i~0 37), 342857#(= main_~i~0 32), 342856#(= main_~i~0 31), 342859#(= main_~i~0 34), 342858#(= main_~i~0 33), 342869#(= main_~i~0 44), 342868#(= main_~i~0 43), 342871#(= main_~i~0 46), 342870#(= main_~i~0 45), 342865#(= main_~i~0 40), 342864#(= main_~i~0 39), 342867#(= main_~i~0 42), 342866#(= main_~i~0 41), 342877#(= main_~i~0 52), 342876#(= main_~i~0 51), 342879#(= main_~i~0 54), 342878#(= main_~i~0 53), 342873#(= main_~i~0 48), 342872#(= main_~i~0 47), 342875#(= main_~i~0 50), 342874#(= main_~i~0 49), 342885#(= main_~i~0 60), 342884#(= main_~i~0 59), 342887#(= main_~i~0 62), 342886#(= main_~i~0 61), 342881#(= main_~i~0 56), 342880#(= main_~i~0 55), 342883#(= main_~i~0 58), 342882#(= main_~i~0 57), 342889#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 342888#(= main_~i~0 63)] [2018-04-10 17:01:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:50,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 17:01:50,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 17:01:50,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 17:01:50,944 INFO L87 Difference]: Start difference. First operand 547 states and 644 transitions. Second operand 67 states. [2018-04-10 17:01:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:56,537 INFO L93 Difference]: Finished difference Result 14097 states and 16400 transitions. [2018-04-10 17:01:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 17:01:56,537 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-10 17:01:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:56,549 INFO L225 Difference]: With dead ends: 14097 [2018-04-10 17:01:56,549 INFO L226 Difference]: Without dead ends: 14097 [2018-04-10 17:01:56,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 17:01:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2018-04-10 17:01:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 552. [2018-04-10 17:01:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-04-10 17:01:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 650 transitions. [2018-04-10 17:01:56,611 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 650 transitions. Word has length 327 [2018-04-10 17:01:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:56,611 INFO L459 AbstractCegarLoop]: Abstraction has 552 states and 650 transitions. [2018-04-10 17:01:56,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 17:01:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 650 transitions. [2018-04-10 17:01:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-10 17:01:56,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:56,613 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:56,613 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1514416540, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:56,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6058 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2018-04-10 17:01:57,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:57,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 17:01:57,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-04-10 17:01:57,050 INFO L182 omatonBuilderFactory]: Interpolants [357573#(= main_~x~0 6), 357703#(= main_~x~0 32), 357638#(= main_~x~0 19), 357633#(= main_~x~0 18), 357568#(= main_~x~0 5), 357698#(= main_~x~0 31), 357708#(= main_~x~0 33), 357583#(= main_~x~0 8), 357643#(= main_~x~0 20), 357578#(= main_~x~0 7), 357653#(= main_~x~0 22), 357588#(= main_~x~0 9), 357718#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 357713#(= main_~x~0 34), 357648#(= main_~x~0 21), 357663#(= main_~x~0 24), 357598#(= main_~x~0 11), 357593#(= main_~x~0 10), 357658#(= main_~x~0 23), 357540#false, 357668#(= main_~x~0 25), 357543#(= 0 main_~x~0), 357539#true, 357603#(= main_~x~0 12), 357613#(= main_~x~0 14), 357548#(= 1 main_~x~0), 357678#(= main_~x~0 27), 357673#(= main_~x~0 26), 357608#(= main_~x~0 13), 357623#(= main_~x~0 16), 357558#(= main_~x~0 3), 357553#(= main_~x~0 2), 357683#(= main_~x~0 28), 357618#(= main_~x~0 15), 357693#(= main_~x~0 30), 357628#(= main_~x~0 17), 357688#(= main_~x~0 29), 357563#(= main_~x~0 4)] [2018-04-10 17:01:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6058 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2018-04-10 17:01:57,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 17:01:57,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 17:01:57,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 17:01:57,050 INFO L87 Difference]: Start difference. First operand 552 states and 650 transitions. Second operand 38 states. [2018-04-10 17:01:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 17:01:58,277 INFO L93 Difference]: Finished difference Result 558 states and 657 transitions. [2018-04-10 17:01:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 17:01:58,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 367 [2018-04-10 17:01:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 17:01:58,278 INFO L225 Difference]: With dead ends: 558 [2018-04-10 17:01:58,278 INFO L226 Difference]: Without dead ends: 558 [2018-04-10 17:01:58,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 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-04-10 17:01:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-04-10 17:01:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2018-04-10 17:01:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-04-10 17:01:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 657 transitions. [2018-04-10 17:01:58,280 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 657 transitions. Word has length 367 [2018-04-10 17:01:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 17:01:58,281 INFO L459 AbstractCegarLoop]: Abstraction has 558 states and 657 transitions. [2018-04-10 17:01:58,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 17:01:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 657 transitions. [2018-04-10 17:01:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 17:01:58,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 17:01:58,282 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-10 17:01:58,282 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 17:01:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1356376471, now seen corresponding path program 65 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 17:01:58,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 17:01:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 17:01:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:59,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 17:01:59,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-10 17:01:59,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 17:01:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:59,351 INFO L182 omatonBuilderFactory]: Interpolants [358836#false, 358839#(= main_~i~0 0), 358835#true, 358845#(= main_~i~0 6), 358844#(= main_~i~0 5), 358847#(= main_~i~0 8), 358846#(= main_~i~0 7), 358841#(= main_~i~0 2), 358840#(= main_~i~0 1), 358843#(= main_~i~0 4), 358842#(= main_~i~0 3), 358853#(= main_~i~0 14), 358852#(= main_~i~0 13), 358855#(= main_~i~0 16), 358854#(= main_~i~0 15), 358849#(= main_~i~0 10), 358848#(= main_~i~0 9), 358851#(= main_~i~0 12), 358850#(= main_~i~0 11), 358861#(= main_~i~0 22), 358860#(= main_~i~0 21), 358863#(= main_~i~0 24), 358862#(= main_~i~0 23), 358857#(= main_~i~0 18), 358856#(= main_~i~0 17), 358859#(= main_~i~0 20), 358858#(= main_~i~0 19), 358869#(= main_~i~0 30), 358868#(= main_~i~0 29), 358871#(= main_~i~0 32), 358870#(= main_~i~0 31), 358865#(= main_~i~0 26), 358864#(= main_~i~0 25), 358867#(= main_~i~0 28), 358866#(= main_~i~0 27), 358877#(= main_~i~0 38), 358876#(= main_~i~0 37), 358879#(= main_~i~0 40), 358878#(= main_~i~0 39), 358873#(= main_~i~0 34), 358872#(= main_~i~0 33), 358875#(= main_~i~0 36), 358874#(= main_~i~0 35), 358885#(= main_~i~0 46), 358884#(= main_~i~0 45), 358887#(= main_~i~0 48), 358886#(= main_~i~0 47), 358881#(= main_~i~0 42), 358880#(= main_~i~0 41), 358883#(= main_~i~0 44), 358882#(= main_~i~0 43), 358893#(= main_~i~0 54), 358892#(= main_~i~0 53), 358895#(= main_~i~0 56), 358894#(= main_~i~0 55), 358889#(= main_~i~0 50), 358888#(= main_~i~0 49), 358891#(= main_~i~0 52), 358890#(= main_~i~0 51), 358901#(= main_~i~0 62), 358900#(= main_~i~0 61), 358903#(= main_~i~0 64), 358902#(= main_~i~0 63), 358897#(= main_~i~0 58), 358896#(= main_~i~0 57), 358899#(= main_~i~0 60), 358898#(= main_~i~0 59), 358904#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-10 17:01:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 17:01:59,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 17:01:59,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 17:01:59,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 17:01:59,352 INFO L87 Difference]: Start difference. First operand 558 states and 657 transitions. Second operand 68 states. Received shutdown request... [2018-04-10 17:02:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 17:02:01,142 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 17:02:01,146 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 17:02:01,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 05:02:01 BoogieIcfgContainer [2018-04-10 17:02:01,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 17:02:01,147 INFO L168 Benchmark]: Toolchain (without parser) took 181875.85 ms. Allocated memory was 392.7 MB in the beginning and 892.9 MB in the end (delta: 500.2 MB). Free memory was 331.8 MB in the beginning and 560.0 MB in the end (delta: -228.2 MB). Peak memory consumption was 272.0 MB. Max. memory is 5.3 GB. [2018-04-10 17:02:01,148 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 392.7 MB. Free memory is still 353.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 17:02:01,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.15 ms. Allocated memory is still 392.7 MB. Free memory was 331.2 MB in the beginning and 321.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. [2018-04-10 17:02:01,148 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 392.7 MB. Free memory was 321.6 MB in the beginning and 320.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 17:02:01,149 INFO L168 Benchmark]: RCFGBuilder took 203.74 ms. Allocated memory was 392.7 MB in the beginning and 593.5 MB in the end (delta: 200.8 MB). Free memory was 320.3 MB in the beginning and 560.0 MB in the end (delta: -239.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-04-10 17:02:01,149 INFO L168 Benchmark]: TraceAbstraction took 181514.90 ms. Allocated memory was 593.5 MB in the beginning and 892.9 MB in the end (delta: 299.4 MB). Free memory was 560.0 MB in the beginning and 560.0 MB in the end (delta: 14.9 kB). Peak memory consumption was 299.4 MB. Max. memory is 5.3 GB. [2018-04-10 17:02:01,150 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.22 ms. Allocated memory is still 392.7 MB. Free memory is still 353.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 135.15 ms. Allocated memory is still 392.7 MB. Free memory was 331.2 MB in the beginning and 321.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 392.7 MB. Free memory was 321.6 MB in the beginning and 320.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 203.74 ms. Allocated memory was 392.7 MB in the beginning and 593.5 MB in the end (delta: 200.8 MB). Free memory was 320.3 MB in the beginning and 560.0 MB in the end (delta: -239.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 181514.90 ms. Allocated memory was 593.5 MB in the beginning and 892.9 MB in the end (delta: 299.4 MB). Free memory was 560.0 MB in the beginning and 560.0 MB in the end (delta: 14.9 kB). Peak memory consumption was 299.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 (558states) and interpolant automaton (currently 26 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (265 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 (558states) and interpolant automaton (currently 26 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (265 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 (558states) and interpolant automaton (currently 26 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (265 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 (558states) and interpolant automaton (currently 26 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (265 states constructedinput type IntersectNwa). - 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 (558states) and interpolant automaton (currently 26 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (265 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 181.4s OverallTime, 103 OverallIterations, 66 TraceHistogramMax, 144.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21590 SDtfs, 28184 SDslu, 716334 SDs, 0 SdLazy, 708543 SolverSat, 3953 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4452 GetRequests, 1572 SyntacticMatches, 0 SemanticMatches, 2880 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558occurred in iteration=102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 28668/306488 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 102 MinimizatonAttempts, 294442 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 18116 NumberOfCodeBlocks, 18116 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 18013 ConstructedInterpolants, 0 QuantifiedInterpolants, 11154315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 28668/306488 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_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_17-02-01-156.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_17-02-01-156.csv Completed graceful shutdown