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 --cacsl2boogietranslator.bitprecise.bitfields false -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-408c70d-m [2018-04-13 14:13:06,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 14:13:06,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 14:13:06,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 14:13:06,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 14:13:06,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 14:13:06,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 14:13:06,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 14:13:06,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 14:13:06,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 14:13:06,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 14:13:06,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 14:13:06,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 14:13:06,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 14:13:06,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 14:13:06,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 14:13:06,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 14:13:06,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 14:13:06,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 14:13:06,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 14:13:06,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 14:13:06,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 14:13:06,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 14:13:06,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 14:13:06,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 14:13:06,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 14:13:06,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 14:13:06,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 14:13:06,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 14:13:06,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 14:13:06,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 14:13:06,321 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-13 14:13:06,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 14:13:06,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 14:13:06,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 14:13:06,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 14:13:06,333 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 14:13:06,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 14:13:06,333 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 14:13:06,334 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 14:13:06,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 14:13:06,335 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 14:13:06,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 14:13:06,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 14:13:06,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 14:13:06,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 14:13:06,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 14:13:06,336 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 14:13:06,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-13 14:13:06,336 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-13 14:13:06,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 14:13:06,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 14:13:06,377 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 14:13:06,380 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 14:13:06,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 14:13:06,381 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 14:13:06,382 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-13 14:13:06,715 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5239c1553 [2018-04-13 14:13:06,794 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 14:13:06,794 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 14:13:06,794 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-13 14:13:06,795 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 14:13:06,795 INFO L215 ultiparseSymbolTable]: [2018-04-13 14:13:06,795 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 14:13:06,795 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-13 14:13:06,795 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-13 14:13:06,795 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 14:13:06,795 INFO L233 ultiparseSymbolTable]: [2018-04-13 14:13:06,807 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5239c1553 [2018-04-13 14:13:06,810 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 14:13:06,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 14:13:06,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 14:13:06,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 14:13:06,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 14:13:06,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b37d579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06, skipping insertion in model container [2018-04-13 14:13:06,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,832 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 14:13:06,843 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 14:13:06,944 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 14:13:06,957 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 14:13:06,960 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-13 14:13:06,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06 WrapperNode [2018-04-13 14:13:06,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 14:13:06,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 14:13:06,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 14:13:06,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 14:13:06,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (1/1) ... [2018-04-13 14:13:06,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 14:13:06,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 14:13:06,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 14:13:06,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 14:13:06,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (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-13 14:13:07,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 14:13:07,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 14:13:07,027 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-13 14:13:07,028 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 14:13:07,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 14:13:07,028 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-13 14:13:07,028 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 14:13:07,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 14:13:07,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 14:13:07,171 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 14:13:07,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 02:13:07 BoogieIcfgContainer [2018-04-13 14:13:07,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 14:13:07,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 14:13:07,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 14:13:07,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 14:13:07,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 02:13:06" (1/3) ... [2018-04-13 14:13:07,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e8c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 02:13:07, skipping insertion in model container [2018-04-13 14:13:07,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 02:13:06" (2/3) ... [2018-04-13 14:13:07,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e8c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 02:13:07, skipping insertion in model container [2018-04-13 14:13:07,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 02:13:07" (3/3) ... [2018-04-13 14:13:07,178 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-13 14:13:07,184 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 14:13:07,188 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-13 14:13:07,211 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 14:13:07,212 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 14:13:07,212 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 14:13:07,212 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-13 14:13:07,212 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 14:13:07,212 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 14:13:07,213 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 14:13:07,213 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 14:13:07,213 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 14:13:07,213 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 14:13:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-13 14:13:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-13 14:13:07,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,235 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,235 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,238 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-13 14:13:07,246 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,289 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-13 14:13:07,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 14:13:07,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 14:13:07,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,322 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-13 14:13:07,322 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 39#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-13 14:13:07,323 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-13 14:13:07,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 14:13:07,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 14:13:07,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 14:13:07,332 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-13 14:13:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,359 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-04-13 14:13:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 14:13:07,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-13 14:13:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,369 INFO L225 Difference]: With dead ends: 32 [2018-04-13 14:13:07,369 INFO L226 Difference]: Without dead ends: 26 [2018-04-13 14:13:07,371 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-13 14:13:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-04-13 14:13:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-04-13 14:13:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-04-13 14:13:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-04-13 14:13:07,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 7 [2018-04-13 14:13:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,397 INFO L459 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-04-13 14:13:07,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 14:13:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-04-13 14:13:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 14:13:07,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,398 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,398 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-13 14:13:07,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,420 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-13 14:13:07,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 14:13:07,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 14:13:07,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,438 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-13 14:13:07,438 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 102#(and (< main_~x~0 100000) (<= 0 main_~x~0))] [2018-04-13 14:13:07,438 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-13 14:13:07,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 14:13:07,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 14:13:07,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 14:13:07,440 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2018-04-13 14:13:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,459 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-04-13 14:13:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 14:13:07,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 14:13:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,460 INFO L225 Difference]: With dead ends: 28 [2018-04-13 14:13:07,460 INFO L226 Difference]: Without dead ends: 28 [2018-04-13 14:13:07,461 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-13 14:13:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-04-13 14:13:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-04-13 14:13:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-04-13 14:13:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-04-13 14:13:07,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2018-04-13 14:13:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,465 INFO L459 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-04-13 14:13:07,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 14:13:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-04-13 14:13:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 14:13:07,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,466 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,467 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,467 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-13 14:13:07,471 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,496 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-13 14:13:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:07,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-13 14:13:07,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,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-13 14:13:07,523 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-13 14:13:07,523 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-13 14:13:07,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 14:13:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 14:13:07,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 14:13:07,524 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-04-13 14:13:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,559 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 14:13:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 14:13:07,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-13 14:13:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,561 INFO L225 Difference]: With dead ends: 44 [2018-04-13 14:13:07,561 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 14:13:07,562 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-13 14:13:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 14:13:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-13 14:13:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-13 14:13:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-04-13 14:13:07,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2018-04-13 14:13:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,571 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-04-13 14:13:07,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 14:13:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-04-13 14:13:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 14:13:07,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,572 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,572 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,572 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-13 14:13:07,576 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,607 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-13 14:13:07,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:07,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-13 14:13:07,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:13:07,625 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-13 14:13:07,625 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-13 14:13:07,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 14:13:07,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 14:13:07,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 14:13:07,626 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2018-04-13 14:13:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,661 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-13 14:13:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 14:13:07,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-13 14:13:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,662 INFO L225 Difference]: With dead ends: 60 [2018-04-13 14:13:07,662 INFO L226 Difference]: Without dead ends: 60 [2018-04-13 14:13:07,662 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-13 14:13:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-13 14:13:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2018-04-13 14:13:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 14:13:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-13 14:13:07,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2018-04-13 14:13:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,667 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-13 14:13:07,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 14:13:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-13 14:13:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 14:13:07,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,668 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-13 14:13:07,668 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,668 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-13 14:13:07,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,690 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-13 14:13:07,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 14:13:07,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 14:13:07,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,707 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-13 14:13:07,707 INFO L182 omatonBuilderFactory]: Interpolants [352#(<= main_~i~0 main_~x~0), 347#true, 348#false, 351#(= main_~i~0 0)] [2018-04-13 14:13:07,708 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-13 14:13:07,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 14:13:07,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 14:13:07,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 14:13:07,708 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2018-04-13 14:13:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,749 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-04-13 14:13:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 14:13:07,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-13 14:13:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,750 INFO L225 Difference]: With dead ends: 41 [2018-04-13 14:13:07,750 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 14:13:07,751 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-13 14:13:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 14:13:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-13 14:13:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 14:13:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-13 14:13:07,754 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2018-04-13 14:13:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,754 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-13 14:13:07,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 14:13:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-13 14:13:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 14:13:07,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,755 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,755 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,755 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-13 14:13:07,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,803 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-13 14:13:07,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:07,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 14:13:07,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,822 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-13 14:13:07,822 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-13 14:13:07,822 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-13 14:13:07,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 14:13:07,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 14:13:07,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-13 14:13:07,823 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 6 states. [2018-04-13 14:13:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,874 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-13 14:13:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 14:13:07,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-13 14:13:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,875 INFO L225 Difference]: With dead ends: 65 [2018-04-13 14:13:07,875 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 14:13:07,876 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-13 14:13:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 14:13:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-04-13 14:13:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 14:13:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-04-13 14:13:07,878 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 22 [2018-04-13 14:13:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,879 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-04-13 14:13:07,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 14:13:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-04-13 14:13:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 14:13:07,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,879 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-13 14:13:07,879 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,879 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-13 14:13:07,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,902 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-13 14:13:07,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:07,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-13 14:13:07,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:07,919 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-13 14:13:07,919 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-13 14:13:07,919 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-13 14:13:07,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 14:13:07,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 14:13:07,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 14:13:07,920 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-04-13 14:13:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:07,935 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-13 14:13:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 14:13:07,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-04-13 14:13:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:07,937 INFO L225 Difference]: With dead ends: 49 [2018-04-13 14:13:07,937 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 14:13:07,937 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-13 14:13:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 14:13:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 14:13:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 14:13:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-04-13 14:13:07,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-04-13 14:13:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:07,939 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-04-13 14:13:07,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 14:13:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-04-13 14:13:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 14:13:07,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:07,941 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:07,941 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:07,941 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-13 14:13:07,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:07,978 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-13 14:13:08,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 14:13:08,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,006 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-13 14:13:08,006 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-13 14:13:08,006 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-13 14:13:08,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 14:13:08,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 14:13:08,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 14:13:08,007 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-04-13 14:13:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,101 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-04-13 14:13:08,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 14:13:08,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-13 14:13:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,102 INFO L225 Difference]: With dead ends: 105 [2018-04-13 14:13:08,102 INFO L226 Difference]: Without dead ends: 105 [2018-04-13 14:13:08,103 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-13 14:13:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-13 14:13:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 54. [2018-04-13 14:13:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 14:13:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-13 14:13:08,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 27 [2018-04-13 14:13:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,105 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-13 14:13:08,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 14:13:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-13 14:13:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 14:13:08,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,106 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:08,106 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,106 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-13 14:13:08,109 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,136 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-13 14:13:08,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 14:13:08,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,154 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-13 14:13:08,154 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-13 14:13:08,155 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-13 14:13:08,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 14:13:08,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 14:13:08,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-13 14:13:08,156 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-13 14:13:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,238 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-04-13 14:13:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 14:13:08,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-13 14:13:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,239 INFO L225 Difference]: With dead ends: 127 [2018-04-13 14:13:08,239 INFO L226 Difference]: Without dead ends: 127 [2018-04-13 14:13:08,239 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-13 14:13:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-13 14:13:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2018-04-13 14:13:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-13 14:13:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-04-13 14:13:08,243 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 32 [2018-04-13 14:13:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,243 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-04-13 14:13:08,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 14:13:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-04-13 14:13:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 14:13:08,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,244 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-13 14:13:08,244 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,244 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-13 14:13:08,252 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,317 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-13 14:13:08,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-13 14:13:08,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,344 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-13 14:13:08,344 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-13 14:13:08,344 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-13 14:13:08,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 14:13:08,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 14:13:08,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 14:13:08,345 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2018-04-13 14:13:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,366 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-04-13 14:13:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 14:13:08,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-13 14:13:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,368 INFO L225 Difference]: With dead ends: 65 [2018-04-13 14:13:08,368 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 14:13:08,368 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-13 14:13:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 14:13:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-13 14:13:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 14:13:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-04-13 14:13:08,372 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 37 [2018-04-13 14:13:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,372 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-04-13 14:13:08,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 14:13:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-04-13 14:13:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 14:13:08,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,373 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:08,373 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,373 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-13 14:13:08,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,421 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-13 14:13:08,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 14:13:08,440 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,440 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-13 14:13:08,441 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-13 14:13:08,441 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-13 14:13:08,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 14:13:08,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 14:13:08,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-13 14:13:08,441 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2018-04-13 14:13:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,535 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2018-04-13 14:13:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 14:13:08,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-04-13 14:13:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,537 INFO L225 Difference]: With dead ends: 185 [2018-04-13 14:13:08,537 INFO L226 Difference]: Without dead ends: 185 [2018-04-13 14:13:08,537 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-13 14:13:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-13 14:13:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 70. [2018-04-13 14:13:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 14:13:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-04-13 14:13:08,541 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-04-13 14:13:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,542 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-04-13 14:13:08,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 14:13:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-04-13 14:13:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 14:13:08,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,542 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:08,543 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,543 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-13 14:13:08,550 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,601 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-13 14:13:08,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 14:13:08,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,627 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-13 14:13:08,627 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-13 14:13:08,627 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-13 14:13:08,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 14:13:08,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 14:13:08,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-13 14:13:08,627 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-04-13 14:13:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,745 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2018-04-13 14:13:08,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 14:13:08,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-04-13 14:13:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,746 INFO L225 Difference]: With dead ends: 213 [2018-04-13 14:13:08,746 INFO L226 Difference]: Without dead ends: 213 [2018-04-13 14:13:08,747 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-13 14:13:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-13 14:13:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 75. [2018-04-13 14:13:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 14:13:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-04-13 14:13:08,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 42 [2018-04-13 14:13:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,753 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-04-13 14:13:08,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 14:13:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-04-13 14:13:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 14:13:08,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,754 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-13 14:13:08,754 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,754 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-13 14:13:08,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,783 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-13 14:13:08,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 14:13:08,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,799 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-13 14:13:08,799 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-13 14:13:08,799 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-13 14:13:08,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 14:13:08,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 14:13:08,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-13 14:13:08,800 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 6 states. [2018-04-13 14:13:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:08,821 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-04-13 14:13:08,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 14:13:08,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-04-13 14:13:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:08,823 INFO L225 Difference]: With dead ends: 81 [2018-04-13 14:13:08,823 INFO L226 Difference]: Without dead ends: 81 [2018-04-13 14:13:08,823 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-13 14:13:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-13 14:13:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-13 14:13:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-13 14:13:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-04-13 14:13:08,827 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 47 [2018-04-13 14:13:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:08,827 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-04-13 14:13:08,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 14:13:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-04-13 14:13:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 14:13:08,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:08,828 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:08,828 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:08,829 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-13 14:13:08,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:08,875 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-13 14:13:08,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:08,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 14:13:08,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:08,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-13 14:13:08,893 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-13 14:13:08,893 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-13 14:13:08,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 14:13:08,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 14:13:08,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-13 14:13:08,893 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-04-13 14:13:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:09,020 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2018-04-13 14:13:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 14:13:09,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-13 14:13:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:09,022 INFO L225 Difference]: With dead ends: 289 [2018-04-13 14:13:09,022 INFO L226 Difference]: Without dead ends: 289 [2018-04-13 14:13:09,023 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-13 14:13:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-13 14:13:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 86. [2018-04-13 14:13:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 14:13:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-04-13 14:13:09,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 47 [2018-04-13 14:13:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:09,031 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-04-13 14:13:09,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 14:13:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-04-13 14:13:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 14:13:09,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:09,032 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:09,032 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:09,032 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-13 14:13:09,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,101 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-13 14:13:09,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:09,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 14:13:09,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13: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-13 14:13:09,118 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-13 14:13:09,118 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-13 14:13:09,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 14:13:09,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 14:13:09,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-13 14:13:09,119 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 12 states. [2018-04-13 14:13:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:09,284 INFO L93 Difference]: Finished difference Result 323 states and 367 transitions. [2018-04-13 14:13:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 14:13:09,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-04-13 14:13:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:09,287 INFO L225 Difference]: With dead ends: 323 [2018-04-13 14:13:09,288 INFO L226 Difference]: Without dead ends: 323 [2018-04-13 14:13:09,288 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-13 14:13:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-13 14:13:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 91. [2018-04-13 14:13:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-13 14:13:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-04-13 14:13:09,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 52 [2018-04-13 14:13:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:09,296 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-04-13 14:13:09,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 14:13:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-04-13 14:13:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 14:13:09,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:09,298 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-13 14:13:09,298 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:09,298 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-13 14:13:09,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,354 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-13 14:13:09,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:09,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 14:13:09,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:09,372 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-13 14:13:09,372 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-13 14:13:09,373 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-13 14:13:09,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 14:13:09,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 14:13:09,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 14:13:09,373 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2018-04-13 14:13:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:09,425 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-04-13 14:13:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 14:13:09,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-04-13 14:13:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:09,427 INFO L225 Difference]: With dead ends: 97 [2018-04-13 14:13:09,427 INFO L226 Difference]: Without dead ends: 97 [2018-04-13 14:13:09,427 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-13 14:13:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-13 14:13:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-04-13 14:13:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-13 14:13:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-04-13 14:13:09,431 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 57 [2018-04-13 14:13:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:09,431 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-04-13 14:13:09,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 14:13:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-04-13 14:13:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 14:13:09,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:09,432 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:09,432 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:09,433 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-13 14:13:09,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,534 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-13 14:13:09,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:09,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 14:13:09,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:09,563 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-13 14:13:09,563 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-13 14:13:09,563 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-13 14:13:09,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 14:13:09,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 14:13:09,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-13 14:13:09,564 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 13 states. [2018-04-13 14:13:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:09,850 INFO L93 Difference]: Finished difference Result 417 states and 476 transitions. [2018-04-13 14:13:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 14:13:09,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-13 14:13:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:09,852 INFO L225 Difference]: With dead ends: 417 [2018-04-13 14:13:09,852 INFO L226 Difference]: Without dead ends: 417 [2018-04-13 14:13:09,853 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-13 14:13:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-13 14:13:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 102. [2018-04-13 14:13:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-13 14:13:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-04-13 14:13:09,861 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 57 [2018-04-13 14:13:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:09,861 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-04-13 14:13:09,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 14:13:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-04-13 14:13:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 14:13:09,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:09,863 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-13 14:13:09,863 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:09,863 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-13 14:13:09,869 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:09,925 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-13 14:13:09,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:09,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 14:13:09,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:09,943 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-13 14:13:09,943 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-13 14:13:09,943 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-13 14:13:09,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 14:13:09,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 14:13:09,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-13 14:13:09,944 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 8 states. [2018-04-13 14:13:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:10,006 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-04-13 14:13:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 14:13:10,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-04-13 14:13:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:10,007 INFO L225 Difference]: With dead ends: 108 [2018-04-13 14:13:10,008 INFO L226 Difference]: Without dead ends: 108 [2018-04-13 14:13:10,008 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-13 14:13:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-13 14:13:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-13 14:13:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 14:13:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-04-13 14:13:10,011 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 67 [2018-04-13 14:13:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:10,011 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-04-13 14:13:10,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 14:13:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-04-13 14:13:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 14:13:10,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:10,012 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:10,012 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:10,013 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-13 14:13:10,017 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,107 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-13 14:13:10,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:10,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 14:13:10,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:10,126 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-13 14:13:10,126 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-13 14:13:10,126 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-13 14:13:10,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 14:13:10,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 14:13:10,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-13 14:13:10,127 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 14 states. [2018-04-13 14:13:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:10,362 INFO L93 Difference]: Finished difference Result 523 states and 599 transitions. [2018-04-13 14:13:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 14:13:10,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-13 14:13:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:10,380 INFO L225 Difference]: With dead ends: 523 [2018-04-13 14:13:10,380 INFO L226 Difference]: Without dead ends: 523 [2018-04-13 14:13:10,381 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-13 14:13:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-04-13 14:13:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 113. [2018-04-13 14:13:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 14:13:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-04-13 14:13:10,386 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 62 [2018-04-13 14:13:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:10,386 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-04-13 14:13:10,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 14:13:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-04-13 14:13:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 14:13:10,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:10,387 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:10,387 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:10,387 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-13 14:13:10,390 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,482 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-13 14:13:10,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:10,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 14:13:10,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:10,507 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-13 14:13:10,507 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-13 14:13:10,508 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-13 14:13:10,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 14:13:10,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 14:13:10,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-13 14:13:10,508 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 15 states. [2018-04-13 14:13:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:10,738 INFO L93 Difference]: Finished difference Result 569 states and 652 transitions. [2018-04-13 14:13:10,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 14:13:10,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-04-13 14:13:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:10,742 INFO L225 Difference]: With dead ends: 569 [2018-04-13 14:13:10,742 INFO L226 Difference]: Without dead ends: 569 [2018-04-13 14:13:10,743 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-13 14:13:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-13 14:13:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 118. [2018-04-13 14:13:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 14:13:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2018-04-13 14:13:10,750 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 67 [2018-04-13 14:13:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:10,751 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2018-04-13 14:13:10,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 14:13:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-04-13 14:13:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-13 14:13:10,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:10,752 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-13 14:13:10,752 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:10,752 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-13 14:13:10,755 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:10,816 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-13 14:13:10,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:10,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 14:13:10,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:10,848 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-13 14:13:10,848 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-13 14:13:10,848 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-13 14:13:10,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 14:13:10,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 14:13:10,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-13 14:13:10,849 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 9 states. [2018-04-13 14:13:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:10,931 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-04-13 14:13:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 14:13:10,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-04-13 14:13:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:10,933 INFO L225 Difference]: With dead ends: 124 [2018-04-13 14:13:10,933 INFO L226 Difference]: Without dead ends: 124 [2018-04-13 14:13:10,933 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-13 14:13:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-13 14:13:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-13 14:13:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-13 14:13:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-04-13 14:13:10,936 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 77 [2018-04-13 14:13:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:10,936 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-04-13 14:13:10,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 14:13:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-04-13 14:13:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 14:13:10,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:10,937 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:10,937 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:10,938 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-13 14:13:10,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,060 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-13 14:13:11,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:11,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 14:13:11,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:11,092 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-13 14:13:11,092 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-13 14:13:11,093 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-13 14:13:11,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 14:13:11,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 14:13:11,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-13 14:13:11,093 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 16 states. [2018-04-13 14:13:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:11,406 INFO L93 Difference]: Finished difference Result 693 states and 796 transitions. [2018-04-13 14:13:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 14:13:11,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-04-13 14:13:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:11,415 INFO L225 Difference]: With dead ends: 693 [2018-04-13 14:13:11,415 INFO L226 Difference]: Without dead ends: 693 [2018-04-13 14:13:11,415 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-13 14:13:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-13 14:13:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 129. [2018-04-13 14:13:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 14:13:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-04-13 14:13:11,423 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 72 [2018-04-13 14:13:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:11,424 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-04-13 14:13:11,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 14:13:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-04-13 14:13:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-13 14:13:11,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:11,425 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:11,425 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:11,425 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-13 14:13:11,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,524 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-13 14:13:11,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:11,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 14:13:11,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:11,541 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-13 14:13:11,541 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-13 14:13:11,541 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-13 14:13:11,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 14:13:11,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 14:13:11,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-04-13 14:13:11,542 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 17 states. [2018-04-13 14:13:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:11,849 INFO L93 Difference]: Finished difference Result 745 states and 856 transitions. [2018-04-13 14:13:11,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 14:13:11,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-04-13 14:13:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:11,852 INFO L225 Difference]: With dead ends: 745 [2018-04-13 14:13:11,852 INFO L226 Difference]: Without dead ends: 745 [2018-04-13 14:13:11,853 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-13 14:13:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-04-13 14:13:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 134. [2018-04-13 14:13:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 14:13:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-04-13 14:13:11,862 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 77 [2018-04-13 14:13:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:11,862 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-04-13 14:13:11,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 14:13:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-04-13 14:13:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-13 14:13:11,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:11,863 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-13 14:13:11,863 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:11,864 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-13 14:13:11,868 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:11,966 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-13 14:13:11,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:11,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 14:13:11,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:11,996 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-13 14:13:11,997 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-13 14:13:11,997 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-13 14:13:11,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 14:13:11,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 14:13:11,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-13 14:13:11,997 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 10 states. [2018-04-13 14:13:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:12,109 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-04-13 14:13:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 14:13:12,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-04-13 14:13:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:12,110 INFO L225 Difference]: With dead ends: 140 [2018-04-13 14:13:12,110 INFO L226 Difference]: Without dead ends: 140 [2018-04-13 14:13:12,110 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-13 14:13:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-13 14:13:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-04-13 14:13:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-13 14:13:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-04-13 14:13:12,113 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 87 [2018-04-13 14:13:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:12,114 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-04-13 14:13:12,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 14:13:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-04-13 14:13:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-13 14:13:12,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:12,115 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:12,115 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:12,115 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-13 14:13:12,118 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:12,266 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-13 14:13:12,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:12,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 14:13:12,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:12,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-13 14:13:12,295 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-13 14:13:12,295 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-13 14:13:12,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 14:13:12,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 14:13:12,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-13 14:13:12,296 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 18 states. [2018-04-13 14:13:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:12,733 INFO L93 Difference]: Finished difference Result 887 states and 1021 transitions. [2018-04-13 14:13:12,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 14:13:12,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-04-13 14:13:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:12,742 INFO L225 Difference]: With dead ends: 887 [2018-04-13 14:13:12,742 INFO L226 Difference]: Without dead ends: 887 [2018-04-13 14:13:12,742 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-13 14:13:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-04-13 14:13:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 145. [2018-04-13 14:13:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 14:13:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-04-13 14:13:12,751 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 82 [2018-04-13 14:13:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:12,751 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-04-13 14:13:12,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 14:13:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-04-13 14:13:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-13 14:13:12,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:12,752 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:12,752 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:12,752 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-13 14:13:12,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:12,892 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-13 14:13:12,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:12,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 14:13:12,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:12,911 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-13 14:13:12,911 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-13 14:13:12,911 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-13 14:13:12,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 14:13:12,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 14:13:12,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-13 14:13:12,912 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 19 states. [2018-04-13 14:13:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:13,289 INFO L93 Difference]: Finished difference Result 945 states and 1088 transitions. [2018-04-13 14:13:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 14:13:13,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-13 14:13:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:13,292 INFO L225 Difference]: With dead ends: 945 [2018-04-13 14:13:13,292 INFO L226 Difference]: Without dead ends: 945 [2018-04-13 14:13:13,292 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-13 14:13:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-04-13 14:13:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 150. [2018-04-13 14:13:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-13 14:13:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2018-04-13 14:13:13,300 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 87 [2018-04-13 14:13:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:13,300 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2018-04-13 14:13:13,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 14:13:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2018-04-13 14:13:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-13 14:13:13,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:13,301 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-13 14:13:13,301 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:13,301 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-13 14:13:13,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,355 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-13 14:13:13,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:13,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 14:13:13,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:13,372 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-13 14:13:13,372 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-13 14:13:13,372 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-13 14:13:13,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 14:13:13,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 14:13:13,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-13 14:13:13,372 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand 11 states. [2018-04-13 14:13:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:13,451 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-04-13 14:13:13,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 14:13:13,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-04-13 14:13:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:13,452 INFO L225 Difference]: With dead ends: 156 [2018-04-13 14:13:13,452 INFO L226 Difference]: Without dead ends: 156 [2018-04-13 14:13:13,452 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-13 14:13:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-13 14:13:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-04-13 14:13:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-13 14:13:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-04-13 14:13:13,455 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 97 [2018-04-13 14:13:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:13,455 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-04-13 14:13:13,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 14:13:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-04-13 14:13:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-13 14:13:13,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:13,457 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:13,457 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:13,457 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-13 14:13:13,464 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:13,591 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-13 14:13:13,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:13,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 14:13:13,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:13,609 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-13 14:13:13,609 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-13 14:13:13,609 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-13 14:13:13,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 14:13:13,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 14:13:13,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-13 14:13:13,610 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 20 states. [2018-04-13 14:13:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:14,028 INFO L93 Difference]: Finished difference Result 1105 states and 1274 transitions. [2018-04-13 14:13:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 14:13:14,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-04-13 14:13:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:14,032 INFO L225 Difference]: With dead ends: 1105 [2018-04-13 14:13:14,032 INFO L226 Difference]: Without dead ends: 1105 [2018-04-13 14:13:14,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-13 14:13:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-04-13 14:13:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 161. [2018-04-13 14:13:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 14:13:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-04-13 14:13:14,042 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 92 [2018-04-13 14:13:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:14,042 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-04-13 14:13:14,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 14:13:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-04-13 14:13:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-13 14:13:14,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:14,043 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:14,043 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:14,043 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-13 14:13:14,046 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,162 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-13 14:13:14,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:14,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 14:13:14,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:14,179 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-13 14:13:14,180 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-13 14:13:14,180 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-13 14:13:14,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 14:13:14,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 14:13:14,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-13 14:13:14,180 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 21 states. [2018-04-13 14:13:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:14,638 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2018-04-13 14:13:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 14:13:14,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-04-13 14:13:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:14,641 INFO L225 Difference]: With dead ends: 1169 [2018-04-13 14:13:14,641 INFO L226 Difference]: Without dead ends: 1169 [2018-04-13 14:13:14,641 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-13 14:13:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-04-13 14:13:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 166. [2018-04-13 14:13:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-13 14:13:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-04-13 14:13:14,652 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 97 [2018-04-13 14:13:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:14,652 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-04-13 14:13:14,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 14:13:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-04-13 14:13:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-13 14:13:14,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:14,653 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-13 14:13:14,653 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:14,653 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-13 14:13:14,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:14,745 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-13 14:13:14,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:14,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 14:13:14,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:14,763 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-13 14:13:14,763 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-13 14:13:14,763 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-13 14:13:14,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 14:13:14,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 14:13:14,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-13 14:13:14,764 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 12 states. [2018-04-13 14:13:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:14,872 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2018-04-13 14:13:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 14:13:14,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-04-13 14:13:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:14,873 INFO L225 Difference]: With dead ends: 172 [2018-04-13 14:13:14,873 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 14:13:14,873 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-13 14:13:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 14:13:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-04-13 14:13:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-13 14:13:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2018-04-13 14:13:14,876 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 107 [2018-04-13 14:13:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:14,876 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2018-04-13 14:13:14,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 14:13:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2018-04-13 14:13:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-13 14:13:14,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:14,876 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:14,876 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:14,876 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-13 14:13:14,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,017 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-13 14:13:15,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:15,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 14:13:15,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:15,035 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-13 14:13:15,035 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-13 14:13:15,035 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-13 14:13:15,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 14:13:15,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 14:13:15,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-13 14:13:15,036 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand 22 states. [2018-04-13 14:13:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:15,547 INFO L93 Difference]: Finished difference Result 1347 states and 1555 transitions. [2018-04-13 14:13:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 14:13:15,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-04-13 14:13:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:15,550 INFO L225 Difference]: With dead ends: 1347 [2018-04-13 14:13:15,550 INFO L226 Difference]: Without dead ends: 1347 [2018-04-13 14:13:15,551 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-13 14:13:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-04-13 14:13:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 177. [2018-04-13 14:13:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-13 14:13:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2018-04-13 14:13:15,561 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 102 [2018-04-13 14:13:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:15,562 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2018-04-13 14:13:15,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 14:13:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-04-13 14:13:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-13 14:13:15,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:15,563 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-13 14:13:15,563 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:15,563 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-13 14:13:15,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:15,698 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-13 14:13:15,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:15,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 14:13:15,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:15,715 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-13 14:13:15,715 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-13 14:13:15,715 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-13 14:13:15,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 14:13:15,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 14:13:15,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-13 14:13:15,715 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 13 states. [2018-04-13 14:13:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:15,871 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2018-04-13 14:13:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 14:13:15,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-04-13 14:13:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:15,873 INFO L225 Difference]: With dead ends: 183 [2018-04-13 14:13:15,873 INFO L226 Difference]: Without dead ends: 183 [2018-04-13 14:13:15,873 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-13 14:13:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-13 14:13:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-13 14:13:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-13 14:13:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2018-04-13 14:13:15,876 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 117 [2018-04-13 14:13:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:15,877 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2018-04-13 14:13:15,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 14:13:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2018-04-13 14:13:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-13 14:13:15,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:15,878 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:15,878 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:15,878 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-13 14:13:15,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:16,041 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-13 14:13:16,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:16,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 14:13:16,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:16,058 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-13 14:13:16,059 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-13 14:13:16,059 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-13 14:13:16,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 14:13:16,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 14:13:16,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-13 14:13:16,060 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 23 states. [2018-04-13 14:13:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:16,654 INFO L93 Difference]: Finished difference Result 1537 states and 1776 transitions. [2018-04-13 14:13:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 14:13:16,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2018-04-13 14:13:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:16,657 INFO L225 Difference]: With dead ends: 1537 [2018-04-13 14:13:16,657 INFO L226 Difference]: Without dead ends: 1537 [2018-04-13 14:13:16,658 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-13 14:13:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-04-13 14:13:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 188. [2018-04-13 14:13:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 14:13:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2018-04-13 14:13:16,664 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 107 [2018-04-13 14:13:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:16,664 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2018-04-13 14:13:16,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 14:13:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2018-04-13 14:13:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-13 14:13:16,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:16,664 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:16,664 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:16,664 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-13 14:13:16,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:16,913 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-13 14:13:16,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:16,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 14:13:16,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:16,968 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-13 14:13:16,969 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-13 14:13:16,969 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-13 14:13:16,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 14:13:16,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 14:13:16,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-13 14:13:16,970 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 24 states. [2018-04-13 14:13:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:17,587 INFO L93 Difference]: Finished difference Result 1613 states and 1864 transitions. [2018-04-13 14:13:17,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 14:13:17,587 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2018-04-13 14:13:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:17,590 INFO L225 Difference]: With dead ends: 1613 [2018-04-13 14:13:17,590 INFO L226 Difference]: Without dead ends: 1613 [2018-04-13 14:13:17,591 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-13 14:13:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-04-13 14:13:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 193. [2018-04-13 14:13:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 14:13:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-04-13 14:13:17,597 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 112 [2018-04-13 14:13:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:17,598 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-04-13 14:13:17,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 14:13:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-04-13 14:13:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-13 14:13:17,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:17,599 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-13 14:13:17,599 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:17,599 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-13 14:13:17,612 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:17,738 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-13 14:13:17,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:17,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 14:13:17,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:17,756 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-13 14:13:17,756 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-13 14:13:17,757 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-13 14:13:17,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 14:13:17,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 14:13:17,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-13 14:13:17,757 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 14 states. [2018-04-13 14:13:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:17,893 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2018-04-13 14:13:17,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 14:13:17,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-04-13 14:13:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:17,894 INFO L225 Difference]: With dead ends: 199 [2018-04-13 14:13:17,894 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 14:13:17,894 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-13 14:13:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 14:13:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-04-13 14:13:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-13 14:13:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-04-13 14:13:17,896 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 127 [2018-04-13 14:13:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:17,897 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-04-13 14:13:17,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 14:13:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-04-13 14:13:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-13 14:13:17,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:17,897 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:17,897 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:17,897 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-13 14:13:17,899 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:18,039 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-13 14:13:18,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:18,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 14:13:18,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:18,056 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-13 14:13:18,056 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-13 14:13:18,056 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-13 14:13:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 14:13:18,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 14:13:18,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-13 14:13:18,057 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 25 states. [2018-04-13 14:13:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:18,769 INFO L93 Difference]: Finished difference Result 1821 states and 2106 transitions. [2018-04-13 14:13:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 14:13:18,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-04-13 14:13:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:18,773 INFO L225 Difference]: With dead ends: 1821 [2018-04-13 14:13:18,773 INFO L226 Difference]: Without dead ends: 1821 [2018-04-13 14:13:18,773 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-13 14:13:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-04-13 14:13:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 204. [2018-04-13 14:13:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-13 14:13:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2018-04-13 14:13:18,783 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 117 [2018-04-13 14:13:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:18,784 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2018-04-13 14:13:18,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 14:13:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2018-04-13 14:13:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-13 14:13:18,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:18,785 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:18,785 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:18,785 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-13 14:13:18,796 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:18,991 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-13 14:13:19,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:19,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 14:13:19,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:19,011 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-13 14:13:19,011 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-13 14:13:19,011 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-13 14:13:19,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 14:13:19,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 14:13:19,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-13 14:13:19,012 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand 26 states. [2018-04-13 14:13:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:19,819 INFO L93 Difference]: Finished difference Result 1903 states and 2201 transitions. [2018-04-13 14:13:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 14:13:19,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-04-13 14:13:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:19,823 INFO L225 Difference]: With dead ends: 1903 [2018-04-13 14:13:19,823 INFO L226 Difference]: Without dead ends: 1903 [2018-04-13 14:13:19,823 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-13 14:13:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-04-13 14:13:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 209. [2018-04-13 14:13:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 14:13:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2018-04-13 14:13:19,830 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 122 [2018-04-13 14:13:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:19,831 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2018-04-13 14:13:19,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 14:13:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2018-04-13 14:13:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-13 14:13:19,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:19,832 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-13 14:13:19,832 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:19,832 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-13 14:13:19,839 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:19,922 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-13 14:13:19,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:19,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 14:13:19,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:19,938 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-13 14:13:19,939 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-13 14:13:19,939 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-13 14:13:19,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 14:13:19,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 14:13:19,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-13 14:13:19,939 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand 15 states. [2018-04-13 14:13:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:20,117 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-04-13 14:13:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 14:13:20,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-04-13 14:13:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:20,117 INFO L225 Difference]: With dead ends: 215 [2018-04-13 14:13:20,117 INFO L226 Difference]: Without dead ends: 215 [2018-04-13 14:13:20,118 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-13 14:13:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-13 14:13:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-04-13 14:13:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-13 14:13:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 250 transitions. [2018-04-13 14:13:20,119 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 250 transitions. Word has length 137 [2018-04-13 14:13:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:20,120 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 250 transitions. [2018-04-13 14:13:20,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 14:13:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 250 transitions. [2018-04-13 14:13:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-13 14:13:20,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:20,121 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:20,121 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:20,121 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-13 14:13:20,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:20,283 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-13 14:13:20,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:20,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 14:13:20,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:20,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-13 14:13:20,300 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-13 14:13:20,301 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-13 14:13:20,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 14:13:20,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 14:13:20,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-13 14:13:20,301 INFO L87 Difference]: Start difference. First operand 215 states and 250 transitions. Second operand 27 states. [2018-04-13 14:13:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:21,137 INFO L93 Difference]: Finished difference Result 2129 states and 2464 transitions. [2018-04-13 14:13:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 14:13:21,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2018-04-13 14:13:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:21,142 INFO L225 Difference]: With dead ends: 2129 [2018-04-13 14:13:21,142 INFO L226 Difference]: Without dead ends: 2129 [2018-04-13 14:13:21,142 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-13 14:13:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-04-13 14:13:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 220. [2018-04-13 14:13:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 14:13:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2018-04-13 14:13:21,152 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 127 [2018-04-13 14:13:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:21,152 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2018-04-13 14:13:21,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 14:13:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2018-04-13 14:13:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-13 14:13:21,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:21,154 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:21,154 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:21,154 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-13 14:13:21,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:21,345 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-13 14:13:21,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:21,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 14:13:21,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:21,362 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-13 14:13:21,362 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-13 14:13:21,362 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-13 14:13:21,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 14:13:21,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 14:13:21,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-13 14:13:21,363 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 28 states. [2018-04-13 14:13:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:22,247 INFO L93 Difference]: Finished difference Result 2217 states and 2566 transitions. [2018-04-13 14:13:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 14:13:22,283 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 132 [2018-04-13 14:13:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:22,287 INFO L225 Difference]: With dead ends: 2217 [2018-04-13 14:13:22,287 INFO L226 Difference]: Without dead ends: 2217 [2018-04-13 14:13:22,287 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-13 14:13:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-04-13 14:13:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 225. [2018-04-13 14:13:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 14:13:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-04-13 14:13:22,295 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 132 [2018-04-13 14:13:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:22,296 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-04-13 14:13:22,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 14:13:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-04-13 14:13:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-13 14:13:22,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:22,297 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-13 14:13:22,297 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:22,297 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-13 14:13:22,300 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,401 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-13 14:13:22,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:22,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 14:13:22,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:22,419 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-13 14:13:22,419 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-13 14:13:22,419 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-13 14:13:22,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 14:13:22,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 14:13:22,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-13 14:13:22,419 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-04-13 14:13:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:22,601 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2018-04-13 14:13:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 14:13:22,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2018-04-13 14:13:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:22,602 INFO L225 Difference]: With dead ends: 231 [2018-04-13 14:13:22,602 INFO L226 Difference]: Without dead ends: 231 [2018-04-13 14:13:22,603 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-13 14:13:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-13 14:13:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-04-13 14:13:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-13 14:13:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-04-13 14:13:22,604 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 147 [2018-04-13 14:13:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:22,605 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-04-13 14:13:22,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 14:13:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-04-13 14:13:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-13 14:13:22,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:22,605 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:22,606 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:22,606 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-13 14:13:22,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:22,807 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-13 14:13:22,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:22,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 14:13:22,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:13:22,824 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-13 14:13:22,825 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-13 14:13:22,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 14:13:22,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 14:13:22,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-04-13 14:13:22,825 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 29 states. [2018-04-13 14:13:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:23,768 INFO L93 Difference]: Finished difference Result 2461 states and 2850 transitions. [2018-04-13 14:13:23,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 14:13:23,769 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 137 [2018-04-13 14:13:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:23,773 INFO L225 Difference]: With dead ends: 2461 [2018-04-13 14:13:23,773 INFO L226 Difference]: Without dead ends: 2461 [2018-04-13 14:13:23,773 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-13 14:13:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2018-04-13 14:13:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 236. [2018-04-13 14:13:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-13 14:13:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-13 14:13:23,782 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 137 [2018-04-13 14:13:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:23,783 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-13 14:13:23,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 14:13:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-13 14:13:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-13 14:13:23,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:23,784 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:23,784 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:23,784 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-13 14:13:23,787 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:24,006 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-13 14:13:24,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:24,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 14:13:24,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:24,023 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-13 14:13:24,023 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-13 14:13:24,023 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-13 14:13:24,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 14:13:24,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 14:13:24,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-04-13 14:13:24,024 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 30 states. [2018-04-13 14:13:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:25,036 INFO L93 Difference]: Finished difference Result 2555 states and 2959 transitions. [2018-04-13 14:13:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 14:13:25,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 142 [2018-04-13 14:13:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:25,042 INFO L225 Difference]: With dead ends: 2555 [2018-04-13 14:13:25,042 INFO L226 Difference]: Without dead ends: 2555 [2018-04-13 14:13:25,042 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-13 14:13:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-04-13 14:13:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 241. [2018-04-13 14:13:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-13 14:13:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2018-04-13 14:13:25,052 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 142 [2018-04-13 14:13:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:25,053 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2018-04-13 14:13:25,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 14:13:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2018-04-13 14:13:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-13 14:13:25,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:25,053 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-13 14:13:25,053 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:25,053 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-13 14:13:25,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,157 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-13 14:13:25,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:25,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 14:13:25,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:25,175 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-13 14:13:25,175 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-13 14:13:25,175 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-13 14:13:25,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 14:13:25,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 14:13:25,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-04-13 14:13:25,175 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand 17 states. [2018-04-13 14:13:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:25,406 INFO L93 Difference]: Finished difference Result 247 states and 288 transitions. [2018-04-13 14:13:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 14:13:25,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2018-04-13 14:13:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:25,407 INFO L225 Difference]: With dead ends: 247 [2018-04-13 14:13:25,407 INFO L226 Difference]: Without dead ends: 247 [2018-04-13 14:13:25,408 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-13 14:13:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-13 14:13:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-04-13 14:13:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-13 14:13:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 288 transitions. [2018-04-13 14:13:25,411 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 288 transitions. Word has length 157 [2018-04-13 14:13:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:25,411 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 288 transitions. [2018-04-13 14:13:25,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 14:13:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 288 transitions. [2018-04-13 14:13:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-13 14:13:25,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:25,412 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:25,412 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:25,412 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-13 14:13:25,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:25,652 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-13 14:13:25,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:25,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 14:13:25,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:25,669 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-13 14:13:25,669 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-13 14:13:25,669 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-13 14:13:25,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 14:13:25,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 14:13:25,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-13 14:13:25,670 INFO L87 Difference]: Start difference. First operand 247 states and 288 transitions. Second operand 31 states. [2018-04-13 14:13:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:26,786 INFO L93 Difference]: Finished difference Result 2817 states and 3264 transitions. [2018-04-13 14:13:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 14:13:26,786 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-04-13 14:13:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:26,790 INFO L225 Difference]: With dead ends: 2817 [2018-04-13 14:13:26,791 INFO L226 Difference]: Without dead ends: 2817 [2018-04-13 14:13:26,791 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-13 14:13:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-04-13 14:13:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 252. [2018-04-13 14:13:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-13 14:13:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 294 transitions. [2018-04-13 14:13:26,802 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 294 transitions. Word has length 147 [2018-04-13 14:13:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:26,803 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 294 transitions. [2018-04-13 14:13:26,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 14:13:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 294 transitions. [2018-04-13 14:13:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-13 14:13:26,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:26,804 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-13 14:13:26,804 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:26,804 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-13 14:13:26,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:26,933 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-13 14:13:26,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:26,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 14:13:26,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:26,950 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-13 14:13:26,951 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-13 14:13:26,951 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-13 14:13:26,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 14:13:26,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 14:13:26,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-13 14:13:26,951 INFO L87 Difference]: Start difference. First operand 252 states and 294 transitions. Second operand 18 states. [2018-04-13 14:13:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:27,203 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2018-04-13 14:13:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 14:13:27,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2018-04-13 14:13:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:27,204 INFO L225 Difference]: With dead ends: 258 [2018-04-13 14:13:27,204 INFO L226 Difference]: Without dead ends: 258 [2018-04-13 14:13:27,204 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-13 14:13:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-13 14:13:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-13 14:13:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 14:13:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 301 transitions. [2018-04-13 14:13:27,207 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 301 transitions. Word has length 167 [2018-04-13 14:13:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:27,207 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 301 transitions. [2018-04-13 14:13:27,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 14:13:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 301 transitions. [2018-04-13 14:13:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-13 14:13:27,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:27,208 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:27,208 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:27,208 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-13 14:13:27,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:27,448 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-13 14:13:27,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:27,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 14:13:27,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:27,542 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-13 14:13:27,542 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-13 14:13:27,543 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-13 14:13:27,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 14:13:27,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 14:13:27,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-13 14:13:27,543 INFO L87 Difference]: Start difference. First operand 258 states and 301 transitions. Second operand 32 states. [2018-04-13 14:13:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:28,797 INFO L93 Difference]: Finished difference Result 3091 states and 3583 transitions. [2018-04-13 14:13:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 14:13:28,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 152 [2018-04-13 14:13:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:28,803 INFO L225 Difference]: With dead ends: 3091 [2018-04-13 14:13:28,803 INFO L226 Difference]: Without dead ends: 3091 [2018-04-13 14:13:28,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 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-13 14:13:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2018-04-13 14:13:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 263. [2018-04-13 14:13:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-13 14:13:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 307 transitions. [2018-04-13 14:13:28,816 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 307 transitions. Word has length 152 [2018-04-13 14:13:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:28,816 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 307 transitions. [2018-04-13 14:13:28,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 14:13:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 307 transitions. [2018-04-13 14:13:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-13 14:13:28,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:28,817 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:28,817 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:28,817 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-13 14:13:28,821 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:29,150 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-13 14:13:29,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:29,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 14:13:29,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:29,169 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-13 14:13:29,169 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-13 14:13:29,169 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-13 14:13:29,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 14:13:29,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 14:13:29,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 14:13:29,170 INFO L87 Difference]: Start difference. First operand 263 states and 307 transitions. Second operand 33 states. [2018-04-13 14:13:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:30,514 INFO L93 Difference]: Finished difference Result 3197 states and 3706 transitions. [2018-04-13 14:13:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 14:13:30,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2018-04-13 14:13:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:30,519 INFO L225 Difference]: With dead ends: 3197 [2018-04-13 14:13:30,520 INFO L226 Difference]: Without dead ends: 3197 [2018-04-13 14:13:30,520 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-13 14:13:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-04-13 14:13:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 268. [2018-04-13 14:13:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-13 14:13:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 313 transitions. [2018-04-13 14:13:30,542 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 313 transitions. Word has length 157 [2018-04-13 14:13:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:30,542 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 313 transitions. [2018-04-13 14:13:30,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 14:13:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 313 transitions. [2018-04-13 14:13:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-13 14:13:30,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:30,544 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-13 14:13:30,544 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:30,544 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-13 14:13:30,547 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:30,713 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-13 14:13:30,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:30,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 14:13:30,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:30,739 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-13 14:13:30,739 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-13 14:13:30,739 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-13 14:13:30,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 14:13:30,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 14:13:30,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-13 14:13:30,740 INFO L87 Difference]: Start difference. First operand 268 states and 313 transitions. Second operand 19 states. [2018-04-13 14:13:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:31,036 INFO L93 Difference]: Finished difference Result 274 states and 320 transitions. [2018-04-13 14:13:31,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 14:13:31,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 177 [2018-04-13 14:13:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:31,037 INFO L225 Difference]: With dead ends: 274 [2018-04-13 14:13:31,037 INFO L226 Difference]: Without dead ends: 274 [2018-04-13 14:13:31,037 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-13 14:13:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-13 14:13:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-04-13 14:13:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-13 14:13:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 320 transitions. [2018-04-13 14:13:31,039 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 320 transitions. Word has length 177 [2018-04-13 14:13:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:31,040 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 320 transitions. [2018-04-13 14:13:31,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 14:13:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 320 transitions. [2018-04-13 14:13:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-13 14:13:31,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:31,041 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:31,041 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:31,041 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-13 14:13:31,044 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:31,409 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-13 14:13:31,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:31,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 14:13:31,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:31,429 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-13 14:13:31,429 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-13 14:13:31,429 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-13 14:13:31,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 14:13:31,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 14:13:31,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 14:13:31,430 INFO L87 Difference]: Start difference. First operand 274 states and 320 transitions. Second operand 34 states. [2018-04-13 14:13:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:32,750 INFO L93 Difference]: Finished difference Result 3489 states and 4046 transitions. [2018-04-13 14:13:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 14:13:32,751 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2018-04-13 14:13:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:32,757 INFO L225 Difference]: With dead ends: 3489 [2018-04-13 14:13:32,758 INFO L226 Difference]: Without dead ends: 3489 [2018-04-13 14:13:32,758 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-13 14:13:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2018-04-13 14:13:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 279. [2018-04-13 14:13:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-13 14:13:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 326 transitions. [2018-04-13 14:13:32,780 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 326 transitions. Word has length 162 [2018-04-13 14:13:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:32,780 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 326 transitions. [2018-04-13 14:13:32,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 14:13:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 326 transitions. [2018-04-13 14:13:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-13 14:13:32,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:32,781 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:32,781 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:32,782 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-13 14:13:32,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:33,139 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-13 14:13:33,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:33,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 14:13:33,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:33,155 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-13 14:13:33,156 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-13 14:13:33,156 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-13 14:13:33,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 14:13:33,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 14:13:33,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 14:13:33,156 INFO L87 Difference]: Start difference. First operand 279 states and 326 transitions. Second operand 35 states. [2018-04-13 14:13:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:34,542 INFO L93 Difference]: Finished difference Result 3601 states and 4176 transitions. [2018-04-13 14:13:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 14:13:34,543 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-13 14:13:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:34,547 INFO L225 Difference]: With dead ends: 3601 [2018-04-13 14:13:34,547 INFO L226 Difference]: Without dead ends: 3601 [2018-04-13 14:13:34,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 14:13:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2018-04-13 14:13:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 284. [2018-04-13 14:13:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-13 14:13:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2018-04-13 14:13:34,559 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 167 [2018-04-13 14:13:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:34,560 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2018-04-13 14:13:34,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 14:13:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2018-04-13 14:13:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-13 14:13:34,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:34,561 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-13 14:13:34,561 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:34,561 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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:13:34,564 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:34,761 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-13 14:13:34,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:34,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 14:13:34,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:34,778 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-13 14:13:34,778 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-13 14:13:34,778 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-13 14:13:34,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 14:13:34,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 14:13:34,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-13 14:13:34,779 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand 20 states. [2018-04-13 14:13:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:35,091 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-04-13 14:13:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 14:13:35,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 187 [2018-04-13 14:13:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:35,091 INFO L225 Difference]: With dead ends: 290 [2018-04-13 14:13:35,091 INFO L226 Difference]: Without dead ends: 290 [2018-04-13 14:13:35,092 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-13 14:13:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-13 14:13:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-04-13 14:13:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-13 14:13:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2018-04-13 14:13:35,093 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 187 [2018-04-13 14:13:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:35,094 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2018-04-13 14:13:35,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 14:13:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2018-04-13 14:13:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 14:13:35,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:35,094 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:35,094 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:35,094 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-13 14:13:35,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:35,540 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-13 14:13:35,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:35,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 14:13:35,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:35,558 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-13 14:13:35,558 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-13 14:13:35,558 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-13 14:13:35,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 14:13:35,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 14:13:35,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 14:13:35,559 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand 36 states. [2018-04-13 14:13:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:37,140 INFO L93 Difference]: Finished difference Result 3911 states and 4537 transitions. [2018-04-13 14:13:37,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 14:13:37,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 172 [2018-04-13 14:13:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:37,145 INFO L225 Difference]: With dead ends: 3911 [2018-04-13 14:13:37,145 INFO L226 Difference]: Without dead ends: 3911 [2018-04-13 14:13:37,145 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-13 14:13:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2018-04-13 14:13:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 295. [2018-04-13 14:13:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-13 14:13:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2018-04-13 14:13:37,160 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 172 [2018-04-13 14:13:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:37,160 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2018-04-13 14:13:37,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 14:13:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2018-04-13 14:13:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-13 14:13:37,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:37,161 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:37,161 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:37,161 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-13 14:13:37,163 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:37,519 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-13 14:13:37,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:37,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 14:13:37,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:37,536 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-13 14:13:37,536 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-13 14:13:37,536 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-13 14:13:37,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 14:13:37,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 14:13:37,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 14:13:37,536 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand 37 states. [2018-04-13 14:13:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:39,125 INFO L93 Difference]: Finished difference Result 4029 states and 4674 transitions. [2018-04-13 14:13:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 14:13:39,126 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 177 [2018-04-13 14:13:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:39,131 INFO L225 Difference]: With dead ends: 4029 [2018-04-13 14:13:39,131 INFO L226 Difference]: Without dead ends: 4029 [2018-04-13 14:13:39,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 14:13:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2018-04-13 14:13:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 300. [2018-04-13 14:13:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-13 14:13:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 351 transitions. [2018-04-13 14:13:39,157 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 351 transitions. Word has length 177 [2018-04-13 14:13:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:39,157 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 351 transitions. [2018-04-13 14:13:39,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 14:13:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 351 transitions. [2018-04-13 14:13:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-13 14:13:39,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:39,158 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-13 14:13:39,158 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:39,158 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-13 14:13:39,168 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:39,384 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-13 14:13:39,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:39,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 14:13:39,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:39,411 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-13 14:13:39,411 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-13 14:13:39,411 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-13 14:13:39,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 14:13:39,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 14:13:39,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-13 14:13:39,412 INFO L87 Difference]: Start difference. First operand 300 states and 351 transitions. Second operand 21 states. [2018-04-13 14:13:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:39,762 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2018-04-13 14:13:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 14:13:39,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 197 [2018-04-13 14:13:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:39,763 INFO L225 Difference]: With dead ends: 306 [2018-04-13 14:13:39,763 INFO L226 Difference]: Without dead ends: 306 [2018-04-13 14:13:39,763 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-13 14:13:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-13 14:13:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-04-13 14:13:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-13 14:13:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2018-04-13 14:13:39,765 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 197 [2018-04-13 14:13:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:39,766 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2018-04-13 14:13:39,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 14:13:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2018-04-13 14:13:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-13 14:13:39,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:39,767 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:39,767 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:39,767 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-13 14:13:39,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:40,098 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-13 14:13:40,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:40,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 14:13:40,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:40,115 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-13 14:13:40,115 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-13 14:13:40,116 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-13 14:13:40,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 14:13:40,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 14:13:40,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 14:13:40,116 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand 38 states. [2018-04-13 14:13:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:41,804 INFO L93 Difference]: Finished difference Result 4357 states and 5056 transitions. [2018-04-13 14:13:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 14:13:41,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 182 [2018-04-13 14:13:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:41,808 INFO L225 Difference]: With dead ends: 4357 [2018-04-13 14:13:41,808 INFO L226 Difference]: Without dead ends: 4357 [2018-04-13 14:13:41,808 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-13 14:13:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2018-04-13 14:13:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 311. [2018-04-13 14:13:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-13 14:13:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 364 transitions. [2018-04-13 14:13:41,824 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 364 transitions. Word has length 182 [2018-04-13 14:13:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:41,824 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 364 transitions. [2018-04-13 14:13:41,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 14:13:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 364 transitions. [2018-04-13 14:13:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-13 14:13:41,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:41,825 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:41,825 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:41,825 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-13 14:13:41,828 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:42,183 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-13 14:13:42,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:42,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 14:13:42,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:42,200 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-13 14:13:42,200 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-13 14:13:42,200 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-13 14:13:42,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 14:13:42,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 14:13:42,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 14:13:42,201 INFO L87 Difference]: Start difference. First operand 311 states and 364 transitions. Second operand 39 states. [2018-04-13 14:13:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:43,999 INFO L93 Difference]: Finished difference Result 4481 states and 5200 transitions. [2018-04-13 14:13:43,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 14:13:43,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 187 [2018-04-13 14:13:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:44,003 INFO L225 Difference]: With dead ends: 4481 [2018-04-13 14:13:44,003 INFO L226 Difference]: Without dead ends: 4481 [2018-04-13 14:13:44,003 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-13 14:13:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2018-04-13 14:13:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 316. [2018-04-13 14:13:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-13 14:13:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 370 transitions. [2018-04-13 14:13:44,025 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 370 transitions. Word has length 187 [2018-04-13 14:13:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:44,025 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 370 transitions. [2018-04-13 14:13:44,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 14:13:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 370 transitions. [2018-04-13 14:13:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-13 14:13:44,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:44,027 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-13 14:13:44,027 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:44,027 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-13 14:13:44,032 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:44,239 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-13 14:13:44,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:44,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 14:13:44,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:44,257 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-13 14:13:44,257 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-13 14:13:44,257 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-13 14:13:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 14:13:44,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 14:13:44,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-13 14:13:44,258 INFO L87 Difference]: Start difference. First operand 316 states and 370 transitions. Second operand 22 states. [2018-04-13 14:13:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:44,760 INFO L93 Difference]: Finished difference Result 322 states and 377 transitions. [2018-04-13 14:13:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 14:13:44,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 207 [2018-04-13 14:13:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:44,761 INFO L225 Difference]: With dead ends: 322 [2018-04-13 14:13:44,761 INFO L226 Difference]: Without dead ends: 322 [2018-04-13 14:13:44,762 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-13 14:13:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-13 14:13:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-04-13 14:13:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-04-13 14:13:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 377 transitions. [2018-04-13 14:13:44,765 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 377 transitions. Word has length 207 [2018-04-13 14:13:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:44,765 INFO L459 AbstractCegarLoop]: Abstraction has 322 states and 377 transitions. [2018-04-13 14:13:44,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 14:13:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 377 transitions. [2018-04-13 14:13:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-13 14:13:44,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:44,767 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:44,767 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:44,767 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) [2018-04-13 14:13:44,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:13:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:45,256 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-13 14:13:45,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:45,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 14:13:45,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:45,274 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-13 14:13:45,274 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-13 14:13:45,275 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-13 14:13:45,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 14:13:45,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 14:13:45,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 14:13:45,275 INFO L87 Difference]: Start difference. First operand 322 states and 377 transitions. Second operand 40 states. [2018-04-13 14:13:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:47,188 INFO L93 Difference]: Finished difference Result 4827 states and 5603 transitions. [2018-04-13 14:13:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 14:13:47,188 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2018-04-13 14:13:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:47,192 INFO L225 Difference]: With dead ends: 4827 [2018-04-13 14:13:47,192 INFO L226 Difference]: Without dead ends: 4827 [2018-04-13 14:13:47,192 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-13 14:13:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2018-04-13 14:13:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 327. [2018-04-13 14:13:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-13 14:13:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 383 transitions. [2018-04-13 14:13:47,209 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 383 transitions. Word has length 192 [2018-04-13 14:13:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:47,209 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 383 transitions. [2018-04-13 14:13:47,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 14:13:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 383 transitions. [2018-04-13 14:13:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-13 14:13:47,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:47,210 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-13 14:13:47,210 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:47,210 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-13 14:13:47,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:47,361 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-13 14:13:47,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:47,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 14:13:47,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:47,379 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-13 14:13:47,379 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-13 14:13:47,379 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-13 14:13:47,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 14:13:47,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 14:13:47,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-13 14:13:47,379 INFO L87 Difference]: Start difference. First operand 327 states and 383 transitions. Second operand 23 states. [2018-04-13 14:13:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:47,810 INFO L93 Difference]: Finished difference Result 333 states and 390 transitions. [2018-04-13 14:13:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 14:13:47,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 217 [2018-04-13 14:13:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:47,810 INFO L225 Difference]: With dead ends: 333 [2018-04-13 14:13:47,810 INFO L226 Difference]: Without dead ends: 333 [2018-04-13 14:13:47,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-13 14:13:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-13 14:13:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-13 14:13:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-13 14:13:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 390 transitions. [2018-04-13 14:13:47,812 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 390 transitions. Word has length 217 [2018-04-13 14:13:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:47,813 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 390 transitions. [2018-04-13 14:13:47,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 14:13:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 390 transitions. [2018-04-13 14:13:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-13 14:13:47,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:47,813 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:47,813 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:47,813 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-13 14:13:47,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:48,213 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-13 14:13:48,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:48,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 14:13:48,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:48,230 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-13 14:13:48,230 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-13 14:13:48,230 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-13 14:13:48,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 14:13:48,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 14:13:48,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 14:13:48,231 INFO L87 Difference]: Start difference. First operand 333 states and 390 transitions. Second operand 41 states. [2018-04-13 14:13:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:50,188 INFO L93 Difference]: Finished difference Result 5185 states and 6020 transitions. [2018-04-13 14:13:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 14:13:50,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 197 [2018-04-13 14:13:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:50,193 INFO L225 Difference]: With dead ends: 5185 [2018-04-13 14:13:50,193 INFO L226 Difference]: Without dead ends: 5185 [2018-04-13 14:13:50,193 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-13 14:13:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2018-04-13 14:13:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 338. [2018-04-13 14:13:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-13 14:13:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 396 transitions. [2018-04-13 14:13:50,212 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 396 transitions. Word has length 197 [2018-04-13 14:13:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:50,212 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 396 transitions. [2018-04-13 14:13:50,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 14:13:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 396 transitions. [2018-04-13 14:13:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-13 14:13:50,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:50,213 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:50,213 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:50,213 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-13 14:13:50,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:50,692 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-13 14:13:50,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:50,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 14:13:50,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:50,721 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-13 14:13:50,722 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-13 14:13:50,722 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-13 14:13:50,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 14:13:50,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 14:13:50,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 14:13:50,722 INFO L87 Difference]: Start difference. First operand 338 states and 396 transitions. Second operand 42 states. [2018-04-13 14:13:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:52,904 INFO L93 Difference]: Finished difference Result 5321 states and 6178 transitions. [2018-04-13 14:13:52,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 14:13:52,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-04-13 14:13:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:52,909 INFO L225 Difference]: With dead ends: 5321 [2018-04-13 14:13:52,909 INFO L226 Difference]: Without dead ends: 5321 [2018-04-13 14:13:52,909 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-13 14:13:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2018-04-13 14:13:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 343. [2018-04-13 14:13:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-13 14:13:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 402 transitions. [2018-04-13 14:13:52,928 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 402 transitions. Word has length 202 [2018-04-13 14:13:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:52,928 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 402 transitions. [2018-04-13 14:13:52,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 14:13:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 402 transitions. [2018-04-13 14:13:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-13 14:13:52,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:52,929 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-13 14:13:52,929 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:52,929 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-13 14:13:52,932 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:53,105 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-13 14:13:53,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:53,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 14:13:53,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:53,122 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-13 14:13:53,123 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-13 14:13:53,123 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-13 14:13:53,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 14:13:53,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 14:13:53,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-13 14:13:53,123 INFO L87 Difference]: Start difference. First operand 343 states and 402 transitions. Second operand 24 states. [2018-04-13 14:13:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:53,612 INFO L93 Difference]: Finished difference Result 349 states and 409 transitions. [2018-04-13 14:13:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 14:13:53,612 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 227 [2018-04-13 14:13:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:53,613 INFO L225 Difference]: With dead ends: 349 [2018-04-13 14:13:53,613 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 14:13:53,613 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-13 14:13:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 14:13:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-04-13 14:13:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-13 14:13:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 409 transitions. [2018-04-13 14:13:53,616 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 409 transitions. Word has length 227 [2018-04-13 14:13:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:53,617 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 409 transitions. [2018-04-13 14:13:53,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 14:13:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 409 transitions. [2018-04-13 14:13:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-13 14:13:53,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:53,618 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:53,618 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:53,618 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-13 14:13:53,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:54,076 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-13 14:13:54,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:54,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 14:13:54,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:54,094 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-13 14:13:54,094 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-13 14:13:54,094 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-13 14:13:54,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 14:13:54,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 14:13:54,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 14:13:54,094 INFO L87 Difference]: Start difference. First operand 349 states and 409 transitions. Second operand 43 states. [2018-04-13 14:13:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:56,290 INFO L93 Difference]: Finished difference Result 5697 states and 6616 transitions. [2018-04-13 14:13:56,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 14:13:56,290 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 207 [2018-04-13 14:13:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:56,295 INFO L225 Difference]: With dead ends: 5697 [2018-04-13 14:13:56,295 INFO L226 Difference]: Without dead ends: 5697 [2018-04-13 14:13:56,295 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-13 14:13:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2018-04-13 14:13:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 354. [2018-04-13 14:13:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-13 14:13:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 415 transitions. [2018-04-13 14:13:56,316 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 415 transitions. Word has length 207 [2018-04-13 14:13:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:56,316 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 415 transitions. [2018-04-13 14:13:56,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 14:13:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 415 transitions. [2018-04-13 14:13:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-13 14:13:56,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:56,317 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:56,317 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:56,318 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-13 14:13:56,320 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:56,891 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-13 14:13:56,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:56,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 14:13:56,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:56,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-13 14:13:56,909 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-13 14:13:56,909 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-13 14:13:56,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 14:13:56,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 14:13:56,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 14:13:56,910 INFO L87 Difference]: Start difference. First operand 354 states and 415 transitions. Second operand 44 states. [2018-04-13 14:13:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:59,166 INFO L93 Difference]: Finished difference Result 5839 states and 6781 transitions. [2018-04-13 14:13:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 14:13:59,166 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-04-13 14:13:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:59,171 INFO L225 Difference]: With dead ends: 5839 [2018-04-13 14:13:59,171 INFO L226 Difference]: Without dead ends: 5839 [2018-04-13 14:13:59,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 14:13:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2018-04-13 14:13:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 359. [2018-04-13 14:13:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-13 14:13:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2018-04-13 14:13:59,191 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 212 [2018-04-13 14:13:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:59,191 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2018-04-13 14:13:59,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 14:13:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2018-04-13 14:13:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-13 14:13:59,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:59,192 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-13 14:13:59,192 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:59,192 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-13 14:13:59,195 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:13:59,369 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-13 14:13:59,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:13:59,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 14:13:59,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:13:59,385 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-13 14:13:59,385 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-13 14:13:59,385 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-13 14:13:59,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 14:13:59,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 14:13:59,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-13 14:13:59,386 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand 25 states. [2018-04-13 14:13:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:13:59,870 INFO L93 Difference]: Finished difference Result 365 states and 428 transitions. [2018-04-13 14:13:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 14:13:59,870 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 237 [2018-04-13 14:13:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:13:59,870 INFO L225 Difference]: With dead ends: 365 [2018-04-13 14:13:59,870 INFO L226 Difference]: Without dead ends: 365 [2018-04-13 14:13:59,870 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-13 14:13:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-13 14:13:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-04-13 14:13:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-13 14:13:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 428 transitions. [2018-04-13 14:13:59,872 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 428 transitions. Word has length 237 [2018-04-13 14:13:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:13:59,872 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 428 transitions. [2018-04-13 14:13:59,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 14:13:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 428 transitions. [2018-04-13 14:13:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-13 14:13:59,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:13:59,873 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-13 14:13:59,873 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:13:59,873 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-13 14:13:59,875 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:13:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:00,334 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-13 14:14:00,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:00,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 14:14:00,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:00,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-13 14:14:00,351 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-13 14:14:00,352 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-13 14:14:00,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 14:14:00,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 14:14:00,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 14:14:00,352 INFO L87 Difference]: Start difference. First operand 365 states and 428 transitions. Second operand 45 states. [2018-04-13 14:14:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:03,029 INFO L93 Difference]: Finished difference Result 6233 states and 7240 transitions. [2018-04-13 14:14:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 14:14:03,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 217 [2018-04-13 14:14:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:03,034 INFO L225 Difference]: With dead ends: 6233 [2018-04-13 14:14:03,034 INFO L226 Difference]: Without dead ends: 6233 [2018-04-13 14:14:03,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 14:14:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2018-04-13 14:14:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 370. [2018-04-13 14:14:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-13 14:14:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 434 transitions. [2018-04-13 14:14:03,057 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 434 transitions. Word has length 217 [2018-04-13 14:14:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:03,057 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 434 transitions. [2018-04-13 14:14:03,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 14:14:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 434 transitions. [2018-04-13 14:14:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-13 14:14:03,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:03,058 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:03,058 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:03,058 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-13 14:14:03,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:03,567 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-13 14:14:03,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:03,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 14:14:03,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:03,584 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-13 14:14:03,584 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-13 14:14:03,584 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-13 14:14:03,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 14:14:03,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 14:14:03,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 14:14:03,585 INFO L87 Difference]: Start difference. First operand 370 states and 434 transitions. Second operand 46 states. [2018-04-13 14:14:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:06,104 INFO L93 Difference]: Finished difference Result 6381 states and 7412 transitions. [2018-04-13 14:14:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 14:14:06,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 222 [2018-04-13 14:14:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:06,110 INFO L225 Difference]: With dead ends: 6381 [2018-04-13 14:14:06,110 INFO L226 Difference]: Without dead ends: 6381 [2018-04-13 14:14:06,110 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-13 14:14:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2018-04-13 14:14:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 375. [2018-04-13 14:14:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-04-13 14:14:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2018-04-13 14:14:06,134 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 222 [2018-04-13 14:14:06,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:06,134 INFO L459 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2018-04-13 14:14:06,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 14:14:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2018-04-13 14:14:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-13 14:14:06,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:06,135 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-13 14:14:06,135 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:06,135 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-13 14:14:06,138 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:06,339 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-13 14:14:06,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:06,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 14:14:06,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:06,356 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-13 14:14:06,356 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-13 14:14:06,356 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-13 14:14:06,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 14:14:06,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 14:14:06,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-13 14:14:06,357 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand 26 states. [2018-04-13 14:14:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:06,911 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-04-13 14:14:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 14:14:06,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 247 [2018-04-13 14:14:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:06,912 INFO L225 Difference]: With dead ends: 381 [2018-04-13 14:14:06,912 INFO L226 Difference]: Without dead ends: 381 [2018-04-13 14:14:06,912 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-13 14:14:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-13 14:14:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-04-13 14:14:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-13 14:14:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 447 transitions. [2018-04-13 14:14:06,914 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 447 transitions. Word has length 247 [2018-04-13 14:14:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:06,915 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 447 transitions. [2018-04-13 14:14:06,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 14:14:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 447 transitions. [2018-04-13 14:14:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-13 14:14:06,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:06,915 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:06,915 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:06,915 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-13 14:14:06,918 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:07,426 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-13 14:14:07,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:07,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 14:14:07,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:07,444 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-13 14:14:07,444 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-13 14:14:07,444 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-13 14:14:07,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 14:14:07,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 14:14:07,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 14:14:07,444 INFO L87 Difference]: Start difference. First operand 381 states and 447 transitions. Second operand 47 states. [2018-04-13 14:14:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:10,028 INFO L93 Difference]: Finished difference Result 6793 states and 7892 transitions. [2018-04-13 14:14:10,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 14:14:10,028 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 227 [2018-04-13 14:14:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:10,033 INFO L225 Difference]: With dead ends: 6793 [2018-04-13 14:14:10,034 INFO L226 Difference]: Without dead ends: 6793 [2018-04-13 14:14:10,034 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-13 14:14:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2018-04-13 14:14:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 386. [2018-04-13 14:14:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-13 14:14:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 453 transitions. [2018-04-13 14:14:10,075 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 453 transitions. Word has length 227 [2018-04-13 14:14:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:10,075 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 453 transitions. [2018-04-13 14:14:10,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 14:14:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 453 transitions. [2018-04-13 14:14:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-13 14:14:10,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:10,076 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:10,076 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:10,076 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-13 14:14:10,079 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:10,588 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-13 14:14:10,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:10,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-13 14:14:10,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:10,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-13 14:14:10,605 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-13 14:14:10,605 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-13 14:14:10,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 14:14:10,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 14:14:10,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 14:14:10,606 INFO L87 Difference]: Start difference. First operand 386 states and 453 transitions. Second operand 48 states. [2018-04-13 14:14:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:13,320 INFO L93 Difference]: Finished difference Result 6947 states and 8071 transitions. [2018-04-13 14:14:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 14:14:13,320 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 232 [2018-04-13 14:14:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:13,326 INFO L225 Difference]: With dead ends: 6947 [2018-04-13 14:14:13,326 INFO L226 Difference]: Without dead ends: 6947 [2018-04-13 14:14:13,326 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-13 14:14:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2018-04-13 14:14:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 391. [2018-04-13 14:14:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-13 14:14:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 459 transitions. [2018-04-13 14:14:13,351 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 459 transitions. Word has length 232 [2018-04-13 14:14:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:13,351 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 459 transitions. [2018-04-13 14:14:13,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 14:14:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 459 transitions. [2018-04-13 14:14:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-13 14:14:13,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:13,352 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-13 14:14:13,352 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:13,352 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-13 14:14:13,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:13,560 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-13 14:14:13,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:13,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 14:14:13,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:13,576 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-13 14:14:13,576 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-13 14:14:13,576 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-13 14:14:13,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 14:14:13,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 14:14:13,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-13 14:14:13,577 INFO L87 Difference]: Start difference. First operand 391 states and 459 transitions. Second operand 27 states. [2018-04-13 14:14:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:14,173 INFO L93 Difference]: Finished difference Result 397 states and 466 transitions. [2018-04-13 14:14:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 14:14:14,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 257 [2018-04-13 14:14:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:14,173 INFO L225 Difference]: With dead ends: 397 [2018-04-13 14:14:14,173 INFO L226 Difference]: Without dead ends: 397 [2018-04-13 14:14:14,173 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-13 14:14:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-13 14:14:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-04-13 14:14:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-13 14:14:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 466 transitions. [2018-04-13 14:14:14,175 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 466 transitions. Word has length 257 [2018-04-13 14:14:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:14,175 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 466 transitions. [2018-04-13 14:14:14,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 14:14:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 466 transitions. [2018-04-13 14:14:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-13 14:14:14,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:14,176 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:14,176 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:14,176 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-13 14:14:14,178 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:14,723 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-13 14:14:14,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:14,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 14:14:14,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:14,740 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-13 14:14:14,740 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-13 14:14:14,740 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-13 14:14:14,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 14:14:14,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 14:14:14,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 14:14:14,741 INFO L87 Difference]: Start difference. First operand 397 states and 466 transitions. Second operand 49 states. [2018-04-13 14:14:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:17,550 INFO L93 Difference]: Finished difference Result 7377 states and 8572 transitions. [2018-04-13 14:14:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 14:14:17,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 237 [2018-04-13 14:14:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:17,556 INFO L225 Difference]: With dead ends: 7377 [2018-04-13 14:14:17,557 INFO L226 Difference]: Without dead ends: 7377 [2018-04-13 14:14:17,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 14:14:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2018-04-13 14:14:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 402. [2018-04-13 14:14:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-13 14:14:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 472 transitions. [2018-04-13 14:14:17,584 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 472 transitions. Word has length 237 [2018-04-13 14:14:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:17,584 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 472 transitions. [2018-04-13 14:14:17,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 14:14:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 472 transitions. [2018-04-13 14:14:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-13 14:14:17,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:17,585 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-13 14:14:17,585 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:17,585 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-13 14:14:17,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:17,820 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-13 14:14:17,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:17,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 14:14:17,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:17,836 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-13 14:14:17,836 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-13 14:14:17,836 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-13 14:14:17,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 14:14:17,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 14:14:17,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-13 14:14:17,837 INFO L87 Difference]: Start difference. First operand 402 states and 472 transitions. Second operand 28 states. [2018-04-13 14:14:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:18,488 INFO L93 Difference]: Finished difference Result 408 states and 479 transitions. [2018-04-13 14:14:18,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 14:14:18,489 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 267 [2018-04-13 14:14:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:18,489 INFO L225 Difference]: With dead ends: 408 [2018-04-13 14:14:18,489 INFO L226 Difference]: Without dead ends: 408 [2018-04-13 14:14:18,489 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-13 14:14:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-13 14:14:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-04-13 14:14:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-13 14:14:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 479 transitions. [2018-04-13 14:14:18,491 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 479 transitions. Word has length 267 [2018-04-13 14:14:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:18,491 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 479 transitions. [2018-04-13 14:14:18,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 14:14:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 479 transitions. [2018-04-13 14:14:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-13 14:14:18,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:18,492 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:18,492 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:18,492 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-13 14:14:18,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:19,058 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-13 14:14:19,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:19,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 14:14:19,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:19,075 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-13 14:14:19,075 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-13 14:14:19,076 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-13 14:14:19,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 14:14:19,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 14:14:19,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 14:14:19,076 INFO L87 Difference]: Start difference. First operand 408 states and 479 transitions. Second operand 50 states. [2018-04-13 14:14:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:22,051 INFO L93 Difference]: Finished difference Result 7819 states and 9087 transitions. [2018-04-13 14:14:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 14:14:22,052 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 242 [2018-04-13 14:14:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:22,058 INFO L225 Difference]: With dead ends: 7819 [2018-04-13 14:14:22,059 INFO L226 Difference]: Without dead ends: 7819 [2018-04-13 14:14:22,059 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-13 14:14:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2018-04-13 14:14:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 413. [2018-04-13 14:14:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-13 14:14:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 485 transitions. [2018-04-13 14:14:22,087 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 485 transitions. Word has length 242 [2018-04-13 14:14:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:22,088 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 485 transitions. [2018-04-13 14:14:22,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 14:14:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 485 transitions. [2018-04-13 14:14:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-13 14:14:22,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:22,088 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:22,089 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:22,089 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-13 14:14:22,092 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:22,674 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-13 14:14:22,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:22,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 14:14:22,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:22,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-13 14:14:22,691 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-13 14:14:22,692 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-13 14:14:22,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 14:14:22,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 14:14:22,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 14:14:22,692 INFO L87 Difference]: Start difference. First operand 413 states and 485 transitions. Second operand 51 states. [2018-04-13 14:14:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:25,831 INFO L93 Difference]: Finished difference Result 7985 states and 9280 transitions. [2018-04-13 14:14:25,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 14:14:25,831 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 247 [2018-04-13 14:14:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:25,837 INFO L225 Difference]: With dead ends: 7985 [2018-04-13 14:14:25,837 INFO L226 Difference]: Without dead ends: 7985 [2018-04-13 14:14:25,838 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-13 14:14:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2018-04-13 14:14:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 418. [2018-04-13 14:14:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-13 14:14:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 491 transitions. [2018-04-13 14:14:25,867 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 491 transitions. Word has length 247 [2018-04-13 14:14:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:25,867 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 491 transitions. [2018-04-13 14:14:25,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 14:14:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 491 transitions. [2018-04-13 14:14:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-13 14:14:25,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:25,868 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-13 14:14:25,868 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:25,868 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-13 14:14:25,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:26,106 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-13 14:14:26,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:26,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 14:14:26,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:26,122 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-13 14:14:26,122 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-13 14:14:26,122 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-13 14:14:26,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 14:14:26,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 14:14:26,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-04-13 14:14:26,123 INFO L87 Difference]: Start difference. First operand 418 states and 491 transitions. Second operand 29 states. [2018-04-13 14:14:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:26,843 INFO L93 Difference]: Finished difference Result 424 states and 498 transitions. [2018-04-13 14:14:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 14:14:26,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 277 [2018-04-13 14:14:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:26,843 INFO L225 Difference]: With dead ends: 424 [2018-04-13 14:14:26,843 INFO L226 Difference]: Without dead ends: 424 [2018-04-13 14:14:26,844 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-13 14:14:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-13 14:14:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-04-13 14:14:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-13 14:14:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 498 transitions. [2018-04-13 14:14:26,845 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 498 transitions. Word has length 277 [2018-04-13 14:14:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:26,846 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 498 transitions. [2018-04-13 14:14:26,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 14:14:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 498 transitions. [2018-04-13 14:14:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-13 14:14:26,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:26,846 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:26,847 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:26,847 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-13 14:14:26,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:27,462 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-13 14:14:27,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:27,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 14:14:27,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:27,478 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-13 14:14:27,479 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-13 14:14:27,479 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-13 14:14:27,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 14:14:27,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 14:14:27,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 14:14:27,479 INFO L87 Difference]: Start difference. First operand 424 states and 498 transitions. Second operand 52 states. [2018-04-13 14:14:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:30,693 INFO L93 Difference]: Finished difference Result 8445 states and 9816 transitions. [2018-04-13 14:14:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 14:14:30,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 252 [2018-04-13 14:14:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:30,700 INFO L225 Difference]: With dead ends: 8445 [2018-04-13 14:14:30,701 INFO L226 Difference]: Without dead ends: 8445 [2018-04-13 14:14:30,701 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-13 14:14:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2018-04-13 14:14:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 429. [2018-04-13 14:14:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-13 14:14:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 504 transitions. [2018-04-13 14:14:30,733 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 504 transitions. Word has length 252 [2018-04-13 14:14:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:30,733 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 504 transitions. [2018-04-13 14:14:30,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 14:14:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 504 transitions. [2018-04-13 14:14:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-13 14:14:30,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:30,734 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:30,734 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:30,734 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-13 14:14:30,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:31,361 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-13 14:14:31,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:31,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 14:14:31,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:14:31,377 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-13 14:14:31,378 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-13 14:14:31,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 14:14:31,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 14:14:31,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 14:14:31,378 INFO L87 Difference]: Start difference. First operand 429 states and 504 transitions. Second operand 53 states. [2018-04-13 14:14:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:34,837 INFO L93 Difference]: Finished difference Result 8617 states and 10016 transitions. [2018-04-13 14:14:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 14:14:34,837 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 257 [2018-04-13 14:14:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:34,844 INFO L225 Difference]: With dead ends: 8617 [2018-04-13 14:14:34,844 INFO L226 Difference]: Without dead ends: 8617 [2018-04-13 14:14:34,844 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-13 14:14:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2018-04-13 14:14:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 434. [2018-04-13 14:14:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-13 14:14:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 510 transitions. [2018-04-13 14:14:34,877 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 510 transitions. Word has length 257 [2018-04-13 14:14:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:34,877 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 510 transitions. [2018-04-13 14:14:34,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 14:14:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 510 transitions. [2018-04-13 14:14:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-13 14:14:34,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:34,878 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-13 14:14:34,878 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:34,878 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-13 14:14:34,890 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:35,137 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-13 14:14:35,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:35,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 14:14:35,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:35,153 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-13 14:14:35,153 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-13 14:14:35,154 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-13 14:14:35,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 14:14:35,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 14:14:35,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-04-13 14:14:35,154 INFO L87 Difference]: Start difference. First operand 434 states and 510 transitions. Second operand 30 states. [2018-04-13 14:14:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:35,900 INFO L93 Difference]: Finished difference Result 440 states and 517 transitions. [2018-04-13 14:14:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 14:14:35,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 287 [2018-04-13 14:14:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:35,901 INFO L225 Difference]: With dead ends: 440 [2018-04-13 14:14:35,901 INFO L226 Difference]: Without dead ends: 440 [2018-04-13 14:14:35,902 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-13 14:14:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-13 14:14:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-04-13 14:14:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-13 14:14:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 517 transitions. [2018-04-13 14:14:35,913 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 517 transitions. Word has length 287 [2018-04-13 14:14:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:35,913 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 517 transitions. [2018-04-13 14:14:35,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 14:14:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 517 transitions. [2018-04-13 14:14:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-13 14:14:35,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:35,914 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:35,914 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:35,915 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-13 14:14:35,917 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:36,639 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-13 14:14:36,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:36,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 14:14:36,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:14:36,656 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-13 14:14:36,656 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-13 14:14:36,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 14:14:36,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 14:14:36,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 14:14:36,657 INFO L87 Difference]: Start difference. First operand 440 states and 517 transitions. Second operand 54 states. [2018-04-13 14:14:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:40,175 INFO L93 Difference]: Finished difference Result 9095 states and 10573 transitions. [2018-04-13 14:14:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 14:14:40,176 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 262 [2018-04-13 14:14:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:40,183 INFO L225 Difference]: With dead ends: 9095 [2018-04-13 14:14:40,183 INFO L226 Difference]: Without dead ends: 9095 [2018-04-13 14:14:40,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 14:14:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2018-04-13 14:14:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 445. [2018-04-13 14:14:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-13 14:14:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 523 transitions. [2018-04-13 14:14:40,218 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 523 transitions. Word has length 262 [2018-04-13 14:14:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:40,218 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 523 transitions. [2018-04-13 14:14:40,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 14:14:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 523 transitions. [2018-04-13 14:14:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-13 14:14:40,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:40,219 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:40,219 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:40,220 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-13 14:14:40,222 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:40,883 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-13 14:14:40,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:40,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 14:14:40,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:40,901 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-13 14:14:40,902 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-13 14:14:40,902 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-13 14:14:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 14:14:40,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 14:14:40,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 14:14:40,903 INFO L87 Difference]: Start difference. First operand 445 states and 523 transitions. Second operand 55 states. [2018-04-13 14:14:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:44,567 INFO L93 Difference]: Finished difference Result 9273 states and 10780 transitions. [2018-04-13 14:14:44,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 14:14:44,568 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 267 [2018-04-13 14:14:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:44,575 INFO L225 Difference]: With dead ends: 9273 [2018-04-13 14:14:44,576 INFO L226 Difference]: Without dead ends: 9273 [2018-04-13 14:14:44,576 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-13 14:14:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-04-13 14:14:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 450. [2018-04-13 14:14:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-13 14:14:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 529 transitions. [2018-04-13 14:14:44,611 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 529 transitions. Word has length 267 [2018-04-13 14:14:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:44,611 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 529 transitions. [2018-04-13 14:14:44,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 14:14:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 529 transitions. [2018-04-13 14:14:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-13 14:14:44,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:44,612 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-13 14:14:44,612 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:44,613 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-13 14:14:44,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:44,879 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-13 14:14:44,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:44,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 14:14:44,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:44,897 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-13 14:14:44,897 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-13 14:14:44,897 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-13 14:14:44,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 14:14:44,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 14:14:44,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-13 14:14:44,898 INFO L87 Difference]: Start difference. First operand 450 states and 529 transitions. Second operand 31 states. [2018-04-13 14:14:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:45,704 INFO L93 Difference]: Finished difference Result 456 states and 536 transitions. [2018-04-13 14:14:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 14:14:45,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 297 [2018-04-13 14:14:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:45,705 INFO L225 Difference]: With dead ends: 456 [2018-04-13 14:14:45,705 INFO L226 Difference]: Without dead ends: 456 [2018-04-13 14:14:45,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 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-13 14:14:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-13 14:14:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2018-04-13 14:14:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-04-13 14:14:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 536 transitions. [2018-04-13 14:14:45,707 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 536 transitions. Word has length 297 [2018-04-13 14:14:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:45,708 INFO L459 AbstractCegarLoop]: Abstraction has 456 states and 536 transitions. [2018-04-13 14:14:45,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 14:14:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 536 transitions. [2018-04-13 14:14:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-13 14:14:45,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:45,709 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:45,709 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:45,709 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-13 14:14:45,711 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:46,421 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-13 14:14:46,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:46,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 14:14:46,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:46,438 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-13 14:14:46,438 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-13 14:14:46,438 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-13 14:14:46,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 14:14:46,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 14:14:46,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 14:14:46,439 INFO L87 Difference]: Start difference. First operand 456 states and 536 transitions. Second operand 56 states. [2018-04-13 14:14:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:50,255 INFO L93 Difference]: Finished difference Result 9769 states and 11358 transitions. [2018-04-13 14:14:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 14:14:50,255 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 272 [2018-04-13 14:14:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:50,264 INFO L225 Difference]: With dead ends: 9769 [2018-04-13 14:14:50,264 INFO L226 Difference]: Without dead ends: 9769 [2018-04-13 14:14:50,264 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-13 14:14:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2018-04-13 14:14:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 461. [2018-04-13 14:14:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-13 14:14:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 542 transitions. [2018-04-13 14:14:50,302 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 542 transitions. Word has length 272 [2018-04-13 14:14:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:50,302 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 542 transitions. [2018-04-13 14:14:50,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 14:14:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 542 transitions. [2018-04-13 14:14:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-13 14:14:50,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:50,303 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:50,303 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:50,303 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-13 14:14:50,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:51,041 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-13 14:14:51,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:51,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-13 14:14:51,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:51,058 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-13 14:14:51,058 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-13 14:14:51,059 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-13 14:14:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 14:14:51,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 14:14:51,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 14:14:51,059 INFO L87 Difference]: Start difference. First operand 461 states and 542 transitions. Second operand 57 states. [2018-04-13 14:14:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:54,969 INFO L93 Difference]: Finished difference Result 9953 states and 11572 transitions. [2018-04-13 14:14:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 14:14:54,969 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 277 [2018-04-13 14:14:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:54,978 INFO L225 Difference]: With dead ends: 9953 [2018-04-13 14:14:54,978 INFO L226 Difference]: Without dead ends: 9953 [2018-04-13 14:14:54,978 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-13 14:14:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2018-04-13 14:14:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 466. [2018-04-13 14:14:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-13 14:14:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 548 transitions. [2018-04-13 14:14:55,016 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 548 transitions. Word has length 277 [2018-04-13 14:14:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:55,016 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 548 transitions. [2018-04-13 14:14:55,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 14:14:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 548 transitions. [2018-04-13 14:14:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-13 14:14:55,017 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:55,017 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-13 14:14:55,017 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:55,018 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-13 14:14:55,027 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:55,345 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-13 14:14:55,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:55,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 14:14:55,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:55,362 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-13 14:14:55,362 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-13 14:14:55,362 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-13 14:14:55,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 14:14:55,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 14:14:55,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-13 14:14:55,363 INFO L87 Difference]: Start difference. First operand 466 states and 548 transitions. Second operand 32 states. [2018-04-13 14:14:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:14:56,217 INFO L93 Difference]: Finished difference Result 472 states and 555 transitions. [2018-04-13 14:14:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 14:14:56,218 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 307 [2018-04-13 14:14:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:14:56,218 INFO L225 Difference]: With dead ends: 472 [2018-04-13 14:14:56,218 INFO L226 Difference]: Without dead ends: 472 [2018-04-13 14:14:56,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 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-13 14:14:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-04-13 14:14:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2018-04-13 14:14:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-13 14:14:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 555 transitions. [2018-04-13 14:14:56,221 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 555 transitions. Word has length 307 [2018-04-13 14:14:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:14:56,221 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 555 transitions. [2018-04-13 14:14:56,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 14:14:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 555 transitions. [2018-04-13 14:14:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-13 14:14:56,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:14:56,222 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-13 14:14:56,222 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:14:56,222 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-13 14:14:56,225 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:14:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:14:57,016 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-13 14:14:57,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:14:57,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 14:14:57,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:14:57,032 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-13 14:14:57,033 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-13 14:14:57,033 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-13 14:14:57,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 14:14:57,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 14:14:57,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 14:14:57,034 INFO L87 Difference]: Start difference. First operand 472 states and 555 transitions. Second operand 58 states. [2018-04-13 14:15:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:01,681 INFO L93 Difference]: Finished difference Result 10467 states and 12171 transitions. [2018-04-13 14:15:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 14:15:01,681 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 282 [2018-04-13 14:15:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:01,691 INFO L225 Difference]: With dead ends: 10467 [2018-04-13 14:15:01,691 INFO L226 Difference]: Without dead ends: 10467 [2018-04-13 14:15:01,691 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-13 14:15:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10467 states. [2018-04-13 14:15:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10467 to 477. [2018-04-13 14:15:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-04-13 14:15:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 561 transitions. [2018-04-13 14:15:01,767 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 561 transitions. Word has length 282 [2018-04-13 14:15:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:01,767 INFO L459 AbstractCegarLoop]: Abstraction has 477 states and 561 transitions. [2018-04-13 14:15:01,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 14:15:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 561 transitions. [2018-04-13 14:15:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-13 14:15:01,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:01,768 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-13 14:15:01,768 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:01,768 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-13 14:15:01,771 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:02,181 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-13 14:15:02,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:02,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 14:15:02,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:02,198 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-13 14:15:02,198 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-13 14:15:02,198 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-13 14:15:02,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 14:15:02,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 14:15:02,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 14:15:02,199 INFO L87 Difference]: Start difference. First operand 477 states and 561 transitions. Second operand 33 states. [2018-04-13 14:15:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:03,109 INFO L93 Difference]: Finished difference Result 483 states and 568 transitions. [2018-04-13 14:15:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 14:15:03,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 317 [2018-04-13 14:15:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:03,110 INFO L225 Difference]: With dead ends: 483 [2018-04-13 14:15:03,110 INFO L226 Difference]: Without dead ends: 483 [2018-04-13 14:15:03,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 14:15:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-13 14:15:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-04-13 14:15:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-04-13 14:15:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 568 transitions. [2018-04-13 14:15:03,115 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 568 transitions. Word has length 317 [2018-04-13 14:15:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:03,115 INFO L459 AbstractCegarLoop]: Abstraction has 483 states and 568 transitions. [2018-04-13 14:15:03,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 14:15:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 568 transitions. [2018-04-13 14:15:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-13 14:15:03,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:03,117 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:03,117 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:03,117 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-13 14:15:03,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:04,117 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-13 14:15:04,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:04,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-13 14:15:04,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:04,133 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-13 14:15:04,133 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-13 14:15:04,133 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-13 14:15:04,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 14:15:04,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 14:15:04,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 14:15:04,134 INFO L87 Difference]: Start difference. First operand 483 states and 568 transitions. Second operand 59 states. [2018-04-13 14:15:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:08,595 INFO L93 Difference]: Finished difference Result 10993 states and 12784 transitions. [2018-04-13 14:15:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 14:15:08,595 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 287 [2018-04-13 14:15:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:08,604 INFO L225 Difference]: With dead ends: 10993 [2018-04-13 14:15:08,604 INFO L226 Difference]: Without dead ends: 10993 [2018-04-13 14:15:08,604 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-13 14:15:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10993 states. [2018-04-13 14:15:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10993 to 488. [2018-04-13 14:15:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-04-13 14:15:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 574 transitions. [2018-04-13 14:15:08,646 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 574 transitions. Word has length 287 [2018-04-13 14:15:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:08,646 INFO L459 AbstractCegarLoop]: Abstraction has 488 states and 574 transitions. [2018-04-13 14:15:08,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 14:15:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 574 transitions. [2018-04-13 14:15:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-13 14:15:08,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:08,647 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:08,647 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:08,647 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-13 14:15:08,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:09,484 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-13 14:15:09,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:09,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-13 14:15:09,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:09,500 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-13 14:15:09,501 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-13 14:15:09,501 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-13 14:15:09,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 14:15:09,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 14:15:09,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 14:15:09,502 INFO L87 Difference]: Start difference. First operand 488 states and 574 transitions. Second operand 60 states. [2018-04-13 14:15:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:14,033 INFO L93 Difference]: Finished difference Result 11189 states and 13012 transitions. [2018-04-13 14:15:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 14:15:14,033 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-04-13 14:15:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:14,042 INFO L225 Difference]: With dead ends: 11189 [2018-04-13 14:15:14,042 INFO L226 Difference]: Without dead ends: 11189 [2018-04-13 14:15:14,043 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-13 14:15:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2018-04-13 14:15:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 493. [2018-04-13 14:15:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-13 14:15:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 580 transitions. [2018-04-13 14:15:14,095 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 580 transitions. Word has length 292 [2018-04-13 14:15:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:14,095 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 580 transitions. [2018-04-13 14:15:14,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 14:15:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 580 transitions. [2018-04-13 14:15:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-13 14:15:14,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:14,096 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-13 14:15:14,096 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:14,097 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-13 14:15:14,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:14,429 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-13 14:15:14,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:14,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 14:15:14,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:14,446 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-13 14:15:14,446 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-13 14:15:14,446 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-13 14:15:14,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 14:15:14,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 14:15:14,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 14:15:14,447 INFO L87 Difference]: Start difference. First operand 493 states and 580 transitions. Second operand 34 states. [2018-04-13 14:15:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:15,466 INFO L93 Difference]: Finished difference Result 499 states and 587 transitions. [2018-04-13 14:15:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 14:15:15,466 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 327 [2018-04-13 14:15:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:15,467 INFO L225 Difference]: With dead ends: 499 [2018-04-13 14:15:15,467 INFO L226 Difference]: Without dead ends: 499 [2018-04-13 14:15:15,467 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-13 14:15:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-13 14:15:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-04-13 14:15:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-04-13 14:15:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 587 transitions. [2018-04-13 14:15:15,469 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 587 transitions. Word has length 327 [2018-04-13 14:15:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:15,469 INFO L459 AbstractCegarLoop]: Abstraction has 499 states and 587 transitions. [2018-04-13 14:15:15,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 14:15:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 587 transitions. [2018-04-13 14:15:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-13 14:15:15,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:15,470 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:15,470 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:15,471 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-13 14:15:15,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:16,347 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-13 14:15:16,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:16,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 14:15:16,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:16,362 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-13 14:15:16,362 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-13 14:15:16,363 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-13 14:15:16,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 14:15:16,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 14:15:16,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 14:15:16,363 INFO L87 Difference]: Start difference. First operand 499 states and 587 transitions. Second operand 61 states. [2018-04-13 14:15:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:20,918 INFO L93 Difference]: Finished difference Result 11733 states and 13646 transitions. [2018-04-13 14:15:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 14:15:20,918 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 297 [2018-04-13 14:15:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:20,927 INFO L225 Difference]: With dead ends: 11733 [2018-04-13 14:15:20,927 INFO L226 Difference]: Without dead ends: 11733 [2018-04-13 14:15:20,927 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-13 14:15:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11733 states. [2018-04-13 14:15:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 504. [2018-04-13 14:15:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-04-13 14:15:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 593 transitions. [2018-04-13 14:15:20,971 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 593 transitions. Word has length 297 [2018-04-13 14:15:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:20,971 INFO L459 AbstractCegarLoop]: Abstraction has 504 states and 593 transitions. [2018-04-13 14:15:20,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 14:15:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 593 transitions. [2018-04-13 14:15:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-13 14:15:20,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:20,972 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:20,972 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:20,972 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-13 14:15:20,977 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:21,862 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-13 14:15:21,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:21,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-13 14:15:21,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:21,879 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-13 14:15:21,879 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-13 14:15:21,879 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-13 14:15:21,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 14:15:21,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 14:15:21,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 14:15:21,880 INFO L87 Difference]: Start difference. First operand 504 states and 593 transitions. Second operand 62 states. [2018-04-13 14:15:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:26,707 INFO L93 Difference]: Finished difference Result 11935 states and 13881 transitions. [2018-04-13 14:15:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 14:15:26,707 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 302 [2018-04-13 14:15:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:26,716 INFO L225 Difference]: With dead ends: 11935 [2018-04-13 14:15:26,716 INFO L226 Difference]: Without dead ends: 11935 [2018-04-13 14:15:26,716 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-13 14:15:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11935 states. [2018-04-13 14:15:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11935 to 509. [2018-04-13 14:15:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-04-13 14:15:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 599 transitions. [2018-04-13 14:15:26,762 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 599 transitions. Word has length 302 [2018-04-13 14:15:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:26,762 INFO L459 AbstractCegarLoop]: Abstraction has 509 states and 599 transitions. [2018-04-13 14:15:26,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 14:15:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 599 transitions. [2018-04-13 14:15:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-13 14:15:26,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:26,763 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-13 14:15:26,763 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:26,763 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-13 14:15:26,768 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:27,122 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-13 14:15:27,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:27,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 14:15:27,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:27,139 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-13 14:15:27,139 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-13 14:15:27,139 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-13 14:15:27,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 14:15:27,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 14:15:27,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 14:15:27,140 INFO L87 Difference]: Start difference. First operand 509 states and 599 transitions. Second operand 35 states. [2018-04-13 14:15:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:28,185 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-04-13 14:15:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 14:15:28,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 337 [2018-04-13 14:15:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:28,186 INFO L225 Difference]: With dead ends: 515 [2018-04-13 14:15:28,186 INFO L226 Difference]: Without dead ends: 515 [2018-04-13 14:15:28,186 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-13 14:15:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-04-13 14:15:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-04-13 14:15:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-04-13 14:15:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-04-13 14:15:28,188 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 337 [2018-04-13 14:15:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:28,189 INFO L459 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-04-13 14:15:28,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 14:15:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-04-13 14:15:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-13 14:15:28,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:28,190 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:28,190 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:28,190 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-13 14:15:28,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:29,160 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-13 14:15:29,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:29,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-13 14:15:29,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:29,176 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-13 14:15:29,176 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-13 14:15:29,177 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-13 14:15:29,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 14:15:29,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 14:15:29,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 14:15:29,177 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 63 states. [2018-04-13 14:15:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:34,127 INFO L93 Difference]: Finished difference Result 12497 states and 14536 transitions. [2018-04-13 14:15:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 14:15:34,128 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 307 [2018-04-13 14:15:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:34,138 INFO L225 Difference]: With dead ends: 12497 [2018-04-13 14:15:34,138 INFO L226 Difference]: Without dead ends: 12497 [2018-04-13 14:15:34,138 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-13 14:15:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2018-04-13 14:15:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 520. [2018-04-13 14:15:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-04-13 14:15:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 612 transitions. [2018-04-13 14:15:34,198 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 612 transitions. Word has length 307 [2018-04-13 14:15:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:34,198 INFO L459 AbstractCegarLoop]: Abstraction has 520 states and 612 transitions. [2018-04-13 14:15:34,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 14:15:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 612 transitions. [2018-04-13 14:15:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-13 14:15:34,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:34,199 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:34,199 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:34,199 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-13 14:15:34,201 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:35,195 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-13 14:15:35,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:35,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 14:15:35,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:35,211 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-13 14:15:35,212 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-13 14:15:35,212 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-13 14:15:35,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 14:15:35,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 14:15:35,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 14:15:35,212 INFO L87 Difference]: Start difference. First operand 520 states and 612 transitions. Second operand 64 states. [2018-04-13 14:15:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:40,483 INFO L93 Difference]: Finished difference Result 12705 states and 14778 transitions. [2018-04-13 14:15:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 14:15:40,484 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 312 [2018-04-13 14:15:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:40,494 INFO L225 Difference]: With dead ends: 12705 [2018-04-13 14:15:40,494 INFO L226 Difference]: Without dead ends: 12705 [2018-04-13 14:15:40,494 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-13 14:15:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2018-04-13 14:15:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 525. [2018-04-13 14:15:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-13 14:15:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 618 transitions. [2018-04-13 14:15:40,543 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 618 transitions. Word has length 312 [2018-04-13 14:15:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:40,543 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 618 transitions. [2018-04-13 14:15:40,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 14:15:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 618 transitions. [2018-04-13 14:15:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-13 14:15:40,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:40,544 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-13 14:15:40,544 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:40,544 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-13 14:15:40,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:40,909 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-13 14:15:40,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:40,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 14:15:40,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:40,925 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-13 14:15:40,925 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-13 14:15:40,925 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-13 14:15:40,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 14:15:40,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 14:15:40,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 14:15:40,926 INFO L87 Difference]: Start difference. First operand 525 states and 618 transitions. Second operand 36 states. [2018-04-13 14:15:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:42,008 INFO L93 Difference]: Finished difference Result 531 states and 625 transitions. [2018-04-13 14:15:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 14:15:42,008 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-04-13 14:15:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:42,008 INFO L225 Difference]: With dead ends: 531 [2018-04-13 14:15:42,009 INFO L226 Difference]: Without dead ends: 531 [2018-04-13 14:15:42,009 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-13 14:15:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-13 14:15:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-04-13 14:15:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-04-13 14:15:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 625 transitions. [2018-04-13 14:15:42,011 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 625 transitions. Word has length 347 [2018-04-13 14:15:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:42,011 INFO L459 AbstractCegarLoop]: Abstraction has 531 states and 625 transitions. [2018-04-13 14:15:42,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 14:15:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 625 transitions. [2018-04-13 14:15:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-13 14:15:42,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:42,012 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:42,012 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:42,013 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-13 14:15:42,015 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:43,233 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-13 14:15:43,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:43,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 14:15:43,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:43,250 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-13 14:15:43,250 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-13 14:15:43,250 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-13 14:15:43,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 14:15:43,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 14:15:43,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 14:15:43,251 INFO L87 Difference]: Start difference. First operand 531 states and 625 transitions. Second operand 65 states. [2018-04-13 14:15:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:48,568 INFO L93 Difference]: Finished difference Result 13285 states and 15454 transitions. [2018-04-13 14:15:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 14:15:48,568 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 317 [2018-04-13 14:15:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:48,579 INFO L225 Difference]: With dead ends: 13285 [2018-04-13 14:15:48,579 INFO L226 Difference]: Without dead ends: 13285 [2018-04-13 14:15:48,580 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-13 14:15:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2018-04-13 14:15:48,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 536. [2018-04-13 14:15:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-04-13 14:15:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 631 transitions. [2018-04-13 14:15:48,645 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 631 transitions. Word has length 317 [2018-04-13 14:15:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:48,645 INFO L459 AbstractCegarLoop]: Abstraction has 536 states and 631 transitions. [2018-04-13 14:15:48,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 14:15:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 631 transitions. [2018-04-13 14:15:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-13 14:15:48,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:48,647 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:48,647 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:48,647 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-13 14:15:48,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:49,631 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-13 14:15:49,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:49,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-13 14:15:49,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:49,647 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-13 14:15:49,647 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-13 14:15:49,647 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-13 14:15:49,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 14:15:49,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 14:15:49,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 14:15:49,648 INFO L87 Difference]: Start difference. First operand 536 states and 631 transitions. Second operand 66 states. [2018-04-13 14:15:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:55,103 INFO L93 Difference]: Finished difference Result 13499 states and 15703 transitions. [2018-04-13 14:15:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 14:15:55,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 322 [2018-04-13 14:15:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:55,111 INFO L225 Difference]: With dead ends: 13499 [2018-04-13 14:15:55,111 INFO L226 Difference]: Without dead ends: 13499 [2018-04-13 14:15:55,112 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-13 14:15:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13499 states. [2018-04-13 14:15:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13499 to 541. [2018-04-13 14:15:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-04-13 14:15:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 637 transitions. [2018-04-13 14:15:55,157 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 637 transitions. Word has length 322 [2018-04-13 14:15:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:55,158 INFO L459 AbstractCegarLoop]: Abstraction has 541 states and 637 transitions. [2018-04-13 14:15:55,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 14:15:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 637 transitions. [2018-04-13 14:15:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-13 14:15:55,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:55,159 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-13 14:15:55,159 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:55,159 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-13 14:15:55,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:55,535 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-13 14:15:55,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:55,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 14:15:55,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:55,552 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-13 14:15:55,552 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-13 14:15:55,552 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-13 14:15:55,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 14:15:55,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 14:15:55,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 14:15:55,553 INFO L87 Difference]: Start difference. First operand 541 states and 637 transitions. Second operand 37 states. [2018-04-13 14:15:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:15:56,723 INFO L93 Difference]: Finished difference Result 547 states and 644 transitions. [2018-04-13 14:15:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 14:15:56,723 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 357 [2018-04-13 14:15:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:15:56,724 INFO L225 Difference]: With dead ends: 547 [2018-04-13 14:15:56,724 INFO L226 Difference]: Without dead ends: 547 [2018-04-13 14:15:56,724 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-13 14:15:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-13 14:15:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2018-04-13 14:15:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-04-13 14:15:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 644 transitions. [2018-04-13 14:15:56,726 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 644 transitions. Word has length 357 [2018-04-13 14:15:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:15:56,726 INFO L459 AbstractCegarLoop]: Abstraction has 547 states and 644 transitions. [2018-04-13 14:15:56,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 14:15:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 644 transitions. [2018-04-13 14:15:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-13 14:15:56,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:15:56,727 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-13 14:15:56,728 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:15:56,728 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-13 14:15:56,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:15:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:15:57,787 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-13 14:15:57,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:15:57,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-13 14:15:57,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:15:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:15:57,804 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-13 14:15:57,804 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-13 14:15:57,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 14:15:57,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 14:15:57,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 14:15:57,805 INFO L87 Difference]: Start difference. First operand 547 states and 644 transitions. Second operand 67 states. [2018-04-13 14:16:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:03,712 INFO L93 Difference]: Finished difference Result 14097 states and 16400 transitions. [2018-04-13 14:16:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 14:16:03,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-13 14:16:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:03,723 INFO L225 Difference]: With dead ends: 14097 [2018-04-13 14:16:03,723 INFO L226 Difference]: Without dead ends: 14097 [2018-04-13 14:16:03,723 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-13 14:16:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2018-04-13 14:16:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 552. [2018-04-13 14:16:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-04-13 14:16:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 650 transitions. [2018-04-13 14:16:03,781 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 650 transitions. Word has length 327 [2018-04-13 14:16:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:03,781 INFO L459 AbstractCegarLoop]: Abstraction has 552 states and 650 transitions. [2018-04-13 14:16:03,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 14:16:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 650 transitions. [2018-04-13 14:16:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-13 14:16:03,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:03,783 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-13 14:16:03,783 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:03,783 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-13 14:16:03,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:04,184 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-13 14:16:04,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:04,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 14:16:04,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:04,200 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-13 14:16:04,200 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-13 14:16:04,201 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-13 14:16:04,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 14:16:04,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 14:16:04,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 14:16:04,201 INFO L87 Difference]: Start difference. First operand 552 states and 650 transitions. Second operand 38 states. [2018-04-13 14:16:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:05,423 INFO L93 Difference]: Finished difference Result 558 states and 657 transitions. [2018-04-13 14:16:05,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 14:16:05,423 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 367 [2018-04-13 14:16:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:05,423 INFO L225 Difference]: With dead ends: 558 [2018-04-13 14:16:05,423 INFO L226 Difference]: Without dead ends: 558 [2018-04-13 14:16:05,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 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-13 14:16:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-04-13 14:16:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2018-04-13 14:16:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-04-13 14:16:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 657 transitions. [2018-04-13 14:16:05,426 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 657 transitions. Word has length 367 [2018-04-13 14:16:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:05,426 INFO L459 AbstractCegarLoop]: Abstraction has 558 states and 657 transitions. [2018-04-13 14:16:05,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 14:16:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 657 transitions. [2018-04-13 14:16:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 14:16:05,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:05,427 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:05,427 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:05,427 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-13 14:16:05,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:06,474 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-13 14:16:06,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:06,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-13 14:16:06,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:06,491 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-13 14:16:06,491 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-13 14:16:06,492 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-13 14:16:06,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 14:16:06,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 14:16:06,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 14:16:06,492 INFO L87 Difference]: Start difference. First operand 558 states and 657 transitions. Second operand 68 states. [2018-04-13 14:16:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:12,298 INFO L93 Difference]: Finished difference Result 14707 states and 17111 transitions. [2018-04-13 14:16:12,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 14:16:12,299 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 332 [2018-04-13 14:16:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:12,311 INFO L225 Difference]: With dead ends: 14707 [2018-04-13 14:16:12,311 INFO L226 Difference]: Without dead ends: 14707 [2018-04-13 14:16:12,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 14:16:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2018-04-13 14:16:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 563. [2018-04-13 14:16:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-13 14:16:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 663 transitions. [2018-04-13 14:16:12,372 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 663 transitions. Word has length 332 [2018-04-13 14:16:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:12,372 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 663 transitions. [2018-04-13 14:16:12,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 14:16:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 663 transitions. [2018-04-13 14:16:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-13 14:16:12,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:12,373 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:12,373 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash -570087994, now seen corresponding path program 66 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:12,375 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:13,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:13,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 14:16:13,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:13,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-13 14:16:13,451 INFO L182 omatonBuilderFactory]: Interpolants [374175#true, 374181#(= main_~i~0 2), 374180#(= main_~i~0 1), 374183#(= main_~i~0 4), 374182#(= main_~i~0 3), 374176#false, 374179#(= main_~i~0 0), 374189#(= main_~i~0 10), 374188#(= main_~i~0 9), 374191#(= main_~i~0 12), 374190#(= main_~i~0 11), 374185#(= main_~i~0 6), 374184#(= main_~i~0 5), 374187#(= main_~i~0 8), 374186#(= main_~i~0 7), 374197#(= main_~i~0 18), 374196#(= main_~i~0 17), 374199#(= main_~i~0 20), 374198#(= main_~i~0 19), 374193#(= main_~i~0 14), 374192#(= main_~i~0 13), 374195#(= main_~i~0 16), 374194#(= main_~i~0 15), 374205#(= main_~i~0 26), 374204#(= main_~i~0 25), 374207#(= main_~i~0 28), 374206#(= main_~i~0 27), 374201#(= main_~i~0 22), 374200#(= main_~i~0 21), 374203#(= main_~i~0 24), 374202#(= main_~i~0 23), 374213#(= main_~i~0 34), 374212#(= main_~i~0 33), 374215#(= main_~i~0 36), 374214#(= main_~i~0 35), 374209#(= main_~i~0 30), 374208#(= main_~i~0 29), 374211#(= main_~i~0 32), 374210#(= main_~i~0 31), 374221#(= main_~i~0 42), 374220#(= main_~i~0 41), 374223#(= main_~i~0 44), 374222#(= main_~i~0 43), 374217#(= main_~i~0 38), 374216#(= main_~i~0 37), 374219#(= main_~i~0 40), 374218#(= main_~i~0 39), 374229#(= main_~i~0 50), 374228#(= main_~i~0 49), 374231#(= main_~i~0 52), 374230#(= main_~i~0 51), 374225#(= main_~i~0 46), 374224#(= main_~i~0 45), 374227#(= main_~i~0 48), 374226#(= main_~i~0 47), 374237#(= main_~i~0 58), 374236#(= main_~i~0 57), 374239#(= main_~i~0 60), 374238#(= main_~i~0 59), 374233#(= main_~i~0 54), 374232#(= main_~i~0 53), 374235#(= main_~i~0 56), 374234#(= main_~i~0 55), 374245#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 374244#(= main_~i~0 65), 374241#(= main_~i~0 62), 374240#(= main_~i~0 61), 374243#(= main_~i~0 64), 374242#(= main_~i~0 63)] [2018-04-13 14:16:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:13,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 14:16:13,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 14:16:13,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 14:16:13,452 INFO L87 Difference]: Start difference. First operand 563 states and 663 transitions. Second operand 69 states. [2018-04-13 14:16:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:19,373 INFO L93 Difference]: Finished difference Result 14933 states and 17374 transitions. [2018-04-13 14:16:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 14:16:19,373 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 337 [2018-04-13 14:16:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:19,385 INFO L225 Difference]: With dead ends: 14933 [2018-04-13 14:16:19,385 INFO L226 Difference]: Without dead ends: 14933 [2018-04-13 14:16:19,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 14:16:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14933 states. [2018-04-13 14:16:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14933 to 568. [2018-04-13 14:16:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-04-13 14:16:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 669 transitions. [2018-04-13 14:16:19,459 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 669 transitions. Word has length 337 [2018-04-13 14:16:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:19,459 INFO L459 AbstractCegarLoop]: Abstraction has 568 states and 669 transitions. [2018-04-13 14:16:19,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 14:16:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 669 transitions. [2018-04-13 14:16:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-13 14:16:19,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:19,460 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:19,460 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash 54704057, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:19,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6411 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-04-13 14:16:19,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:19,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 14:16:19,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-13 14:16:19,903 INFO L182 omatonBuilderFactory]: Interpolants [389831#(= main_~x~0 16), 389766#(= main_~x~0 3), 389761#(= main_~x~0 2), 389891#(= main_~x~0 28), 389826#(= main_~x~0 15), 389901#(= main_~x~0 30), 389836#(= main_~x~0 17), 389896#(= main_~x~0 29), 389771#(= main_~x~0 4), 389781#(= main_~x~0 6), 389911#(= main_~x~0 32), 389846#(= main_~x~0 19), 389841#(= main_~x~0 18), 389776#(= main_~x~0 5), 389906#(= main_~x~0 31), 389916#(= main_~x~0 33), 389791#(= main_~x~0 8), 389851#(= main_~x~0 20), 389786#(= main_~x~0 7), 389861#(= main_~x~0 22), 389796#(= main_~x~0 9), 389926#(= main_~x~0 35), 389921#(= main_~x~0 34), 389856#(= main_~x~0 21), 389871#(= main_~x~0 24), 389806#(= main_~x~0 11), 389801#(= main_~x~0 10), 389931#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 389866#(= main_~x~0 23), 389748#false, 389876#(= main_~x~0 25), 389751#(= 0 main_~x~0), 389747#true, 389811#(= main_~x~0 12), 389821#(= main_~x~0 14), 389756#(= 1 main_~x~0), 389886#(= main_~x~0 27), 389881#(= main_~x~0 26), 389816#(= main_~x~0 13)] [2018-04-13 14:16:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6411 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-04-13 14:16:19,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 14:16:19,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 14:16:19,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 14:16:19,904 INFO L87 Difference]: Start difference. First operand 568 states and 669 transitions. Second operand 39 states. [2018-04-13 14:16:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:21,190 INFO L93 Difference]: Finished difference Result 574 states and 676 transitions. [2018-04-13 14:16:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 14:16:21,190 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 377 [2018-04-13 14:16:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:21,191 INFO L225 Difference]: With dead ends: 574 [2018-04-13 14:16:21,191 INFO L226 Difference]: Without dead ends: 574 [2018-04-13 14:16:21,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 14:16:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-13 14:16:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-04-13 14:16:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-04-13 14:16:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 676 transitions. [2018-04-13 14:16:21,193 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 676 transitions. Word has length 377 [2018-04-13 14:16:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:21,193 INFO L459 AbstractCegarLoop]: Abstraction has 574 states and 676 transitions. [2018-04-13 14:16:21,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 14:16:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 676 transitions. [2018-04-13 14:16:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-13 14:16:21,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:21,194 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:21,194 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1787171081, now seen corresponding path program 67 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:21,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:22,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:22,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 14:16:22,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:22,311 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-13 14:16:22,311 INFO L182 omatonBuilderFactory]: Interpolants [391085#(= main_~i~0 1), 391084#(= main_~i~0 0), 391087#(= main_~i~0 3), 391086#(= main_~i~0 2), 391081#false, 391080#true, 391093#(= main_~i~0 9), 391092#(= main_~i~0 8), 391095#(= main_~i~0 11), 391094#(= main_~i~0 10), 391089#(= main_~i~0 5), 391088#(= main_~i~0 4), 391091#(= main_~i~0 7), 391090#(= main_~i~0 6), 391101#(= main_~i~0 17), 391100#(= main_~i~0 16), 391103#(= main_~i~0 19), 391102#(= main_~i~0 18), 391097#(= main_~i~0 13), 391096#(= main_~i~0 12), 391099#(= main_~i~0 15), 391098#(= main_~i~0 14), 391109#(= main_~i~0 25), 391108#(= main_~i~0 24), 391111#(= main_~i~0 27), 391110#(= main_~i~0 26), 391105#(= main_~i~0 21), 391104#(= main_~i~0 20), 391107#(= main_~i~0 23), 391106#(= main_~i~0 22), 391117#(= main_~i~0 33), 391116#(= main_~i~0 32), 391119#(= main_~i~0 35), 391118#(= main_~i~0 34), 391113#(= main_~i~0 29), 391112#(= main_~i~0 28), 391115#(= main_~i~0 31), 391114#(= main_~i~0 30), 391125#(= main_~i~0 41), 391124#(= main_~i~0 40), 391127#(= main_~i~0 43), 391126#(= main_~i~0 42), 391121#(= main_~i~0 37), 391120#(= main_~i~0 36), 391123#(= main_~i~0 39), 391122#(= main_~i~0 38), 391133#(= main_~i~0 49), 391132#(= main_~i~0 48), 391135#(= main_~i~0 51), 391134#(= main_~i~0 50), 391129#(= main_~i~0 45), 391128#(= main_~i~0 44), 391131#(= main_~i~0 47), 391130#(= main_~i~0 46), 391141#(= main_~i~0 57), 391140#(= main_~i~0 56), 391143#(= main_~i~0 59), 391142#(= main_~i~0 58), 391137#(= main_~i~0 53), 391136#(= main_~i~0 52), 391139#(= main_~i~0 55), 391138#(= main_~i~0 54), 391149#(= main_~i~0 65), 391148#(= main_~i~0 64), 391151#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 391150#(= main_~i~0 66), 391145#(= main_~i~0 61), 391144#(= main_~i~0 60), 391147#(= main_~i~0 63), 391146#(= main_~i~0 62)] [2018-04-13 14:16:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:22,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 14:16:22,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 14:16:22,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 14:16:22,312 INFO L87 Difference]: Start difference. First operand 574 states and 676 transitions. Second operand 70 states. [2018-04-13 14:16:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:28,474 INFO L93 Difference]: Finished difference Result 15561 states and 18106 transitions. [2018-04-13 14:16:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 14:16:28,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 342 [2018-04-13 14:16:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:28,487 INFO L225 Difference]: With dead ends: 15561 [2018-04-13 14:16:28,487 INFO L226 Difference]: Without dead ends: 15561 [2018-04-13 14:16:28,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 14:16:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2018-04-13 14:16:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 579. [2018-04-13 14:16:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-04-13 14:16:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions. [2018-04-13 14:16:28,555 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 342 [2018-04-13 14:16:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:28,555 INFO L459 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions. [2018-04-13 14:16:28,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 14:16:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions. [2018-04-13 14:16:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-13 14:16:28,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:28,556 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:28,556 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1204274074, now seen corresponding path program 68 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:28,558 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:29,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:29,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-13 14:16:29,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:29,695 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-13 14:16:29,695 INFO L182 omatonBuilderFactory]: Interpolants [407302#(= main_~i~0 6), 407303#(= main_~i~0 7), 407300#(= main_~i~0 4), 407301#(= main_~i~0 5), 407298#(= main_~i~0 2), 407299#(= main_~i~0 3), 407296#(= main_~i~0 0), 407297#(= main_~i~0 1), 407310#(= main_~i~0 14), 407311#(= main_~i~0 15), 407308#(= main_~i~0 12), 407309#(= main_~i~0 13), 407306#(= main_~i~0 10), 407307#(= main_~i~0 11), 407304#(= main_~i~0 8), 407305#(= main_~i~0 9), 407318#(= main_~i~0 22), 407319#(= main_~i~0 23), 407316#(= main_~i~0 20), 407317#(= main_~i~0 21), 407314#(= main_~i~0 18), 407315#(= main_~i~0 19), 407312#(= main_~i~0 16), 407313#(= main_~i~0 17), 407326#(= main_~i~0 30), 407327#(= main_~i~0 31), 407324#(= main_~i~0 28), 407325#(= main_~i~0 29), 407322#(= main_~i~0 26), 407323#(= main_~i~0 27), 407320#(= main_~i~0 24), 407321#(= main_~i~0 25), 407334#(= main_~i~0 38), 407335#(= main_~i~0 39), 407332#(= main_~i~0 36), 407333#(= main_~i~0 37), 407330#(= main_~i~0 34), 407331#(= main_~i~0 35), 407328#(= main_~i~0 32), 407329#(= main_~i~0 33), 407342#(= main_~i~0 46), 407343#(= main_~i~0 47), 407340#(= main_~i~0 44), 407341#(= main_~i~0 45), 407338#(= main_~i~0 42), 407339#(= main_~i~0 43), 407336#(= main_~i~0 40), 407337#(= main_~i~0 41), 407350#(= main_~i~0 54), 407351#(= main_~i~0 55), 407348#(= main_~i~0 52), 407349#(= main_~i~0 53), 407346#(= main_~i~0 50), 407347#(= main_~i~0 51), 407344#(= main_~i~0 48), 407345#(= main_~i~0 49), 407358#(= main_~i~0 62), 407359#(= main_~i~0 63), 407356#(= main_~i~0 60), 407357#(= main_~i~0 61), 407354#(= main_~i~0 58), 407355#(= main_~i~0 59), 407352#(= main_~i~0 56), 407353#(= main_~i~0 57), 407364#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 407362#(= main_~i~0 66), 407363#(= main_~i~0 67), 407360#(= main_~i~0 64), 407361#(= main_~i~0 65), 407292#true, 407293#false] [2018-04-13 14:16:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 14:16:29,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 14:16:29,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 14:16:29,696 INFO L87 Difference]: Start difference. First operand 579 states and 682 transitions. Second operand 71 states. [2018-04-13 14:16:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:36,009 INFO L93 Difference]: Finished difference Result 15793 states and 18376 transitions. [2018-04-13 14:16:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 14:16:36,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 347 [2018-04-13 14:16:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:36,023 INFO L225 Difference]: With dead ends: 15793 [2018-04-13 14:16:36,023 INFO L226 Difference]: Without dead ends: 15793 [2018-04-13 14:16:36,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 14:16:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15793 states. [2018-04-13 14:16:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15793 to 584. [2018-04-13 14:16:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-04-13 14:16:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 688 transitions. [2018-04-13 14:16:36,091 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 688 transitions. Word has length 347 [2018-04-13 14:16:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:36,091 INFO L459 AbstractCegarLoop]: Abstraction has 584 states and 688 transitions. [2018-04-13 14:16:36,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 14:16:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 688 transitions. [2018-04-13 14:16:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-13 14:16:36,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:36,092 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:36,092 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1076886122, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:36,094 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 0 proven. 4107 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2018-04-13 14:16:36,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:36,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 14:16:36,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-04-13 14:16:36,598 INFO L182 omatonBuilderFactory]: Interpolants [423751#(= 1 main_~x~0), 423876#(= main_~x~0 26), 423746#(= 0 main_~x~0), 423811#(= main_~x~0 13), 423886#(= main_~x~0 28), 423756#(= main_~x~0 2), 423821#(= main_~x~0 15), 423816#(= main_~x~0 14), 423881#(= main_~x~0 27), 423766#(= main_~x~0 4), 423831#(= main_~x~0 17), 423826#(= main_~x~0 16), 423891#(= main_~x~0 29), 423761#(= main_~x~0 3), 423836#(= main_~x~0 18), 423901#(= main_~x~0 31), 423771#(= main_~x~0 5), 423896#(= main_~x~0 30), 423846#(= main_~x~0 20), 423911#(= main_~x~0 33), 423781#(= main_~x~0 7), 423906#(= main_~x~0 32), 423776#(= main_~x~0 6), 423841#(= main_~x~0 19), 423791#(= main_~x~0 9), 423916#(= main_~x~0 34), 423786#(= main_~x~0 8), 423851#(= main_~x~0 21), 423926#(= main_~x~0 36), 423796#(= main_~x~0 10), 423861#(= main_~x~0 23), 423856#(= main_~x~0 22), 423921#(= main_~x~0 35), 423742#true, 423806#(= main_~x~0 12), 423743#false, 423871#(= main_~x~0 25), 423866#(= main_~x~0 24), 423931#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 423801#(= main_~x~0 11)] [2018-04-13 14:16:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 0 proven. 4107 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2018-04-13 14:16:36,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 14:16:36,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 14:16:36,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 14:16:36,598 INFO L87 Difference]: Start difference. First operand 584 states and 688 transitions. Second operand 40 states. [2018-04-13 14:16:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:37,956 INFO L93 Difference]: Finished difference Result 590 states and 695 transitions. [2018-04-13 14:16:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 14:16:37,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 387 [2018-04-13 14:16:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:37,957 INFO L225 Difference]: With dead ends: 590 [2018-04-13 14:16:37,957 INFO L226 Difference]: Without dead ends: 590 [2018-04-13 14:16:37,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 14:16:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-04-13 14:16:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-04-13 14:16:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-13 14:16:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 695 transitions. [2018-04-13 14:16:37,959 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 695 transitions. Word has length 387 [2018-04-13 14:16:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:37,960 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 695 transitions. [2018-04-13 14:16:37,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 14:16:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 695 transitions. [2018-04-13 14:16:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-13 14:16:37,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:37,961 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:37,961 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1093927849, now seen corresponding path program 69 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:37,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:39,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:39,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-13 14:16:39,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:39,181 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-13 14:16:39,181 INFO L182 omatonBuilderFactory]: Interpolants [425118#(= main_~i~0 2), 425119#(= main_~i~0 3), 425116#(= main_~i~0 0), 425117#(= main_~i~0 1), 425112#true, 425113#false, 425126#(= main_~i~0 10), 425127#(= main_~i~0 11), 425124#(= main_~i~0 8), 425125#(= main_~i~0 9), 425122#(= main_~i~0 6), 425123#(= main_~i~0 7), 425120#(= main_~i~0 4), 425121#(= main_~i~0 5), 425134#(= main_~i~0 18), 425135#(= main_~i~0 19), 425132#(= main_~i~0 16), 425133#(= main_~i~0 17), 425130#(= main_~i~0 14), 425131#(= main_~i~0 15), 425128#(= main_~i~0 12), 425129#(= main_~i~0 13), 425142#(= main_~i~0 26), 425143#(= main_~i~0 27), 425140#(= main_~i~0 24), 425141#(= main_~i~0 25), 425138#(= main_~i~0 22), 425139#(= main_~i~0 23), 425136#(= main_~i~0 20), 425137#(= main_~i~0 21), 425150#(= main_~i~0 34), 425151#(= main_~i~0 35), 425148#(= main_~i~0 32), 425149#(= main_~i~0 33), 425146#(= main_~i~0 30), 425147#(= main_~i~0 31), 425144#(= main_~i~0 28), 425145#(= main_~i~0 29), 425158#(= main_~i~0 42), 425159#(= main_~i~0 43), 425156#(= main_~i~0 40), 425157#(= main_~i~0 41), 425154#(= main_~i~0 38), 425155#(= main_~i~0 39), 425152#(= main_~i~0 36), 425153#(= main_~i~0 37), 425166#(= main_~i~0 50), 425167#(= main_~i~0 51), 425164#(= main_~i~0 48), 425165#(= main_~i~0 49), 425162#(= main_~i~0 46), 425163#(= main_~i~0 47), 425160#(= main_~i~0 44), 425161#(= main_~i~0 45), 425174#(= main_~i~0 58), 425175#(= main_~i~0 59), 425172#(= main_~i~0 56), 425173#(= main_~i~0 57), 425170#(= main_~i~0 54), 425171#(= main_~i~0 55), 425168#(= main_~i~0 52), 425169#(= main_~i~0 53), 425182#(= main_~i~0 66), 425183#(= main_~i~0 67), 425180#(= main_~i~0 64), 425181#(= main_~i~0 65), 425178#(= main_~i~0 62), 425179#(= main_~i~0 63), 425176#(= main_~i~0 60), 425177#(= main_~i~0 61), 425184#(= main_~i~0 68), 425185#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-13 14:16:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:39,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 14:16:39,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 14:16:39,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 14:16:39,182 INFO L87 Difference]: Start difference. First operand 590 states and 695 transitions. Second operand 72 states. [2018-04-13 14:16:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:45,819 INFO L93 Difference]: Finished difference Result 16439 states and 19129 transitions. [2018-04-13 14:16:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 14:16:45,819 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 352 [2018-04-13 14:16:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:45,833 INFO L225 Difference]: With dead ends: 16439 [2018-04-13 14:16:45,833 INFO L226 Difference]: Without dead ends: 16439 [2018-04-13 14:16:45,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 14:16:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16439 states. [2018-04-13 14:16:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16439 to 595. [2018-04-13 14:16:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-04-13 14:16:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 701 transitions. [2018-04-13 14:16:45,915 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 701 transitions. Word has length 352 [2018-04-13 14:16:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:45,916 INFO L459 AbstractCegarLoop]: Abstraction has 595 states and 701 transitions. [2018-04-13 14:16:45,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 14:16:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 701 transitions. [2018-04-13 14:16:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-13 14:16:45,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:45,917 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:45,917 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1693944582, now seen corresponding path program 70 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:45,919 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:47,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:47,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 14:16:47,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:47,131 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-13 14:16:47,131 INFO L182 omatonBuilderFactory]: Interpolants [442246#(= main_~i~0 22), 442247#(= main_~i~0 23), 442244#(= main_~i~0 20), 442245#(= main_~i~0 21), 442242#(= main_~i~0 18), 442243#(= main_~i~0 19), 442240#(= main_~i~0 16), 442241#(= main_~i~0 17), 442254#(= main_~i~0 30), 442255#(= main_~i~0 31), 442252#(= main_~i~0 28), 442253#(= main_~i~0 29), 442250#(= main_~i~0 26), 442251#(= main_~i~0 27), 442248#(= main_~i~0 24), 442249#(= main_~i~0 25), 442262#(= main_~i~0 38), 442263#(= main_~i~0 39), 442260#(= main_~i~0 36), 442261#(= main_~i~0 37), 442258#(= main_~i~0 34), 442259#(= main_~i~0 35), 442256#(= main_~i~0 32), 442257#(= main_~i~0 33), 442270#(= main_~i~0 46), 442271#(= main_~i~0 47), 442268#(= main_~i~0 44), 442269#(= main_~i~0 45), 442266#(= main_~i~0 42), 442267#(= main_~i~0 43), 442264#(= main_~i~0 40), 442265#(= main_~i~0 41), 442278#(= main_~i~0 54), 442279#(= main_~i~0 55), 442276#(= main_~i~0 52), 442277#(= main_~i~0 53), 442274#(= main_~i~0 50), 442275#(= main_~i~0 51), 442272#(= main_~i~0 48), 442273#(= main_~i~0 49), 442286#(= main_~i~0 62), 442287#(= main_~i~0 63), 442284#(= main_~i~0 60), 442285#(= main_~i~0 61), 442282#(= main_~i~0 58), 442283#(= main_~i~0 59), 442280#(= main_~i~0 56), 442281#(= main_~i~0 57), 442294#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 442292#(= main_~i~0 68), 442293#(= main_~i~0 69), 442290#(= main_~i~0 66), 442291#(= main_~i~0 67), 442288#(= main_~i~0 64), 442289#(= main_~i~0 65), 442220#true, 442221#false, 442230#(= main_~i~0 6), 442231#(= main_~i~0 7), 442228#(= main_~i~0 4), 442229#(= main_~i~0 5), 442226#(= main_~i~0 2), 442227#(= main_~i~0 3), 442224#(= main_~i~0 0), 442225#(= main_~i~0 1), 442238#(= main_~i~0 14), 442239#(= main_~i~0 15), 442236#(= main_~i~0 12), 442237#(= main_~i~0 13), 442234#(= main_~i~0 10), 442235#(= main_~i~0 11), 442232#(= main_~i~0 8), 442233#(= main_~i~0 9)] [2018-04-13 14:16:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:47,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 14:16:47,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 14:16:47,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 14:16:47,132 INFO L87 Difference]: Start difference. First operand 595 states and 701 transitions. Second operand 73 states. [2018-04-13 14:16:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:53,923 INFO L93 Difference]: Finished difference Result 16677 states and 19406 transitions. [2018-04-13 14:16:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 14:16:53,923 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 357 [2018-04-13 14:16:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:53,937 INFO L225 Difference]: With dead ends: 16677 [2018-04-13 14:16:53,937 INFO L226 Difference]: Without dead ends: 16677 [2018-04-13 14:16:53,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 14:16:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16677 states. [2018-04-13 14:16:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16677 to 600. [2018-04-13 14:16:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-04-13 14:16:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 707 transitions. [2018-04-13 14:16:54,008 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 707 transitions. Word has length 357 [2018-04-13 14:16:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:54,008 INFO L459 AbstractCegarLoop]: Abstraction has 600 states and 707 transitions. [2018-04-13 14:16:54,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 14:16:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 707 transitions. [2018-04-13 14:16:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-13 14:16:54,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:54,009 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:54,009 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1129276211, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:54,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7147 backedges. 0 proven. 4332 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2018-04-13 14:16:54,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:54,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 14:16:54,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-04-13 14:16:54,552 INFO L182 omatonBuilderFactory]: Interpolants [459591#(= main_~x~0 3), 459716#(= main_~x~0 28), 459651#(= main_~x~0 15), 459586#(= main_~x~0 2), 459726#(= main_~x~0 30), 459661#(= main_~x~0 17), 459596#(= main_~x~0 4), 459721#(= main_~x~0 29), 459656#(= main_~x~0 16), 459671#(= main_~x~0 19), 459606#(= main_~x~0 6), 459731#(= main_~x~0 31), 459666#(= main_~x~0 18), 459601#(= main_~x~0 5), 459741#(= main_~x~0 33), 459676#(= main_~x~0 20), 459611#(= main_~x~0 7), 459736#(= main_~x~0 32), 459751#(= main_~x~0 35), 459686#(= main_~x~0 22), 459621#(= main_~x~0 9), 459746#(= main_~x~0 34), 459681#(= main_~x~0 21), 459616#(= main_~x~0 8), 459631#(= main_~x~0 11), 459756#(= main_~x~0 36), 459691#(= main_~x~0 23), 459626#(= main_~x~0 10), 459766#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 459573#false, 459701#(= main_~x~0 25), 459572#true, 459636#(= main_~x~0 12), 459761#(= main_~x~0 37), 459696#(= main_~x~0 24), 459711#(= main_~x~0 27), 459646#(= main_~x~0 14), 459581#(= 1 main_~x~0), 459706#(= main_~x~0 26), 459641#(= main_~x~0 13), 459576#(= 0 main_~x~0)] [2018-04-13 14:16:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7147 backedges. 0 proven. 4332 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2018-04-13 14:16:54,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 14:16:54,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 14:16:54,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 14:16:54,553 INFO L87 Difference]: Start difference. First operand 600 states and 707 transitions. Second operand 41 states. [2018-04-13 14:16:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:16:56,068 INFO L93 Difference]: Finished difference Result 606 states and 714 transitions. [2018-04-13 14:16:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 14:16:56,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 397 [2018-04-13 14:16:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:16:56,069 INFO L225 Difference]: With dead ends: 606 [2018-04-13 14:16:56,069 INFO L226 Difference]: Without dead ends: 606 [2018-04-13 14:16:56,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 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-13 14:16:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-13 14:16:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2018-04-13 14:16:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-04-13 14:16:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 714 transitions. [2018-04-13 14:16:56,072 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 714 transitions. Word has length 397 [2018-04-13 14:16:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:16:56,072 INFO L459 AbstractCegarLoop]: Abstraction has 606 states and 714 transitions. [2018-04-13 14:16:56,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 14:16:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 714 transitions. [2018-04-13 14:16:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-13 14:16:56,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:16:56,073 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-13 14:16:56,073 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:16:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1551159735, now seen corresponding path program 71 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:16:56,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:16:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:16:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:57,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:16:57,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-13 14:16:57,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:16:57,320 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-13 14:16:57,320 INFO L182 omatonBuilderFactory]: Interpolants [460983#(= main_~i~0 0), 460980#false, 460979#true, 460991#(= main_~i~0 8), 460990#(= main_~i~0 7), 460989#(= main_~i~0 6), 460988#(= main_~i~0 5), 460987#(= main_~i~0 4), 460986#(= main_~i~0 3), 460985#(= main_~i~0 2), 460984#(= main_~i~0 1), 460999#(= main_~i~0 16), 460998#(= main_~i~0 15), 460997#(= main_~i~0 14), 460996#(= main_~i~0 13), 460995#(= main_~i~0 12), 460994#(= main_~i~0 11), 460993#(= main_~i~0 10), 460992#(= main_~i~0 9), 461007#(= main_~i~0 24), 461006#(= main_~i~0 23), 461005#(= main_~i~0 22), 461004#(= main_~i~0 21), 461003#(= main_~i~0 20), 461002#(= main_~i~0 19), 461001#(= main_~i~0 18), 461000#(= main_~i~0 17), 461015#(= main_~i~0 32), 461014#(= main_~i~0 31), 461013#(= main_~i~0 30), 461012#(= main_~i~0 29), 461011#(= main_~i~0 28), 461010#(= main_~i~0 27), 461009#(= main_~i~0 26), 461008#(= main_~i~0 25), 461023#(= main_~i~0 40), 461022#(= main_~i~0 39), 461021#(= main_~i~0 38), 461020#(= main_~i~0 37), 461019#(= main_~i~0 36), 461018#(= main_~i~0 35), 461017#(= main_~i~0 34), 461016#(= main_~i~0 33), 461031#(= main_~i~0 48), 461030#(= main_~i~0 47), 461029#(= main_~i~0 46), 461028#(= main_~i~0 45), 461027#(= main_~i~0 44), 461026#(= main_~i~0 43), 461025#(= main_~i~0 42), 461024#(= main_~i~0 41), 461039#(= main_~i~0 56), 461038#(= main_~i~0 55), 461037#(= main_~i~0 54), 461036#(= main_~i~0 53), 461035#(= main_~i~0 52), 461034#(= main_~i~0 51), 461033#(= main_~i~0 50), 461032#(= main_~i~0 49), 461047#(= main_~i~0 64), 461046#(= main_~i~0 63), 461045#(= main_~i~0 62), 461044#(= main_~i~0 61), 461043#(= main_~i~0 60), 461042#(= main_~i~0 59), 461041#(= main_~i~0 58), 461040#(= main_~i~0 57), 461054#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 461053#(= main_~i~0 70), 461052#(= main_~i~0 69), 461051#(= main_~i~0 68), 461050#(= main_~i~0 67), 461049#(= main_~i~0 66), 461048#(= main_~i~0 65)] [2018-04-13 14:16:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:16:57,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 14:16:57,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 14:16:57,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 14:16:57,321 INFO L87 Difference]: Start difference. First operand 606 states and 714 transitions. Second operand 74 states. [2018-04-13 14:17:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:04,528 INFO L93 Difference]: Finished difference Result 17341 states and 20180 transitions. [2018-04-13 14:17:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 14:17:04,529 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 362 [2018-04-13 14:17:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:04,544 INFO L225 Difference]: With dead ends: 17341 [2018-04-13 14:17:04,544 INFO L226 Difference]: Without dead ends: 17341 [2018-04-13 14:17:04,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 14:17:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17341 states. [2018-04-13 14:17:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17341 to 611. [2018-04-13 14:17:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-04-13 14:17:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 720 transitions. [2018-04-13 14:17:04,619 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 720 transitions. Word has length 362 [2018-04-13 14:17:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:04,619 INFO L459 AbstractCegarLoop]: Abstraction has 611 states and 720 transitions. [2018-04-13 14:17:04,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 14:17:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 720 transitions. [2018-04-13 14:17:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-13 14:17:04,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:04,620 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:04,620 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:04,621 INFO L82 PathProgramCache]: Analyzing trace with hash 744296870, now seen corresponding path program 72 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:04,623 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:05,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:05,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 14:17:05,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:05,907 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-13 14:17:05,907 INFO L182 omatonBuilderFactory]: Interpolants [479007#true, 479015#(= main_~i~0 4), 479014#(= main_~i~0 3), 479013#(= main_~i~0 2), 479012#(= main_~i~0 1), 479011#(= main_~i~0 0), 479008#false, 479023#(= main_~i~0 12), 479022#(= main_~i~0 11), 479021#(= main_~i~0 10), 479020#(= main_~i~0 9), 479019#(= main_~i~0 8), 479018#(= main_~i~0 7), 479017#(= main_~i~0 6), 479016#(= main_~i~0 5), 479031#(= main_~i~0 20), 479030#(= main_~i~0 19), 479029#(= main_~i~0 18), 479028#(= main_~i~0 17), 479027#(= main_~i~0 16), 479026#(= main_~i~0 15), 479025#(= main_~i~0 14), 479024#(= main_~i~0 13), 479039#(= main_~i~0 28), 479038#(= main_~i~0 27), 479037#(= main_~i~0 26), 479036#(= main_~i~0 25), 479035#(= main_~i~0 24), 479034#(= main_~i~0 23), 479033#(= main_~i~0 22), 479032#(= main_~i~0 21), 479047#(= main_~i~0 36), 479046#(= main_~i~0 35), 479045#(= main_~i~0 34), 479044#(= main_~i~0 33), 479043#(= main_~i~0 32), 479042#(= main_~i~0 31), 479041#(= main_~i~0 30), 479040#(= main_~i~0 29), 479055#(= main_~i~0 44), 479054#(= main_~i~0 43), 479053#(= main_~i~0 42), 479052#(= main_~i~0 41), 479051#(= main_~i~0 40), 479050#(= main_~i~0 39), 479049#(= main_~i~0 38), 479048#(= main_~i~0 37), 479063#(= main_~i~0 52), 479062#(= main_~i~0 51), 479061#(= main_~i~0 50), 479060#(= main_~i~0 49), 479059#(= main_~i~0 48), 479058#(= main_~i~0 47), 479057#(= main_~i~0 46), 479056#(= main_~i~0 45), 479071#(= main_~i~0 60), 479070#(= main_~i~0 59), 479069#(= main_~i~0 58), 479068#(= main_~i~0 57), 479067#(= main_~i~0 56), 479066#(= main_~i~0 55), 479065#(= main_~i~0 54), 479064#(= main_~i~0 53), 479079#(= main_~i~0 68), 479078#(= main_~i~0 67), 479077#(= main_~i~0 66), 479076#(= main_~i~0 65), 479075#(= main_~i~0 64), 479074#(= main_~i~0 63), 479073#(= main_~i~0 62), 479072#(= main_~i~0 61), 479083#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 479082#(= main_~i~0 71), 479081#(= main_~i~0 70), 479080#(= main_~i~0 69)] [2018-04-13 14:17:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:05,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 14:17:05,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 14:17:05,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 14:17:05,908 INFO L87 Difference]: Start difference. First operand 611 states and 720 transitions. Second operand 75 states. [2018-04-13 14:17:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:12,953 INFO L93 Difference]: Finished difference Result 17585 states and 20464 transitions. [2018-04-13 14:17:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 14:17:12,953 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 367 [2018-04-13 14:17:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:12,967 INFO L225 Difference]: With dead ends: 17585 [2018-04-13 14:17:12,968 INFO L226 Difference]: Without dead ends: 17585 [2018-04-13 14:17:12,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 14:17:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17585 states. [2018-04-13 14:17:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17585 to 616. [2018-04-13 14:17:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-04-13 14:17:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 726 transitions. [2018-04-13 14:17:13,067 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 726 transitions. Word has length 367 [2018-04-13 14:17:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:13,067 INFO L459 AbstractCegarLoop]: Abstraction has 616 states and 726 transitions. [2018-04-13 14:17:13,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 14:17:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 726 transitions. [2018-04-13 14:17:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-13 14:17:13,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:13,068 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:13,068 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash 423633040, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:13,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7530 backedges. 0 proven. 4563 refuted. 0 times theorem prover too weak. 2967 trivial. 0 not checked. [2018-04-13 14:17:13,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:13,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 14:17:13,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-04-13 14:17:13,585 INFO L182 omatonBuilderFactory]: Interpolants [497479#(= main_~x~0 38), 497286#false, 497414#(= main_~x~0 25), 497285#true, 497349#(= main_~x~0 12), 497474#(= main_~x~0 37), 497409#(= main_~x~0 24), 497344#(= main_~x~0 11), 497359#(= main_~x~0 14), 497294#(= 1 main_~x~0), 497484#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 497419#(= main_~x~0 26), 497354#(= main_~x~0 13), 497289#(= 0 main_~x~0), 497429#(= main_~x~0 28), 497364#(= main_~x~0 15), 497299#(= main_~x~0 2), 497424#(= main_~x~0 27), 497439#(= main_~x~0 30), 497374#(= main_~x~0 17), 497309#(= main_~x~0 4), 497434#(= main_~x~0 29), 497369#(= main_~x~0 16), 497304#(= main_~x~0 3), 497319#(= main_~x~0 6), 497444#(= main_~x~0 31), 497379#(= main_~x~0 18), 497314#(= main_~x~0 5), 497454#(= main_~x~0 33), 497389#(= main_~x~0 20), 497324#(= main_~x~0 7), 497449#(= main_~x~0 32), 497384#(= main_~x~0 19), 497399#(= main_~x~0 22), 497334#(= main_~x~0 9), 497459#(= main_~x~0 34), 497394#(= main_~x~0 21), 497329#(= main_~x~0 8), 497469#(= main_~x~0 36), 497404#(= main_~x~0 23), 497339#(= main_~x~0 10), 497464#(= main_~x~0 35)] [2018-04-13 14:17:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7530 backedges. 0 proven. 4563 refuted. 0 times theorem prover too weak. 2967 trivial. 0 not checked. [2018-04-13 14:17:13,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 14:17:13,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 14:17:13,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 14:17:13,586 INFO L87 Difference]: Start difference. First operand 616 states and 726 transitions. Second operand 42 states. [2018-04-13 14:17:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:15,123 INFO L93 Difference]: Finished difference Result 622 states and 733 transitions. [2018-04-13 14:17:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 14:17:15,123 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 407 [2018-04-13 14:17:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:15,124 INFO L225 Difference]: With dead ends: 622 [2018-04-13 14:17:15,124 INFO L226 Difference]: Without dead ends: 622 [2018-04-13 14:17:15,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 14:17:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-04-13 14:17:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-04-13 14:17:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-04-13 14:17:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 733 transitions. [2018-04-13 14:17:15,126 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 733 transitions. Word has length 407 [2018-04-13 14:17:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:15,127 INFO L459 AbstractCegarLoop]: Abstraction has 622 states and 733 transitions. [2018-04-13 14:17:15,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 14:17:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 733 transitions. [2018-04-13 14:17:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-13 14:17:15,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:15,128 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:15,128 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 647655191, now seen corresponding path program 73 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:15,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:16,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:16,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 14:17:16,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:16,478 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-13 14:17:16,478 INFO L182 omatonBuilderFactory]: Interpolants [498735#(= main_~i~0 2), 498734#(= main_~i~0 1), 498733#(= main_~i~0 0), 498730#false, 498729#true, 498743#(= main_~i~0 10), 498742#(= main_~i~0 9), 498741#(= main_~i~0 8), 498740#(= main_~i~0 7), 498739#(= main_~i~0 6), 498738#(= main_~i~0 5), 498737#(= main_~i~0 4), 498736#(= main_~i~0 3), 498751#(= main_~i~0 18), 498750#(= main_~i~0 17), 498749#(= main_~i~0 16), 498748#(= main_~i~0 15), 498747#(= main_~i~0 14), 498746#(= main_~i~0 13), 498745#(= main_~i~0 12), 498744#(= main_~i~0 11), 498759#(= main_~i~0 26), 498758#(= main_~i~0 25), 498757#(= main_~i~0 24), 498756#(= main_~i~0 23), 498755#(= main_~i~0 22), 498754#(= main_~i~0 21), 498753#(= main_~i~0 20), 498752#(= main_~i~0 19), 498767#(= main_~i~0 34), 498766#(= main_~i~0 33), 498765#(= main_~i~0 32), 498764#(= main_~i~0 31), 498763#(= main_~i~0 30), 498762#(= main_~i~0 29), 498761#(= main_~i~0 28), 498760#(= main_~i~0 27), 498775#(= main_~i~0 42), 498774#(= main_~i~0 41), 498773#(= main_~i~0 40), 498772#(= main_~i~0 39), 498771#(= main_~i~0 38), 498770#(= main_~i~0 37), 498769#(= main_~i~0 36), 498768#(= main_~i~0 35), 498783#(= main_~i~0 50), 498782#(= main_~i~0 49), 498781#(= main_~i~0 48), 498780#(= main_~i~0 47), 498779#(= main_~i~0 46), 498778#(= main_~i~0 45), 498777#(= main_~i~0 44), 498776#(= main_~i~0 43), 498791#(= main_~i~0 58), 498790#(= main_~i~0 57), 498789#(= main_~i~0 56), 498788#(= main_~i~0 55), 498787#(= main_~i~0 54), 498786#(= main_~i~0 53), 498785#(= main_~i~0 52), 498784#(= main_~i~0 51), 498799#(= main_~i~0 66), 498798#(= main_~i~0 65), 498797#(= main_~i~0 64), 498796#(= main_~i~0 63), 498795#(= main_~i~0 62), 498794#(= main_~i~0 61), 498793#(= main_~i~0 60), 498792#(= main_~i~0 59), 498806#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 498805#(= main_~i~0 72), 498804#(= main_~i~0 71), 498803#(= main_~i~0 70), 498802#(= main_~i~0 69), 498801#(= main_~i~0 68), 498800#(= main_~i~0 67)] [2018-04-13 14:17:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:16,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 14:17:16,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 14:17:16,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 14:17:16,479 INFO L87 Difference]: Start difference. First operand 622 states and 733 transitions. Second operand 76 states. [2018-04-13 14:17:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:23,847 INFO L93 Difference]: Finished difference Result 18267 states and 21259 transitions. [2018-04-13 14:17:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 14:17:23,848 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 372 [2018-04-13 14:17:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:23,864 INFO L225 Difference]: With dead ends: 18267 [2018-04-13 14:17:23,864 INFO L226 Difference]: Without dead ends: 18267 [2018-04-13 14:17:23,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 14:17:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18267 states. [2018-04-13 14:17:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18267 to 627. [2018-04-13 14:17:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-04-13 14:17:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions. [2018-04-13 14:17:23,942 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 372 [2018-04-13 14:17:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:23,942 INFO L459 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions. [2018-04-13 14:17:23,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 14:17:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions. [2018-04-13 14:17:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-13 14:17:23,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:23,944 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:23,944 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash 842894765, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:23,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7923 backedges. 0 proven. 4800 refuted. 0 times theorem prover too weak. 3123 trivial. 0 not checked. [2018-04-13 14:17:24,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:24,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 14:17:24,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-04-13 14:17:24,493 INFO L182 omatonBuilderFactory]: Interpolants [517895#(= main_~x~0 38), 517702#false, 517830#(= main_~x~0 25), 517701#true, 517765#(= main_~x~0 12), 517890#(= main_~x~0 37), 517825#(= main_~x~0 24), 517760#(= main_~x~0 11), 517775#(= main_~x~0 14), 517710#(= 1 main_~x~0), 517900#(= main_~x~0 39), 517835#(= main_~x~0 26), 517770#(= main_~x~0 13), 517705#(= 0 main_~x~0), 517845#(= main_~x~0 28), 517780#(= main_~x~0 15), 517715#(= main_~x~0 2), 517905#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 517840#(= main_~x~0 27), 517855#(= main_~x~0 30), 517790#(= main_~x~0 17), 517725#(= main_~x~0 4), 517850#(= main_~x~0 29), 517785#(= main_~x~0 16), 517720#(= main_~x~0 3), 517735#(= main_~x~0 6), 517860#(= main_~x~0 31), 517795#(= main_~x~0 18), 517730#(= main_~x~0 5), 517870#(= main_~x~0 33), 517805#(= main_~x~0 20), 517740#(= main_~x~0 7), 517865#(= main_~x~0 32), 517800#(= main_~x~0 19), 517815#(= main_~x~0 22), 517750#(= main_~x~0 9), 517875#(= main_~x~0 34), 517810#(= main_~x~0 21), 517745#(= main_~x~0 8), 517885#(= main_~x~0 36), 517820#(= main_~x~0 23), 517755#(= main_~x~0 10), 517880#(= main_~x~0 35)] [2018-04-13 14:17:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7923 backedges. 0 proven. 4800 refuted. 0 times theorem prover too weak. 3123 trivial. 0 not checked. [2018-04-13 14:17:24,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 14:17:24,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 14:17:24,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 14:17:24,494 INFO L87 Difference]: Start difference. First operand 627 states and 739 transitions. Second operand 43 states. [2018-04-13 14:17:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:26,090 INFO L93 Difference]: Finished difference Result 633 states and 746 transitions. [2018-04-13 14:17:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 14:17:26,090 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 417 [2018-04-13 14:17:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:26,091 INFO L225 Difference]: With dead ends: 633 [2018-04-13 14:17:26,091 INFO L226 Difference]: Without dead ends: 633 [2018-04-13 14:17:26,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 83 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-13 14:17:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-04-13 14:17:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-04-13 14:17:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-13 14:17:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2018-04-13 14:17:26,094 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 417 [2018-04-13 14:17:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:26,094 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2018-04-13 14:17:26,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 14:17:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2018-04-13 14:17:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-13 14:17:26,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:26,103 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:26,103 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2114113606, now seen corresponding path program 74 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:26,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:27,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:27,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-13 14:17:27,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:27,446 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-13 14:17:27,447 INFO L182 omatonBuilderFactory]: Interpolants [519173#false, 519172#true, 519183#(= main_~i~0 7), 519182#(= main_~i~0 6), 519181#(= main_~i~0 5), 519180#(= main_~i~0 4), 519179#(= main_~i~0 3), 519178#(= main_~i~0 2), 519177#(= main_~i~0 1), 519176#(= main_~i~0 0), 519191#(= main_~i~0 15), 519190#(= main_~i~0 14), 519189#(= main_~i~0 13), 519188#(= main_~i~0 12), 519187#(= main_~i~0 11), 519186#(= main_~i~0 10), 519185#(= main_~i~0 9), 519184#(= main_~i~0 8), 519199#(= main_~i~0 23), 519198#(= main_~i~0 22), 519197#(= main_~i~0 21), 519196#(= main_~i~0 20), 519195#(= main_~i~0 19), 519194#(= main_~i~0 18), 519193#(= main_~i~0 17), 519192#(= main_~i~0 16), 519207#(= main_~i~0 31), 519206#(= main_~i~0 30), 519205#(= main_~i~0 29), 519204#(= main_~i~0 28), 519203#(= main_~i~0 27), 519202#(= main_~i~0 26), 519201#(= main_~i~0 25), 519200#(= main_~i~0 24), 519215#(= main_~i~0 39), 519214#(= main_~i~0 38), 519213#(= main_~i~0 37), 519212#(= main_~i~0 36), 519211#(= main_~i~0 35), 519210#(= main_~i~0 34), 519209#(= main_~i~0 33), 519208#(= main_~i~0 32), 519223#(= main_~i~0 47), 519222#(= main_~i~0 46), 519221#(= main_~i~0 45), 519220#(= main_~i~0 44), 519219#(= main_~i~0 43), 519218#(= main_~i~0 42), 519217#(= main_~i~0 41), 519216#(= main_~i~0 40), 519231#(= main_~i~0 55), 519230#(= main_~i~0 54), 519229#(= main_~i~0 53), 519228#(= main_~i~0 52), 519227#(= main_~i~0 51), 519226#(= main_~i~0 50), 519225#(= main_~i~0 49), 519224#(= main_~i~0 48), 519239#(= main_~i~0 63), 519238#(= main_~i~0 62), 519237#(= main_~i~0 61), 519236#(= main_~i~0 60), 519235#(= main_~i~0 59), 519234#(= main_~i~0 58), 519233#(= main_~i~0 57), 519232#(= main_~i~0 56), 519247#(= main_~i~0 71), 519246#(= main_~i~0 70), 519245#(= main_~i~0 69), 519244#(= main_~i~0 68), 519243#(= main_~i~0 67), 519242#(= main_~i~0 66), 519241#(= main_~i~0 65), 519240#(= main_~i~0 64), 519250#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 519249#(= main_~i~0 73), 519248#(= main_~i~0 72)] [2018-04-13 14:17:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:27,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 14:17:27,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 14:17:27,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 14:17:27,448 INFO L87 Difference]: Start difference. First operand 633 states and 746 transitions. Second operand 77 states. [2018-04-13 14:17:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:34,949 INFO L93 Difference]: Finished difference Result 18961 states and 22068 transitions. [2018-04-13 14:17:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 14:17:34,949 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 377 [2018-04-13 14:17:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:34,965 INFO L225 Difference]: With dead ends: 18961 [2018-04-13 14:17:34,966 INFO L226 Difference]: Without dead ends: 18961 [2018-04-13 14:17:34,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 14:17:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18961 states. [2018-04-13 14:17:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18961 to 638. [2018-04-13 14:17:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-13 14:17:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 752 transitions. [2018-04-13 14:17:35,061 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 752 transitions. Word has length 377 [2018-04-13 14:17:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:35,062 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 752 transitions. [2018-04-13 14:17:35,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 14:17:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 752 transitions. [2018-04-13 14:17:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-13 14:17:35,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:35,063 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:35,063 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1575146615, now seen corresponding path program 75 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:35,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:36,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:36,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-13 14:17:36,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:36,421 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-13 14:17:36,421 INFO L182 omatonBuilderFactory]: Interpolants [538888#(= main_~i~0 34), 538889#(= main_~i~0 35), 538890#(= main_~i~0 36), 538891#(= main_~i~0 37), 538892#(= main_~i~0 38), 538893#(= main_~i~0 39), 538894#(= main_~i~0 40), 538895#(= main_~i~0 41), 538880#(= main_~i~0 26), 538881#(= main_~i~0 27), 538882#(= main_~i~0 28), 538883#(= main_~i~0 29), 538884#(= main_~i~0 30), 538885#(= main_~i~0 31), 538886#(= main_~i~0 32), 538887#(= main_~i~0 33), 538904#(= main_~i~0 50), 538905#(= main_~i~0 51), 538906#(= main_~i~0 52), 538907#(= main_~i~0 53), 538908#(= main_~i~0 54), 538909#(= main_~i~0 55), 538910#(= main_~i~0 56), 538911#(= main_~i~0 57), 538896#(= main_~i~0 42), 538897#(= main_~i~0 43), 538898#(= main_~i~0 44), 538899#(= main_~i~0 45), 538900#(= main_~i~0 46), 538901#(= main_~i~0 47), 538902#(= main_~i~0 48), 538903#(= main_~i~0 49), 538920#(= main_~i~0 66), 538921#(= main_~i~0 67), 538922#(= main_~i~0 68), 538923#(= main_~i~0 69), 538924#(= main_~i~0 70), 538925#(= main_~i~0 71), 538926#(= main_~i~0 72), 538927#(= main_~i~0 73), 538912#(= main_~i~0 58), 538913#(= main_~i~0 59), 538914#(= main_~i~0 60), 538915#(= main_~i~0 61), 538916#(= main_~i~0 62), 538917#(= main_~i~0 63), 538918#(= main_~i~0 64), 538919#(= main_~i~0 65), 538928#(= main_~i~0 74), 538929#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 538856#(= main_~i~0 2), 538857#(= main_~i~0 3), 538858#(= main_~i~0 4), 538859#(= main_~i~0 5), 538860#(= main_~i~0 6), 538861#(= main_~i~0 7), 538862#(= main_~i~0 8), 538863#(= main_~i~0 9), 538850#true, 538851#false, 538854#(= main_~i~0 0), 538855#(= main_~i~0 1), 538872#(= main_~i~0 18), 538873#(= main_~i~0 19), 538874#(= main_~i~0 20), 538875#(= main_~i~0 21), 538876#(= main_~i~0 22), 538877#(= main_~i~0 23), 538878#(= main_~i~0 24), 538879#(= main_~i~0 25), 538864#(= main_~i~0 10), 538865#(= main_~i~0 11), 538866#(= main_~i~0 12), 538867#(= main_~i~0 13), 538868#(= main_~i~0 14), 538869#(= main_~i~0 15), 538870#(= main_~i~0 16), 538871#(= main_~i~0 17)] [2018-04-13 14:17:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:36,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 14:17:36,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 14:17:36,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 14:17:36,422 INFO L87 Difference]: Start difference. First operand 638 states and 752 transitions. Second operand 78 states. [2018-04-13 14:17:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:44,156 INFO L93 Difference]: Finished difference Result 19217 states and 22366 transitions. [2018-04-13 14:17:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 14:17:44,157 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 382 [2018-04-13 14:17:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:44,173 INFO L225 Difference]: With dead ends: 19217 [2018-04-13 14:17:44,173 INFO L226 Difference]: Without dead ends: 19217 [2018-04-13 14:17:44,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 14:17:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2018-04-13 14:17:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 643. [2018-04-13 14:17:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-04-13 14:17:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 758 transitions. [2018-04-13 14:17:44,253 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 758 transitions. Word has length 382 [2018-04-13 14:17:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:44,253 INFO L459 AbstractCegarLoop]: Abstraction has 643 states and 758 transitions. [2018-04-13 14:17:44,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 14:17:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 758 transitions. [2018-04-13 14:17:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-13 14:17:44,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:44,255 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:44,255 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash 822016650, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:44,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 5043 refuted. 0 times theorem prover too weak. 3283 trivial. 0 not checked. [2018-04-13 14:17:44,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:44,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 14:17:44,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-04-13 14:17:44,814 INFO L182 omatonBuilderFactory]: Interpolants [558984#(= main_~x~0 38), 558794#(= 0 main_~x~0), 558859#(= main_~x~0 13), 558924#(= main_~x~0 26), 558989#(= main_~x~0 39), 558799#(= 1 main_~x~0), 558849#(= main_~x~0 11), 558914#(= main_~x~0 24), 558979#(= main_~x~0 37), 558790#true, 558854#(= main_~x~0 12), 558791#false, 558919#(= main_~x~0 25), 558809#(= main_~x~0 3), 558874#(= main_~x~0 16), 558939#(= main_~x~0 29), 558814#(= main_~x~0 4), 558879#(= main_~x~0 17), 558864#(= main_~x~0 14), 558929#(= main_~x~0 27), 558994#(= main_~x~0 40), 558804#(= main_~x~0 2), 558869#(= main_~x~0 15), 558934#(= main_~x~0 28), 558999#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 558824#(= main_~x~0 6), 558889#(= main_~x~0 19), 558954#(= main_~x~0 32), 558829#(= main_~x~0 7), 558894#(= main_~x~0 20), 558959#(= main_~x~0 33), 558944#(= main_~x~0 30), 558819#(= main_~x~0 5), 558884#(= main_~x~0 18), 558949#(= main_~x~0 31), 558904#(= main_~x~0 22), 558969#(= main_~x~0 35), 558844#(= main_~x~0 10), 558909#(= main_~x~0 23), 558974#(= main_~x~0 36), 558834#(= main_~x~0 8), 558899#(= main_~x~0 21), 558964#(= main_~x~0 34), 558839#(= main_~x~0 9)] [2018-04-13 14:17:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 5043 refuted. 0 times theorem prover too weak. 3283 trivial. 0 not checked. [2018-04-13 14:17:44,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 14:17:44,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 14:17:44,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 14:17:44,814 INFO L87 Difference]: Start difference. First operand 643 states and 758 transitions. Second operand 44 states. [2018-04-13 14:17:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:46,527 INFO L93 Difference]: Finished difference Result 649 states and 765 transitions. [2018-04-13 14:17:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 14:17:46,527 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 427 [2018-04-13 14:17:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:46,528 INFO L225 Difference]: With dead ends: 649 [2018-04-13 14:17:46,528 INFO L226 Difference]: Without dead ends: 649 [2018-04-13 14:17:46,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 14:17:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-04-13 14:17:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2018-04-13 14:17:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-04-13 14:17:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 765 transitions. [2018-04-13 14:17:46,530 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 765 transitions. Word has length 427 [2018-04-13 14:17:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:46,531 INFO L459 AbstractCegarLoop]: Abstraction has 649 states and 765 transitions. [2018-04-13 14:17:46,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 14:17:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 765 transitions. [2018-04-13 14:17:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-13 14:17:46,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:46,532 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:46,532 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1862088986, now seen corresponding path program 76 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:46,534 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:47,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:47,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-13 14:17:47,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:47,991 INFO L182 omatonBuilderFactory]: Interpolants [560298#true, 560299#false, 560302#(= main_~i~0 0), 560303#(= main_~i~0 1), 560312#(= main_~i~0 10), 560313#(= main_~i~0 11), 560314#(= main_~i~0 12), 560315#(= main_~i~0 13), 560316#(= main_~i~0 14), 560317#(= main_~i~0 15), 560318#(= main_~i~0 16), 560319#(= main_~i~0 17), 560304#(= main_~i~0 2), 560305#(= main_~i~0 3), 560306#(= main_~i~0 4), 560307#(= main_~i~0 5), 560308#(= main_~i~0 6), 560309#(= main_~i~0 7), 560310#(= main_~i~0 8), 560311#(= main_~i~0 9), 560328#(= main_~i~0 26), 560329#(= main_~i~0 27), 560330#(= main_~i~0 28), 560331#(= main_~i~0 29), 560332#(= main_~i~0 30), 560333#(= main_~i~0 31), 560334#(= main_~i~0 32), 560335#(= main_~i~0 33), 560320#(= main_~i~0 18), 560321#(= main_~i~0 19), 560322#(= main_~i~0 20), 560323#(= main_~i~0 21), 560324#(= main_~i~0 22), 560325#(= main_~i~0 23), 560326#(= main_~i~0 24), 560327#(= main_~i~0 25), 560344#(= main_~i~0 42), 560345#(= main_~i~0 43), 560346#(= main_~i~0 44), 560347#(= main_~i~0 45), 560348#(= main_~i~0 46), 560349#(= main_~i~0 47), 560350#(= main_~i~0 48), 560351#(= main_~i~0 49), 560336#(= main_~i~0 34), 560337#(= main_~i~0 35), 560338#(= main_~i~0 36), 560339#(= main_~i~0 37), 560340#(= main_~i~0 38), 560341#(= main_~i~0 39), 560342#(= main_~i~0 40), 560343#(= main_~i~0 41), 560360#(= main_~i~0 58), 560361#(= main_~i~0 59), 560362#(= main_~i~0 60), 560363#(= main_~i~0 61), 560364#(= main_~i~0 62), 560365#(= main_~i~0 63), 560366#(= main_~i~0 64), 560367#(= main_~i~0 65), 560352#(= main_~i~0 50), 560353#(= main_~i~0 51), 560354#(= main_~i~0 52), 560355#(= main_~i~0 53), 560356#(= main_~i~0 54), 560357#(= main_~i~0 55), 560358#(= main_~i~0 56), 560359#(= main_~i~0 57), 560376#(= main_~i~0 74), 560377#(= main_~i~0 75), 560378#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 560368#(= main_~i~0 66), 560369#(= main_~i~0 67), 560370#(= main_~i~0 68), 560371#(= main_~i~0 69), 560372#(= main_~i~0 70), 560373#(= main_~i~0 71), 560374#(= main_~i~0 72), 560375#(= main_~i~0 73)] [2018-04-13 14:17:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:47,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 14:17:47,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 14:17:47,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 14:17:47,992 INFO L87 Difference]: Start difference. First operand 649 states and 765 transitions. Second operand 79 states. [2018-04-13 14:17:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:17:55,913 INFO L93 Difference]: Finished difference Result 19929 states and 23196 transitions. [2018-04-13 14:17:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 14:17:55,913 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 387 [2018-04-13 14:17:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:17:55,929 INFO L225 Difference]: With dead ends: 19929 [2018-04-13 14:17:55,929 INFO L226 Difference]: Without dead ends: 19929 [2018-04-13 14:17:55,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 14:17:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19929 states. [2018-04-13 14:17:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19929 to 654. [2018-04-13 14:17:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-04-13 14:17:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 771 transitions. [2018-04-13 14:17:56,016 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 771 transitions. Word has length 387 [2018-04-13 14:17:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:17:56,017 INFO L459 AbstractCegarLoop]: Abstraction has 654 states and 771 transitions. [2018-04-13 14:17:56,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 14:17:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 771 transitions. [2018-04-13 14:17:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-13 14:17:56,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:17:56,018 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-13 14:17:56,018 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:17:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 729022935, now seen corresponding path program 77 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:17:56,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:17:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:17:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:57,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:17:57,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 14:17:57,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:17:57,485 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-13 14:17:57,485 INFO L182 omatonBuilderFactory]: Interpolants [581000#(= main_~i~0 34), 581001#(= main_~i~0 35), 581002#(= main_~i~0 36), 581003#(= main_~i~0 37), 581004#(= main_~i~0 38), 581005#(= main_~i~0 39), 581006#(= main_~i~0 40), 581007#(= main_~i~0 41), 580992#(= main_~i~0 26), 580993#(= main_~i~0 27), 580994#(= main_~i~0 28), 580995#(= main_~i~0 29), 580996#(= main_~i~0 30), 580997#(= main_~i~0 31), 580998#(= main_~i~0 32), 580999#(= main_~i~0 33), 581016#(= main_~i~0 50), 581017#(= main_~i~0 51), 581018#(= main_~i~0 52), 581019#(= main_~i~0 53), 581020#(= main_~i~0 54), 581021#(= main_~i~0 55), 581022#(= main_~i~0 56), 581023#(= main_~i~0 57), 581008#(= main_~i~0 42), 581009#(= main_~i~0 43), 581010#(= main_~i~0 44), 581011#(= main_~i~0 45), 581012#(= main_~i~0 46), 581013#(= main_~i~0 47), 581014#(= main_~i~0 48), 581015#(= main_~i~0 49), 581032#(= main_~i~0 66), 581033#(= main_~i~0 67), 581034#(= main_~i~0 68), 581035#(= main_~i~0 69), 581036#(= main_~i~0 70), 581037#(= main_~i~0 71), 581038#(= main_~i~0 72), 581039#(= main_~i~0 73), 581024#(= main_~i~0 58), 581025#(= main_~i~0 59), 581026#(= main_~i~0 60), 581027#(= main_~i~0 61), 581028#(= main_~i~0 62), 581029#(= main_~i~0 63), 581030#(= main_~i~0 64), 581031#(= main_~i~0 65), 581040#(= main_~i~0 74), 581041#(= main_~i~0 75), 581042#(= main_~i~0 76), 581043#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 580968#(= main_~i~0 2), 580969#(= main_~i~0 3), 580970#(= main_~i~0 4), 580971#(= main_~i~0 5), 580972#(= main_~i~0 6), 580973#(= main_~i~0 7), 580974#(= main_~i~0 8), 580975#(= main_~i~0 9), 580962#true, 580963#false, 580966#(= main_~i~0 0), 580967#(= main_~i~0 1), 580984#(= main_~i~0 18), 580985#(= main_~i~0 19), 580986#(= main_~i~0 20), 580987#(= main_~i~0 21), 580988#(= main_~i~0 22), 580989#(= main_~i~0 23), 580990#(= main_~i~0 24), 580991#(= main_~i~0 25), 580976#(= main_~i~0 10), 580977#(= main_~i~0 11), 580978#(= main_~i~0 12), 580979#(= main_~i~0 13), 580980#(= main_~i~0 14), 580981#(= main_~i~0 15), 580982#(= main_~i~0 16), 580983#(= main_~i~0 17)] [2018-04-13 14:17:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:17:57,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 14:17:57,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 14:17:57,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 14:17:57,486 INFO L87 Difference]: Start difference. First operand 654 states and 771 transitions. Second operand 80 states. [2018-04-13 14:18:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:05,897 INFO L93 Difference]: Finished difference Result 20191 states and 23501 transitions. [2018-04-13 14:18:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 14:18:05,898 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 392 [2018-04-13 14:18:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:05,914 INFO L225 Difference]: With dead ends: 20191 [2018-04-13 14:18:05,914 INFO L226 Difference]: Without dead ends: 20191 [2018-04-13 14:18:05,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 14:18:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2018-04-13 14:18:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 659. [2018-04-13 14:18:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-04-13 14:18:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 777 transitions. [2018-04-13 14:18:06,002 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 777 transitions. Word has length 392 [2018-04-13 14:18:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:06,002 INFO L459 AbstractCegarLoop]: Abstraction has 659 states and 777 transitions. [2018-04-13 14:18:06,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 14:18:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 777 transitions. [2018-04-13 14:18:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-13 14:18:06,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:06,003 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:06,003 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2002237223, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:06,007 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8739 backedges. 0 proven. 5292 refuted. 0 times theorem prover too weak. 3447 trivial. 0 not checked. [2018-04-13 14:18:06,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:06,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 14:18:06,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2018-04-13 14:18:06,568 INFO L182 omatonBuilderFactory]: Interpolants [601993#(= main_~x~0 19), 601928#(= main_~x~0 6), 602058#(= main_~x~0 32), 601933#(= main_~x~0 7), 602063#(= main_~x~0 33), 601998#(= main_~x~0 20), 602048#(= main_~x~0 30), 601923#(= main_~x~0 5), 602053#(= main_~x~0 31), 601988#(= main_~x~0 18), 602073#(= main_~x~0 35), 602008#(= main_~x~0 22), 602013#(= main_~x~0 23), 601948#(= main_~x~0 10), 602078#(= main_~x~0 36), 602003#(= main_~x~0 21), 601938#(= main_~x~0 8), 602068#(= main_~x~0 34), 601943#(= main_~x~0 9), 602088#(= main_~x~0 38), 601963#(= main_~x~0 13), 601898#(= 0 main_~x~0), 602093#(= main_~x~0 39), 602028#(= main_~x~0 26), 601903#(= 1 main_~x~0), 601953#(= main_~x~0 11), 602083#(= main_~x~0 37), 602018#(= main_~x~0 24), 601895#false, 602023#(= main_~x~0 25), 601894#true, 601958#(= main_~x~0 12), 601913#(= main_~x~0 3), 602043#(= main_~x~0 29), 601978#(= main_~x~0 16), 602108#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 601983#(= main_~x~0 17), 601918#(= main_~x~0 4), 602033#(= main_~x~0 27), 601968#(= main_~x~0 14), 602098#(= main_~x~0 40), 601973#(= main_~x~0 15), 601908#(= main_~x~0 2), 602103#(= main_~x~0 41), 602038#(= main_~x~0 28)] [2018-04-13 14:18:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8739 backedges. 0 proven. 5292 refuted. 0 times theorem prover too weak. 3447 trivial. 0 not checked. [2018-04-13 14:18:06,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 14:18:06,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 14:18:06,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 14:18:06,569 INFO L87 Difference]: Start difference. First operand 659 states and 777 transitions. Second operand 45 states. [2018-04-13 14:18:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:08,330 INFO L93 Difference]: Finished difference Result 665 states and 784 transitions. [2018-04-13 14:18:08,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 14:18:08,330 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 437 [2018-04-13 14:18:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:08,331 INFO L225 Difference]: With dead ends: 665 [2018-04-13 14:18:08,331 INFO L226 Difference]: Without dead ends: 665 [2018-04-13 14:18:08,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 14:18:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-13 14:18:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2018-04-13 14:18:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-04-13 14:18:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 784 transitions. [2018-04-13 14:18:08,334 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 784 transitions. Word has length 437 [2018-04-13 14:18:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:08,334 INFO L459 AbstractCegarLoop]: Abstraction has 665 states and 784 transitions. [2018-04-13 14:18:08,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 14:18:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 784 transitions. [2018-04-13 14:18:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-13 14:18:08,335 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:08,335 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:08,336 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 66516358, now seen corresponding path program 78 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:08,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:09,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:09,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-13 14:18:09,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:09,835 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-13 14:18:09,835 INFO L182 omatonBuilderFactory]: Interpolants [603521#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 603520#(= main_~i~0 77), 603439#true, 603449#(= main_~i~0 6), 603448#(= main_~i~0 5), 603451#(= main_~i~0 8), 603450#(= main_~i~0 7), 603453#(= main_~i~0 10), 603452#(= main_~i~0 9), 603455#(= main_~i~0 12), 603454#(= main_~i~0 11), 603440#false, 603443#(= main_~i~0 0), 603445#(= main_~i~0 2), 603444#(= main_~i~0 1), 603447#(= main_~i~0 4), 603446#(= main_~i~0 3), 603465#(= main_~i~0 22), 603464#(= main_~i~0 21), 603467#(= main_~i~0 24), 603466#(= main_~i~0 23), 603469#(= main_~i~0 26), 603468#(= main_~i~0 25), 603471#(= main_~i~0 28), 603470#(= main_~i~0 27), 603457#(= main_~i~0 14), 603456#(= main_~i~0 13), 603459#(= main_~i~0 16), 603458#(= main_~i~0 15), 603461#(= main_~i~0 18), 603460#(= main_~i~0 17), 603463#(= main_~i~0 20), 603462#(= main_~i~0 19), 603481#(= main_~i~0 38), 603480#(= main_~i~0 37), 603483#(= main_~i~0 40), 603482#(= main_~i~0 39), 603485#(= main_~i~0 42), 603484#(= main_~i~0 41), 603487#(= main_~i~0 44), 603486#(= main_~i~0 43), 603473#(= main_~i~0 30), 603472#(= main_~i~0 29), 603475#(= main_~i~0 32), 603474#(= main_~i~0 31), 603477#(= main_~i~0 34), 603476#(= main_~i~0 33), 603479#(= main_~i~0 36), 603478#(= main_~i~0 35), 603497#(= main_~i~0 54), 603496#(= main_~i~0 53), 603499#(= main_~i~0 56), 603498#(= main_~i~0 55), 603501#(= main_~i~0 58), 603500#(= main_~i~0 57), 603503#(= main_~i~0 60), 603502#(= main_~i~0 59), 603489#(= main_~i~0 46), 603488#(= main_~i~0 45), 603491#(= main_~i~0 48), 603490#(= main_~i~0 47), 603493#(= main_~i~0 50), 603492#(= main_~i~0 49), 603495#(= main_~i~0 52), 603494#(= main_~i~0 51), 603513#(= main_~i~0 70), 603512#(= main_~i~0 69), 603515#(= main_~i~0 72), 603514#(= main_~i~0 71), 603517#(= main_~i~0 74), 603516#(= main_~i~0 73), 603519#(= main_~i~0 76), 603518#(= main_~i~0 75), 603505#(= main_~i~0 62), 603504#(= main_~i~0 61), 603507#(= main_~i~0 64), 603506#(= main_~i~0 63), 603509#(= main_~i~0 66), 603508#(= main_~i~0 65), 603511#(= main_~i~0 68), 603510#(= main_~i~0 67)] [2018-04-13 14:18:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:09,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 14:18:09,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 14:18:09,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 14:18:09,836 INFO L87 Difference]: Start difference. First operand 665 states and 784 transitions. Second operand 81 states. [2018-04-13 14:18:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:18,190 INFO L93 Difference]: Finished difference Result 20921 states and 24352 transitions. [2018-04-13 14:18:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 14:18:18,191 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 397 [2018-04-13 14:18:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:18,209 INFO L225 Difference]: With dead ends: 20921 [2018-04-13 14:18:18,209 INFO L226 Difference]: Without dead ends: 20921 [2018-04-13 14:18:18,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 14:18:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20921 states. [2018-04-13 14:18:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20921 to 670. [2018-04-13 14:18:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-04-13 14:18:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 790 transitions. [2018-04-13 14:18:18,308 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 790 transitions. Word has length 397 [2018-04-13 14:18:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:18,308 INFO L459 AbstractCegarLoop]: Abstraction has 670 states and 790 transitions. [2018-04-13 14:18:18,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 14:18:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 790 transitions. [2018-04-13 14:18:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-13 14:18:18,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:18,309 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:18,309 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash 15988535, now seen corresponding path program 79 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:18,311 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:19,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:19,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 14:18:19,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:19,850 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-13 14:18:19,850 INFO L182 omatonBuilderFactory]: Interpolants [625161#(= main_~i~0 44), 625160#(= main_~i~0 43), 625163#(= main_~i~0 46), 625162#(= main_~i~0 45), 625165#(= main_~i~0 48), 625164#(= main_~i~0 47), 625167#(= main_~i~0 50), 625166#(= main_~i~0 49), 625153#(= main_~i~0 36), 625152#(= main_~i~0 35), 625155#(= main_~i~0 38), 625154#(= main_~i~0 37), 625157#(= main_~i~0 40), 625156#(= main_~i~0 39), 625159#(= main_~i~0 42), 625158#(= main_~i~0 41), 625177#(= main_~i~0 60), 625176#(= main_~i~0 59), 625179#(= main_~i~0 62), 625178#(= main_~i~0 61), 625181#(= main_~i~0 64), 625180#(= main_~i~0 63), 625183#(= main_~i~0 66), 625182#(= main_~i~0 65), 625169#(= main_~i~0 52), 625168#(= main_~i~0 51), 625171#(= main_~i~0 54), 625170#(= main_~i~0 53), 625173#(= main_~i~0 56), 625172#(= main_~i~0 55), 625175#(= main_~i~0 58), 625174#(= main_~i~0 57), 625193#(= main_~i~0 76), 625192#(= main_~i~0 75), 625195#(= main_~i~0 78), 625194#(= main_~i~0 77), 625196#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 625185#(= main_~i~0 68), 625184#(= main_~i~0 67), 625187#(= main_~i~0 70), 625186#(= main_~i~0 69), 625189#(= main_~i~0 72), 625188#(= main_~i~0 71), 625191#(= main_~i~0 74), 625190#(= main_~i~0 73), 625113#true, 625114#false, 625117#(= main_~i~0 0), 625119#(= main_~i~0 2), 625118#(= main_~i~0 1), 625129#(= main_~i~0 12), 625128#(= main_~i~0 11), 625131#(= main_~i~0 14), 625130#(= main_~i~0 13), 625133#(= main_~i~0 16), 625132#(= main_~i~0 15), 625135#(= main_~i~0 18), 625134#(= main_~i~0 17), 625121#(= main_~i~0 4), 625120#(= main_~i~0 3), 625123#(= main_~i~0 6), 625122#(= main_~i~0 5), 625125#(= main_~i~0 8), 625124#(= main_~i~0 7), 625127#(= main_~i~0 10), 625126#(= main_~i~0 9), 625145#(= main_~i~0 28), 625144#(= main_~i~0 27), 625147#(= main_~i~0 30), 625146#(= main_~i~0 29), 625149#(= main_~i~0 32), 625148#(= main_~i~0 31), 625151#(= main_~i~0 34), 625150#(= main_~i~0 33), 625137#(= main_~i~0 20), 625136#(= main_~i~0 19), 625139#(= main_~i~0 22), 625138#(= main_~i~0 21), 625141#(= main_~i~0 24), 625140#(= main_~i~0 23), 625143#(= main_~i~0 26), 625142#(= main_~i~0 25)] [2018-04-13 14:18:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 14:18:19,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 14:18:19,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 14:18:19,852 INFO L87 Difference]: Start difference. First operand 670 states and 790 transitions. Second operand 82 states. [2018-04-13 14:18:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:28,499 INFO L93 Difference]: Finished difference Result 21189 states and 24664 transitions. [2018-04-13 14:18:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 14:18:28,500 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 402 [2018-04-13 14:18:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:28,518 INFO L225 Difference]: With dead ends: 21189 [2018-04-13 14:18:28,518 INFO L226 Difference]: Without dead ends: 21189 [2018-04-13 14:18:28,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 14:18:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21189 states. [2018-04-13 14:18:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21189 to 675. [2018-04-13 14:18:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-04-13 14:18:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 796 transitions. [2018-04-13 14:18:28,615 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 796 transitions. Word has length 402 [2018-04-13 14:18:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:28,615 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 796 transitions. [2018-04-13 14:18:28,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 14:18:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 796 transitions. [2018-04-13 14:18:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-13 14:18:28,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:28,617 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:28,617 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash -214494332, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:28,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9162 backedges. 0 proven. 5547 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2018-04-13 14:18:29,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:29,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 14:18:29,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2018-04-13 14:18:29,205 INFO L182 omatonBuilderFactory]: Interpolants [647240#(= main_~x~0 35), 647115#(= main_~x~0 10), 647245#(= main_~x~0 36), 647180#(= main_~x~0 23), 647105#(= main_~x~0 8), 647235#(= main_~x~0 34), 647170#(= main_~x~0 21), 647175#(= main_~x~0 22), 647110#(= main_~x~0 9), 647065#(= 0 main_~x~0), 647195#(= main_~x~0 26), 647130#(= main_~x~0 13), 647260#(= main_~x~0 39), 647135#(= main_~x~0 14), 647070#(= 1 main_~x~0), 647185#(= main_~x~0 24), 647120#(= main_~x~0 11), 647250#(= main_~x~0 37), 647061#true, 647125#(= main_~x~0 12), 647255#(= main_~x~0 38), 647062#false, 647190#(= main_~x~0 25), 647145#(= main_~x~0 16), 647080#(= main_~x~0 3), 647275#(= main_~x~0 42), 647210#(= main_~x~0 29), 647085#(= main_~x~0 4), 647215#(= main_~x~0 30), 647150#(= main_~x~0 17), 647265#(= main_~x~0 40), 647200#(= main_~x~0 27), 647075#(= main_~x~0 2), 647205#(= main_~x~0 28), 647140#(= main_~x~0 15), 647270#(= main_~x~0 41), 647225#(= main_~x~0 32), 647160#(= main_~x~0 19), 647165#(= main_~x~0 20), 647100#(= main_~x~0 7), 647230#(= main_~x~0 33), 647280#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 647155#(= main_~x~0 18), 647090#(= main_~x~0 5), 647220#(= main_~x~0 31), 647095#(= main_~x~0 6)] [2018-04-13 14:18:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9162 backedges. 0 proven. 5547 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2018-04-13 14:18:29,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 14:18:29,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 14:18:29,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 14:18:29,205 INFO L87 Difference]: Start difference. First operand 675 states and 796 transitions. Second operand 46 states. [2018-04-13 14:18:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:31,079 INFO L93 Difference]: Finished difference Result 681 states and 803 transitions. [2018-04-13 14:18:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 14:18:31,079 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 447 [2018-04-13 14:18:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:31,080 INFO L225 Difference]: With dead ends: 681 [2018-04-13 14:18:31,080 INFO L226 Difference]: Without dead ends: 681 [2018-04-13 14:18:31,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 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-13 14:18:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-13 14:18:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-04-13 14:18:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-04-13 14:18:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 803 transitions. [2018-04-13 14:18:31,083 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 803 transitions. Word has length 447 [2018-04-13 14:18:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:31,083 INFO L459 AbstractCegarLoop]: Abstraction has 681 states and 803 transitions. [2018-04-13 14:18:31,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 14:18:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 803 transitions. [2018-04-13 14:18:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-13 14:18:31,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:31,084 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:31,084 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2096716838, now seen corresponding path program 80 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:31,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:32,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:32,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-13 14:18:32,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:32,644 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-13 14:18:32,644 INFO L182 omatonBuilderFactory]: Interpolants [648713#(= main_~i~0 66), 648712#(= main_~i~0 65), 648715#(= main_~i~0 68), 648714#(= main_~i~0 67), 648717#(= main_~i~0 70), 648716#(= main_~i~0 69), 648719#(= main_~i~0 72), 648718#(= main_~i~0 71), 648705#(= main_~i~0 58), 648704#(= main_~i~0 57), 648707#(= main_~i~0 60), 648706#(= main_~i~0 59), 648709#(= main_~i~0 62), 648708#(= main_~i~0 61), 648711#(= main_~i~0 64), 648710#(= main_~i~0 63), 648721#(= main_~i~0 74), 648720#(= main_~i~0 73), 648723#(= main_~i~0 76), 648722#(= main_~i~0 75), 648725#(= main_~i~0 78), 648724#(= main_~i~0 77), 648727#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 648726#(= main_~i~0 79), 648649#(= main_~i~0 2), 648648#(= main_~i~0 1), 648651#(= main_~i~0 4), 648650#(= main_~i~0 3), 648653#(= main_~i~0 6), 648652#(= main_~i~0 5), 648655#(= main_~i~0 8), 648654#(= main_~i~0 7), 648643#true, 648644#false, 648647#(= main_~i~0 0), 648665#(= main_~i~0 18), 648664#(= main_~i~0 17), 648667#(= main_~i~0 20), 648666#(= main_~i~0 19), 648669#(= main_~i~0 22), 648668#(= main_~i~0 21), 648671#(= main_~i~0 24), 648670#(= main_~i~0 23), 648657#(= main_~i~0 10), 648656#(= main_~i~0 9), 648659#(= main_~i~0 12), 648658#(= main_~i~0 11), 648661#(= main_~i~0 14), 648660#(= main_~i~0 13), 648663#(= main_~i~0 16), 648662#(= main_~i~0 15), 648681#(= main_~i~0 34), 648680#(= main_~i~0 33), 648683#(= main_~i~0 36), 648682#(= main_~i~0 35), 648685#(= main_~i~0 38), 648684#(= main_~i~0 37), 648687#(= main_~i~0 40), 648686#(= main_~i~0 39), 648673#(= main_~i~0 26), 648672#(= main_~i~0 25), 648675#(= main_~i~0 28), 648674#(= main_~i~0 27), 648677#(= main_~i~0 30), 648676#(= main_~i~0 29), 648679#(= main_~i~0 32), 648678#(= main_~i~0 31), 648697#(= main_~i~0 50), 648696#(= main_~i~0 49), 648699#(= main_~i~0 52), 648698#(= main_~i~0 51), 648701#(= main_~i~0 54), 648700#(= main_~i~0 53), 648703#(= main_~i~0 56), 648702#(= main_~i~0 55), 648689#(= main_~i~0 42), 648688#(= main_~i~0 41), 648691#(= main_~i~0 44), 648690#(= main_~i~0 43), 648693#(= main_~i~0 46), 648692#(= main_~i~0 45), 648695#(= main_~i~0 48), 648694#(= main_~i~0 47)] [2018-04-13 14:18:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:32,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 14:18:32,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 14:18:32,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 14:18:32,645 INFO L87 Difference]: Start difference. First operand 681 states and 803 transitions. Second operand 83 states. [2018-04-13 14:18:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:41,387 INFO L93 Difference]: Finished difference Result 21937 states and 25536 transitions. [2018-04-13 14:18:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 14:18:41,388 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 407 [2018-04-13 14:18:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:41,407 INFO L225 Difference]: With dead ends: 21937 [2018-04-13 14:18:41,407 INFO L226 Difference]: Without dead ends: 21937 [2018-04-13 14:18:41,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 14:18:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21937 states. [2018-04-13 14:18:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21937 to 686. [2018-04-13 14:18:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-13 14:18:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 809 transitions. [2018-04-13 14:18:41,510 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 809 transitions. Word has length 407 [2018-04-13 14:18:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:41,510 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 809 transitions. [2018-04-13 14:18:41,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 14:18:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 809 transitions. [2018-04-13 14:18:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 14:18:41,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:41,511 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:41,511 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash -125258601, now seen corresponding path program 81 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:41,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:43,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:43,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-13 14:18:43,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:43,160 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-13 14:18:43,160 INFO L182 omatonBuilderFactory]: Interpolants [671370#(= main_~i~0 15), 671371#(= main_~i~0 16), 671368#(= main_~i~0 13), 671369#(= main_~i~0 14), 671374#(= main_~i~0 19), 671375#(= main_~i~0 20), 671372#(= main_~i~0 17), 671373#(= main_~i~0 18), 671362#(= main_~i~0 7), 671363#(= main_~i~0 8), 671360#(= main_~i~0 5), 671361#(= main_~i~0 6), 671366#(= main_~i~0 11), 671367#(= main_~i~0 12), 671364#(= main_~i~0 9), 671365#(= main_~i~0 10), 671386#(= main_~i~0 31), 671387#(= main_~i~0 32), 671384#(= main_~i~0 29), 671385#(= main_~i~0 30), 671390#(= main_~i~0 35), 671391#(= main_~i~0 36), 671388#(= main_~i~0 33), 671389#(= main_~i~0 34), 671378#(= main_~i~0 23), 671379#(= main_~i~0 24), 671376#(= main_~i~0 21), 671377#(= main_~i~0 22), 671382#(= main_~i~0 27), 671383#(= main_~i~0 28), 671380#(= main_~i~0 25), 671381#(= main_~i~0 26), 671402#(= main_~i~0 47), 671403#(= main_~i~0 48), 671400#(= main_~i~0 45), 671401#(= main_~i~0 46), 671406#(= main_~i~0 51), 671407#(= main_~i~0 52), 671404#(= main_~i~0 49), 671405#(= main_~i~0 50), 671394#(= main_~i~0 39), 671395#(= main_~i~0 40), 671392#(= main_~i~0 37), 671393#(= main_~i~0 38), 671398#(= main_~i~0 43), 671399#(= main_~i~0 44), 671396#(= main_~i~0 41), 671397#(= main_~i~0 42), 671418#(= main_~i~0 63), 671419#(= main_~i~0 64), 671416#(= main_~i~0 61), 671417#(= main_~i~0 62), 671422#(= main_~i~0 67), 671423#(= main_~i~0 68), 671420#(= main_~i~0 65), 671421#(= main_~i~0 66), 671410#(= main_~i~0 55), 671411#(= main_~i~0 56), 671408#(= main_~i~0 53), 671409#(= main_~i~0 54), 671414#(= main_~i~0 59), 671415#(= main_~i~0 60), 671412#(= main_~i~0 57), 671413#(= main_~i~0 58), 671434#(= main_~i~0 79), 671435#(= main_~i~0 80), 671432#(= main_~i~0 77), 671433#(= main_~i~0 78), 671436#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 671426#(= main_~i~0 71), 671427#(= main_~i~0 72), 671424#(= main_~i~0 69), 671425#(= main_~i~0 70), 671430#(= main_~i~0 75), 671431#(= main_~i~0 76), 671428#(= main_~i~0 73), 671429#(= main_~i~0 74), 671355#(= main_~i~0 0), 671352#false, 671358#(= main_~i~0 3), 671359#(= main_~i~0 4), 671356#(= main_~i~0 1), 671357#(= main_~i~0 2), 671351#true] [2018-04-13 14:18:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:43,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 14:18:43,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 14:18:43,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 14:18:43,161 INFO L87 Difference]: Start difference. First operand 686 states and 809 transitions. Second operand 84 states. [2018-04-13 14:18:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:52,210 INFO L93 Difference]: Finished difference Result 22211 states and 25855 transitions. [2018-04-13 14:18:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 14:18:52,210 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 412 [2018-04-13 14:18:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:52,229 INFO L225 Difference]: With dead ends: 22211 [2018-04-13 14:18:52,229 INFO L226 Difference]: Without dead ends: 22211 [2018-04-13 14:18:52,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 14:18:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22211 states. [2018-04-13 14:18:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22211 to 691. [2018-04-13 14:18:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-04-13 14:18:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 815 transitions. [2018-04-13 14:18:52,352 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 815 transitions. Word has length 412 [2018-04-13 14:18:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:52,352 INFO L459 AbstractCegarLoop]: Abstraction has 691 states and 815 transitions. [2018-04-13 14:18:52,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 14:18:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 815 transitions. [2018-04-13 14:18:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-13 14:18:52,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:52,354 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:52,354 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:52,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1415028831, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:52,357 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9595 backedges. 0 proven. 5808 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2018-04-13 14:18:52,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:52,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 14:18:52,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2018-04-13 14:18:52,995 INFO L182 omatonBuilderFactory]: Interpolants [694538#(= main_~x~0 39), 694408#(= main_~x~0 13), 694473#(= main_~x~0 26), 694478#(= main_~x~0 27), 694543#(= main_~x~0 40), 694348#(= 1 main_~x~0), 694413#(= main_~x~0 14), 694339#true, 694403#(= main_~x~0 12), 694528#(= main_~x~0 37), 694343#(= 0 main_~x~0), 694340#false, 694468#(= main_~x~0 25), 694533#(= main_~x~0 38), 694363#(= main_~x~0 4), 694488#(= main_~x~0 29), 694553#(= main_~x~0 42), 694558#(= main_~x~0 43), 694428#(= main_~x~0 17), 694493#(= main_~x~0 30), 694418#(= main_~x~0 15), 694483#(= main_~x~0 28), 694353#(= main_~x~0 2), 694358#(= main_~x~0 3), 694423#(= main_~x~0 16), 694548#(= main_~x~0 41), 694378#(= main_~x~0 7), 694443#(= main_~x~0 20), 694383#(= main_~x~0 8), 694508#(= main_~x~0 33), 694498#(= main_~x~0 31), 694563#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 694368#(= main_~x~0 5), 694433#(= main_~x~0 18), 694438#(= main_~x~0 19), 694503#(= main_~x~0 32), 694373#(= main_~x~0 6), 694458#(= main_~x~0 23), 694523#(= main_~x~0 36), 694393#(= main_~x~0 10), 694398#(= main_~x~0 11), 694463#(= main_~x~0 24), 694448#(= main_~x~0 21), 694513#(= main_~x~0 34), 694518#(= main_~x~0 35), 694388#(= main_~x~0 9), 694453#(= main_~x~0 22)] [2018-04-13 14:18:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9595 backedges. 0 proven. 5808 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2018-04-13 14:18:52,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 14:18:52,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 14:18:52,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 14:18:52,996 INFO L87 Difference]: Start difference. First operand 691 states and 815 transitions. Second operand 47 states. [2018-04-13 14:18:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:18:55,054 INFO L93 Difference]: Finished difference Result 697 states and 822 transitions. [2018-04-13 14:18:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 14:18:55,054 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 457 [2018-04-13 14:18:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:18:55,055 INFO L225 Difference]: With dead ends: 697 [2018-04-13 14:18:55,055 INFO L226 Difference]: Without dead ends: 697 [2018-04-13 14:18:55,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 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-13 14:18:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-04-13 14:18:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2018-04-13 14:18:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-04-13 14:18:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 822 transitions. [2018-04-13 14:18:55,060 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 822 transitions. Word has length 457 [2018-04-13 14:18:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:18:55,061 INFO L459 AbstractCegarLoop]: Abstraction has 697 states and 822 transitions. [2018-04-13 14:18:55,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 14:18:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 822 transitions. [2018-04-13 14:18:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-13 14:18:55,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:18:55,062 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-13 14:18:55,062 INFO L408 AbstractCegarLoop]: === Iteration 129 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:18:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1235483334, now seen corresponding path program 82 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:18:55,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:18:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:18:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:56,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:18:56,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-13 14:18:56,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:18:56,802 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-13 14:18:56,802 INFO L182 omatonBuilderFactory]: Interpolants [695962#(= main_~i~0 0), 695963#(= main_~i~0 1), 695966#(= main_~i~0 4), 695967#(= main_~i~0 5), 695964#(= main_~i~0 2), 695965#(= main_~i~0 3), 695958#true, 695959#false, 695978#(= main_~i~0 16), 695979#(= main_~i~0 17), 695976#(= main_~i~0 14), 695977#(= main_~i~0 15), 695982#(= main_~i~0 20), 695983#(= main_~i~0 21), 695980#(= main_~i~0 18), 695981#(= main_~i~0 19), 695970#(= main_~i~0 8), 695971#(= main_~i~0 9), 695968#(= main_~i~0 6), 695969#(= main_~i~0 7), 695974#(= main_~i~0 12), 695975#(= main_~i~0 13), 695972#(= main_~i~0 10), 695973#(= main_~i~0 11), 695994#(= main_~i~0 32), 695995#(= main_~i~0 33), 695992#(= main_~i~0 30), 695993#(= main_~i~0 31), 695998#(= main_~i~0 36), 695999#(= main_~i~0 37), 695996#(= main_~i~0 34), 695997#(= main_~i~0 35), 695986#(= main_~i~0 24), 695987#(= main_~i~0 25), 695984#(= main_~i~0 22), 695985#(= main_~i~0 23), 695990#(= main_~i~0 28), 695991#(= main_~i~0 29), 695988#(= main_~i~0 26), 695989#(= main_~i~0 27), 696010#(= main_~i~0 48), 696011#(= main_~i~0 49), 696008#(= main_~i~0 46), 696009#(= main_~i~0 47), 696014#(= main_~i~0 52), 696015#(= main_~i~0 53), 696012#(= main_~i~0 50), 696013#(= main_~i~0 51), 696002#(= main_~i~0 40), 696003#(= main_~i~0 41), 696000#(= main_~i~0 38), 696001#(= main_~i~0 39), 696006#(= main_~i~0 44), 696007#(= main_~i~0 45), 696004#(= main_~i~0 42), 696005#(= main_~i~0 43), 696026#(= main_~i~0 64), 696027#(= main_~i~0 65), 696024#(= main_~i~0 62), 696025#(= main_~i~0 63), 696030#(= main_~i~0 68), 696031#(= main_~i~0 69), 696028#(= main_~i~0 66), 696029#(= main_~i~0 67), 696018#(= main_~i~0 56), 696019#(= main_~i~0 57), 696016#(= main_~i~0 54), 696017#(= main_~i~0 55), 696022#(= main_~i~0 60), 696023#(= main_~i~0 61), 696020#(= main_~i~0 58), 696021#(= main_~i~0 59), 696042#(= main_~i~0 80), 696043#(= main_~i~0 81), 696040#(= main_~i~0 78), 696041#(= main_~i~0 79), 696044#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 696034#(= main_~i~0 72), 696035#(= main_~i~0 73), 696032#(= main_~i~0 70), 696033#(= main_~i~0 71), 696038#(= main_~i~0 76), 696039#(= main_~i~0 77), 696036#(= main_~i~0 74), 696037#(= main_~i~0 75)] [2018-04-13 14:18:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:18:56,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 14:18:56,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 14:18:56,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 14:18:56,804 INFO L87 Difference]: Start difference. First operand 697 states and 822 transitions. Second operand 85 states. [2018-04-13 14:19:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:06,943 INFO L93 Difference]: Finished difference Result 22977 states and 26748 transitions. [2018-04-13 14:19:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 14:19:06,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 417 [2018-04-13 14:19:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:06,963 INFO L225 Difference]: With dead ends: 22977 [2018-04-13 14:19:06,963 INFO L226 Difference]: Without dead ends: 22977 [2018-04-13 14:19:06,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 14:19:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22977 states. [2018-04-13 14:19:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22977 to 702. [2018-04-13 14:19:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-04-13 14:19:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 828 transitions. [2018-04-13 14:19:07,119 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 828 transitions. Word has length 417 [2018-04-13 14:19:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:07,119 INFO L459 AbstractCegarLoop]: Abstraction has 702 states and 828 transitions. [2018-04-13 14:19:07,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 14:19:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 828 transitions. [2018-04-13 14:19:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-13 14:19:07,121 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:07,121 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:07,121 INFO L408 AbstractCegarLoop]: === Iteration 130 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash 231926654, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:07,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10038 backedges. 0 proven. 6075 refuted. 0 times theorem prover too weak. 3963 trivial. 0 not checked. [2018-04-13 14:19:07,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:07,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-13 14:19:07,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-04-13 14:19:07,777 INFO L182 omatonBuilderFactory]: Interpolants [719818#(= main_~x~0 18), 719883#(= main_~x~0 31), 719753#(= main_~x~0 5), 719758#(= main_~x~0 6), 719823#(= main_~x~0 19), 719948#(= main_~x~0 44), 719938#(= main_~x~0 42), 719808#(= main_~x~0 16), 719873#(= main_~x~0 29), 719878#(= main_~x~0 30), 719943#(= main_~x~0 43), 719748#(= main_~x~0 4), 719813#(= main_~x~0 17), 719898#(= main_~x~0 34), 719768#(= main_~x~0 8), 719833#(= main_~x~0 21), 719838#(= main_~x~0 22), 719903#(= main_~x~0 35), 719773#(= main_~x~0 9), 719763#(= main_~x~0 7), 719888#(= main_~x~0 32), 719953#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 719828#(= main_~x~0 20), 719893#(= main_~x~0 33), 719848#(= main_~x~0 24), 719913#(= main_~x~0 37), 719918#(= main_~x~0 38), 719724#true, 719788#(= main_~x~0 12), 719725#false, 719853#(= main_~x~0 25), 719778#(= main_~x~0 10), 719843#(= main_~x~0 23), 719783#(= main_~x~0 11), 719908#(= main_~x~0 36), 719738#(= main_~x~0 2), 719803#(= main_~x~0 15), 719928#(= main_~x~0 40), 719743#(= main_~x~0 3), 719868#(= main_~x~0 28), 719933#(= main_~x~0 41), 719858#(= main_~x~0 26), 719923#(= main_~x~0 39), 719728#(= 0 main_~x~0), 719793#(= main_~x~0 13), 719798#(= main_~x~0 14), 719863#(= main_~x~0 27), 719733#(= 1 main_~x~0)] [2018-04-13 14:19:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10038 backedges. 0 proven. 6075 refuted. 0 times theorem prover too weak. 3963 trivial. 0 not checked. [2018-04-13 14:19:07,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 14:19:07,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 14:19:07,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 14:19:07,778 INFO L87 Difference]: Start difference. First operand 702 states and 828 transitions. Second operand 48 states. [2018-04-13 14:19:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:09,974 INFO L93 Difference]: Finished difference Result 708 states and 835 transitions. [2018-04-13 14:19:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 14:19:09,974 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 467 [2018-04-13 14:19:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:09,975 INFO L225 Difference]: With dead ends: 708 [2018-04-13 14:19:09,975 INFO L226 Difference]: Without dead ends: 708 [2018-04-13 14:19:09,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 93 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-13 14:19:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-13 14:19:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-04-13 14:19:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-04-13 14:19:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 835 transitions. [2018-04-13 14:19:09,978 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 835 transitions. Word has length 467 [2018-04-13 14:19:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:09,978 INFO L459 AbstractCegarLoop]: Abstraction has 708 states and 835 transitions. [2018-04-13 14:19:09,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 14:19:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 835 transitions. [2018-04-13 14:19:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-13 14:19:09,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:09,979 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:09,979 INFO L408 AbstractCegarLoop]: === Iteration 131 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash 886585847, now seen corresponding path program 83 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:09,982 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:11,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:11,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-13 14:19:11,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:11,755 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-13 14:19:11,755 INFO L182 omatonBuilderFactory]: Interpolants [721419#(= main_~i~0 45), 721418#(= main_~i~0 44), 721417#(= main_~i~0 43), 721416#(= main_~i~0 42), 721423#(= main_~i~0 49), 721422#(= main_~i~0 48), 721421#(= main_~i~0 47), 721420#(= main_~i~0 46), 721411#(= main_~i~0 37), 721410#(= main_~i~0 36), 721409#(= main_~i~0 35), 721408#(= main_~i~0 34), 721415#(= main_~i~0 41), 721414#(= main_~i~0 40), 721413#(= main_~i~0 39), 721412#(= main_~i~0 38), 721435#(= main_~i~0 61), 721434#(= main_~i~0 60), 721433#(= main_~i~0 59), 721432#(= main_~i~0 58), 721439#(= main_~i~0 65), 721438#(= main_~i~0 64), 721437#(= main_~i~0 63), 721436#(= main_~i~0 62), 721427#(= main_~i~0 53), 721426#(= main_~i~0 52), 721425#(= main_~i~0 51), 721424#(= main_~i~0 50), 721431#(= main_~i~0 57), 721430#(= main_~i~0 56), 721429#(= main_~i~0 55), 721428#(= main_~i~0 54), 721451#(= main_~i~0 77), 721450#(= main_~i~0 76), 721449#(= main_~i~0 75), 721448#(= main_~i~0 74), 721455#(= main_~i~0 81), 721454#(= main_~i~0 80), 721453#(= main_~i~0 79), 721452#(= main_~i~0 78), 721443#(= main_~i~0 69), 721442#(= main_~i~0 68), 721441#(= main_~i~0 67), 721440#(= main_~i~0 66), 721447#(= main_~i~0 73), 721446#(= main_~i~0 72), 721445#(= main_~i~0 71), 721444#(= main_~i~0 70), 721457#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 721456#(= main_~i~0 82), 721371#false, 721370#true, 721375#(= main_~i~0 1), 721374#(= main_~i~0 0), 721387#(= main_~i~0 13), 721386#(= main_~i~0 12), 721385#(= main_~i~0 11), 721384#(= main_~i~0 10), 721391#(= main_~i~0 17), 721390#(= main_~i~0 16), 721389#(= main_~i~0 15), 721388#(= main_~i~0 14), 721379#(= main_~i~0 5), 721378#(= main_~i~0 4), 721377#(= main_~i~0 3), 721376#(= main_~i~0 2), 721383#(= main_~i~0 9), 721382#(= main_~i~0 8), 721381#(= main_~i~0 7), 721380#(= main_~i~0 6), 721403#(= main_~i~0 29), 721402#(= main_~i~0 28), 721401#(= main_~i~0 27), 721400#(= main_~i~0 26), 721407#(= main_~i~0 33), 721406#(= main_~i~0 32), 721405#(= main_~i~0 31), 721404#(= main_~i~0 30), 721395#(= main_~i~0 21), 721394#(= main_~i~0 20), 721393#(= main_~i~0 19), 721392#(= main_~i~0 18), 721399#(= main_~i~0 25), 721398#(= main_~i~0 24), 721397#(= main_~i~0 23), 721396#(= main_~i~0 22)] [2018-04-13 14:19:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 14:19:11,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 14:19:11,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 14:19:11,757 INFO L87 Difference]: Start difference. First operand 708 states and 835 transitions. Second operand 86 states. [2018-04-13 14:19:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:21,368 INFO L93 Difference]: Finished difference Result 23755 states and 27655 transitions. [2018-04-13 14:19:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 14:19:21,368 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 422 [2018-04-13 14:19:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:21,389 INFO L225 Difference]: With dead ends: 23755 [2018-04-13 14:19:21,389 INFO L226 Difference]: Without dead ends: 23755 [2018-04-13 14:19:21,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 14:19:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23755 states. [2018-04-13 14:19:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23755 to 713. [2018-04-13 14:19:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-04-13 14:19:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 841 transitions. [2018-04-13 14:19:21,549 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 841 transitions. Word has length 422 [2018-04-13 14:19:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:21,549 INFO L459 AbstractCegarLoop]: Abstraction has 713 states and 841 transitions. [2018-04-13 14:19:21,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 14:19:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 841 transitions. [2018-04-13 14:19:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-13 14:19:21,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:21,550 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:21,550 INFO L408 AbstractCegarLoop]: === Iteration 132 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash -15675034, now seen corresponding path program 84 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:21,553 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:23,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:23,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-13 14:19:23,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:23,350 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-13 14:19:23,350 INFO L182 omatonBuilderFactory]: Interpolants [745995#(= main_~i~0 65), 745994#(= main_~i~0 64), 745993#(= main_~i~0 63), 745992#(= main_~i~0 62), 745999#(= main_~i~0 69), 745998#(= main_~i~0 68), 745997#(= main_~i~0 67), 745996#(= main_~i~0 66), 745987#(= main_~i~0 57), 745986#(= main_~i~0 56), 745985#(= main_~i~0 55), 745984#(= main_~i~0 54), 745991#(= main_~i~0 61), 745990#(= main_~i~0 60), 745989#(= main_~i~0 59), 745988#(= main_~i~0 58), 746011#(= main_~i~0 81), 746010#(= main_~i~0 80), 746009#(= main_~i~0 79), 746008#(= main_~i~0 78), 746014#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 746013#(= main_~i~0 83), 746012#(= main_~i~0 82), 746003#(= main_~i~0 73), 746002#(= main_~i~0 72), 746001#(= main_~i~0 71), 746000#(= main_~i~0 70), 746007#(= main_~i~0 77), 746006#(= main_~i~0 76), 746005#(= main_~i~0 75), 746004#(= main_~i~0 74), 745931#(= main_~i~0 1), 745930#(= main_~i~0 0), 745935#(= main_~i~0 5), 745934#(= main_~i~0 4), 745933#(= main_~i~0 3), 745932#(= main_~i~0 2), 745927#false, 745926#true, 745947#(= main_~i~0 17), 745946#(= main_~i~0 16), 745945#(= main_~i~0 15), 745944#(= main_~i~0 14), 745951#(= main_~i~0 21), 745950#(= main_~i~0 20), 745949#(= main_~i~0 19), 745948#(= main_~i~0 18), 745939#(= main_~i~0 9), 745938#(= main_~i~0 8), 745937#(= main_~i~0 7), 745936#(= main_~i~0 6), 745943#(= main_~i~0 13), 745942#(= main_~i~0 12), 745941#(= main_~i~0 11), 745940#(= main_~i~0 10), 745963#(= main_~i~0 33), 745962#(= main_~i~0 32), 745961#(= main_~i~0 31), 745960#(= main_~i~0 30), 745967#(= main_~i~0 37), 745966#(= main_~i~0 36), 745965#(= main_~i~0 35), 745964#(= main_~i~0 34), 745955#(= main_~i~0 25), 745954#(= main_~i~0 24), 745953#(= main_~i~0 23), 745952#(= main_~i~0 22), 745959#(= main_~i~0 29), 745958#(= main_~i~0 28), 745957#(= main_~i~0 27), 745956#(= main_~i~0 26), 745979#(= main_~i~0 49), 745978#(= main_~i~0 48), 745977#(= main_~i~0 47), 745976#(= main_~i~0 46), 745983#(= main_~i~0 53), 745982#(= main_~i~0 52), 745981#(= main_~i~0 51), 745980#(= main_~i~0 50), 745971#(= main_~i~0 41), 745970#(= main_~i~0 40), 745969#(= main_~i~0 39), 745968#(= main_~i~0 38), 745975#(= main_~i~0 45), 745974#(= main_~i~0 44), 745973#(= main_~i~0 43), 745972#(= main_~i~0 42)] [2018-04-13 14:19:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:23,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 14:19:23,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 14:19:23,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 14:19:23,351 INFO L87 Difference]: Start difference. First operand 713 states and 841 transitions. Second operand 87 states. [2018-04-13 14:19:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:34,068 INFO L93 Difference]: Finished difference Result 24041 states and 27988 transitions. [2018-04-13 14:19:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 14:19:34,068 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 427 [2018-04-13 14:19:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:34,089 INFO L225 Difference]: With dead ends: 24041 [2018-04-13 14:19:34,089 INFO L226 Difference]: Without dead ends: 24041 [2018-04-13 14:19:34,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 14:19:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24041 states. [2018-04-13 14:19:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24041 to 718. [2018-04-13 14:19:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-13 14:19:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 847 transitions. [2018-04-13 14:19:34,201 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 847 transitions. Word has length 427 [2018-04-13 14:19:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:34,201 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 847 transitions. [2018-04-13 14:19:34,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 14:19:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 847 transitions. [2018-04-13 14:19:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-04-13 14:19:34,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:34,202 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:34,203 INFO L408 AbstractCegarLoop]: === Iteration 133 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash -101054693, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:34,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10491 backedges. 0 proven. 6348 refuted. 0 times theorem prover too weak. 4143 trivial. 0 not checked. [2018-04-13 14:19:34,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:34,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 14:19:34,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2018-04-13 14:19:34,898 INFO L182 omatonBuilderFactory]: Interpolants [770953#(= main_~x~0 35), 770958#(= main_~x~0 36), 770828#(= main_~x~0 10), 770818#(= main_~x~0 8), 770823#(= main_~x~0 9), 770948#(= main_~x~0 34), 770843#(= main_~x~0 13), 770968#(= main_~x~0 38), 770973#(= main_~x~0 39), 770963#(= main_~x~0 37), 770833#(= main_~x~0 11), 770838#(= main_~x~0 12), 770858#(= main_~x~0 16), 770863#(= main_~x~0 17), 770988#(= main_~x~0 42), 770978#(= main_~x~0 40), 770848#(= main_~x~0 14), 770983#(= main_~x~0 41), 770853#(= main_~x~0 15), 771003#(= main_~x~0 45), 770873#(= main_~x~0 19), 770878#(= main_~x~0 20), 770993#(= main_~x~0 43), 770998#(= main_~x~0 44), 770868#(= main_~x~0 18), 770888#(= main_~x~0 22), 770893#(= main_~x~0 23), 770883#(= main_~x~0 21), 771008#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 770778#(= 0 main_~x~0), 770783#(= 1 main_~x~0), 770908#(= main_~x~0 26), 770898#(= main_~x~0 24), 770775#false, 770903#(= main_~x~0 25), 770774#true, 770923#(= main_~x~0 29), 770793#(= main_~x~0 3), 770798#(= main_~x~0 4), 770913#(= main_~x~0 27), 770918#(= main_~x~0 28), 770788#(= main_~x~0 2), 770938#(= main_~x~0 32), 770808#(= main_~x~0 6), 770943#(= main_~x~0 33), 770813#(= main_~x~0 7), 770803#(= main_~x~0 5), 770928#(= main_~x~0 30), 770933#(= main_~x~0 31)] [2018-04-13 14:19:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10491 backedges. 0 proven. 6348 refuted. 0 times theorem prover too weak. 4143 trivial. 0 not checked. [2018-04-13 14:19:34,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 14:19:34,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 14:19:34,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 14:19:34,899 INFO L87 Difference]: Start difference. First operand 718 states and 847 transitions. Second operand 49 states. [2018-04-13 14:19:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:37,373 INFO L93 Difference]: Finished difference Result 724 states and 854 transitions. [2018-04-13 14:19:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 14:19:37,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 477 [2018-04-13 14:19:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:37,374 INFO L225 Difference]: With dead ends: 724 [2018-04-13 14:19:37,374 INFO L226 Difference]: Without dead ends: 724 [2018-04-13 14:19:37,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 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-13 14:19:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-04-13 14:19:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-04-13 14:19:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-04-13 14:19:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 854 transitions. [2018-04-13 14:19:37,378 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 854 transitions. Word has length 477 [2018-04-13 14:19:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:37,378 INFO L459 AbstractCegarLoop]: Abstraction has 724 states and 854 transitions. [2018-04-13 14:19:37,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 14:19:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 854 transitions. [2018-04-13 14:19:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-13 14:19:37,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:37,379 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:37,379 INFO L408 AbstractCegarLoop]: === Iteration 134 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1091077975, now seen corresponding path program 85 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:37,382 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:39,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:39,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 14:19:39,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:39,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-13 14:19:39,347 INFO L182 omatonBuilderFactory]: Interpolants [772491#(= main_~i~0 30), 772490#(= main_~i~0 29), 772489#(= main_~i~0 28), 772488#(= main_~i~0 27), 772495#(= main_~i~0 34), 772494#(= main_~i~0 33), 772493#(= main_~i~0 32), 772492#(= main_~i~0 31), 772483#(= main_~i~0 22), 772482#(= main_~i~0 21), 772481#(= main_~i~0 20), 772480#(= main_~i~0 19), 772487#(= main_~i~0 26), 772486#(= main_~i~0 25), 772485#(= main_~i~0 24), 772484#(= main_~i~0 23), 772507#(= main_~i~0 46), 772506#(= main_~i~0 45), 772505#(= main_~i~0 44), 772504#(= main_~i~0 43), 772511#(= main_~i~0 50), 772510#(= main_~i~0 49), 772509#(= main_~i~0 48), 772508#(= main_~i~0 47), 772499#(= main_~i~0 38), 772498#(= main_~i~0 37), 772497#(= main_~i~0 36), 772496#(= main_~i~0 35), 772503#(= main_~i~0 42), 772502#(= main_~i~0 41), 772501#(= main_~i~0 40), 772500#(= main_~i~0 39), 772523#(= main_~i~0 62), 772522#(= main_~i~0 61), 772521#(= main_~i~0 60), 772520#(= main_~i~0 59), 772527#(= main_~i~0 66), 772526#(= main_~i~0 65), 772525#(= main_~i~0 64), 772524#(= main_~i~0 63), 772515#(= main_~i~0 54), 772514#(= main_~i~0 53), 772513#(= main_~i~0 52), 772512#(= main_~i~0 51), 772519#(= main_~i~0 58), 772518#(= main_~i~0 57), 772517#(= main_~i~0 56), 772516#(= main_~i~0 55), 772539#(= main_~i~0 78), 772538#(= main_~i~0 77), 772537#(= main_~i~0 76), 772536#(= main_~i~0 75), 772543#(= main_~i~0 82), 772542#(= main_~i~0 81), 772541#(= main_~i~0 80), 772540#(= main_~i~0 79), 772531#(= main_~i~0 70), 772530#(= main_~i~0 69), 772529#(= main_~i~0 68), 772528#(= main_~i~0 67), 772535#(= main_~i~0 74), 772534#(= main_~i~0 73), 772533#(= main_~i~0 72), 772532#(= main_~i~0 71), 772546#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 772545#(= main_~i~0 84), 772544#(= main_~i~0 83), 772458#false, 772457#true, 772463#(= main_~i~0 2), 772462#(= main_~i~0 1), 772461#(= main_~i~0 0), 772475#(= main_~i~0 14), 772474#(= main_~i~0 13), 772473#(= main_~i~0 12), 772472#(= main_~i~0 11), 772479#(= main_~i~0 18), 772478#(= main_~i~0 17), 772477#(= main_~i~0 16), 772476#(= main_~i~0 15), 772467#(= main_~i~0 6), 772466#(= main_~i~0 5), 772465#(= main_~i~0 4), 772464#(= main_~i~0 3), 772471#(= main_~i~0 10), 772470#(= main_~i~0 9), 772469#(= main_~i~0 8), 772468#(= main_~i~0 7)] [2018-04-13 14:19:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 14:19:39,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 14:19:39,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 14:19:39,349 INFO L87 Difference]: Start difference. First operand 724 states and 854 transitions. Second operand 88 states. [2018-04-13 14:19:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:19:50,278 INFO L93 Difference]: Finished difference Result 24837 states and 28916 transitions. [2018-04-13 14:19:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 14:19:50,278 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 432 [2018-04-13 14:19:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:19:50,301 INFO L225 Difference]: With dead ends: 24837 [2018-04-13 14:19:50,302 INFO L226 Difference]: Without dead ends: 24837 [2018-04-13 14:19:50,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 14:19:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24837 states. [2018-04-13 14:19:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24837 to 729. [2018-04-13 14:19:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-04-13 14:19:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 860 transitions. [2018-04-13 14:19:50,423 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 860 transitions. Word has length 432 [2018-04-13 14:19:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:19:50,423 INFO L459 AbstractCegarLoop]: Abstraction has 729 states and 860 transitions. [2018-04-13 14:19:50,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 14:19:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 860 transitions. [2018-04-13 14:19:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-13 14:19:50,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:19:50,424 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-13 14:19:50,424 INFO L408 AbstractCegarLoop]: === Iteration 135 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:19:50,424 INFO L82 PathProgramCache]: Analyzing trace with hash 433709062, now seen corresponding path program 86 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:19:50,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:19:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:19:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:52,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:19:52,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-13 14:19:52,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:19:52,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-13 14:19:52,189 INFO L182 omatonBuilderFactory]: Interpolants [798124#(= main_~i~0 7), 798125#(= main_~i~0 8), 798126#(= main_~i~0 9), 798127#(= main_~i~0 10), 798120#(= main_~i~0 3), 798121#(= main_~i~0 4), 798122#(= main_~i~0 5), 798123#(= main_~i~0 6), 798117#(= main_~i~0 0), 798118#(= main_~i~0 1), 798119#(= main_~i~0 2), 798113#true, 798114#false, 798140#(= main_~i~0 23), 798141#(= main_~i~0 24), 798142#(= main_~i~0 25), 798143#(= main_~i~0 26), 798136#(= main_~i~0 19), 798137#(= main_~i~0 20), 798138#(= main_~i~0 21), 798139#(= main_~i~0 22), 798132#(= main_~i~0 15), 798133#(= main_~i~0 16), 798134#(= main_~i~0 17), 798135#(= main_~i~0 18), 798128#(= main_~i~0 11), 798129#(= main_~i~0 12), 798130#(= main_~i~0 13), 798131#(= main_~i~0 14), 798156#(= main_~i~0 39), 798157#(= main_~i~0 40), 798158#(= main_~i~0 41), 798159#(= main_~i~0 42), 798152#(= main_~i~0 35), 798153#(= main_~i~0 36), 798154#(= main_~i~0 37), 798155#(= main_~i~0 38), 798148#(= main_~i~0 31), 798149#(= main_~i~0 32), 798150#(= main_~i~0 33), 798151#(= main_~i~0 34), 798144#(= main_~i~0 27), 798145#(= main_~i~0 28), 798146#(= main_~i~0 29), 798147#(= main_~i~0 30), 798172#(= main_~i~0 55), 798173#(= main_~i~0 56), 798174#(= main_~i~0 57), 798175#(= main_~i~0 58), 798168#(= main_~i~0 51), 798169#(= main_~i~0 52), 798170#(= main_~i~0 53), 798171#(= main_~i~0 54), 798164#(= main_~i~0 47), 798165#(= main_~i~0 48), 798166#(= main_~i~0 49), 798167#(= main_~i~0 50), 798160#(= main_~i~0 43), 798161#(= main_~i~0 44), 798162#(= main_~i~0 45), 798163#(= main_~i~0 46), 798188#(= main_~i~0 71), 798189#(= main_~i~0 72), 798190#(= main_~i~0 73), 798191#(= main_~i~0 74), 798184#(= main_~i~0 67), 798185#(= main_~i~0 68), 798186#(= main_~i~0 69), 798187#(= main_~i~0 70), 798180#(= main_~i~0 63), 798181#(= main_~i~0 64), 798182#(= main_~i~0 65), 798183#(= main_~i~0 66), 798176#(= main_~i~0 59), 798177#(= main_~i~0 60), 798178#(= main_~i~0 61), 798179#(= main_~i~0 62), 798200#(= main_~i~0 83), 798201#(= main_~i~0 84), 798202#(= main_~i~0 85), 798203#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 798196#(= main_~i~0 79), 798197#(= main_~i~0 80), 798198#(= main_~i~0 81), 798199#(= main_~i~0 82), 798192#(= main_~i~0 75), 798193#(= main_~i~0 76), 798194#(= main_~i~0 77), 798195#(= main_~i~0 78)] [2018-04-13 14:19:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:19:52,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 14:19:52,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 14:19:52,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 14:19:52,190 INFO L87 Difference]: Start difference. First operand 729 states and 860 transitions. Second operand 89 states. [2018-04-13 14:20:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:03,038 INFO L93 Difference]: Finished difference Result 25129 states and 29256 transitions. [2018-04-13 14:20:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 14:20:03,038 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 437 [2018-04-13 14:20:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:03,061 INFO L225 Difference]: With dead ends: 25129 [2018-04-13 14:20:03,062 INFO L226 Difference]: Without dead ends: 25129 [2018-04-13 14:20:03,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 14:20:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25129 states. [2018-04-13 14:20:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25129 to 734. [2018-04-13 14:20:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-13 14:20:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 866 transitions. [2018-04-13 14:20:03,182 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 866 transitions. Word has length 437 [2018-04-13 14:20:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:03,182 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 866 transitions. [2018-04-13 14:20:03,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 14:20:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 866 transitions. [2018-04-13 14:20:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-04-13 14:20:03,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:03,184 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:03,184 INFO L408 AbstractCegarLoop]: === Iteration 136 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1870855560, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:03,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10954 backedges. 0 proven. 6627 refuted. 0 times theorem prover too weak. 4327 trivial. 0 not checked. [2018-04-13 14:20:04,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:04,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 14:20:04,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2018-04-13 14:20:04,032 INFO L182 omatonBuilderFactory]: Interpolants [824076#(= 1 main_~x~0), 824206#(= main_~x~0 27), 824201#(= main_~x~0 26), 824068#false, 824196#(= main_~x~0 25), 824071#(= 0 main_~x~0), 824067#true, 824221#(= main_~x~0 30), 824216#(= main_~x~0 29), 824091#(= main_~x~0 4), 824086#(= main_~x~0 3), 824081#(= main_~x~0 2), 824211#(= main_~x~0 28), 824236#(= main_~x~0 33), 824111#(= main_~x~0 8), 824106#(= main_~x~0 7), 824101#(= main_~x~0 6), 824231#(= main_~x~0 32), 824096#(= main_~x~0 5), 824226#(= main_~x~0 31), 824126#(= main_~x~0 11), 824121#(= main_~x~0 10), 824251#(= main_~x~0 36), 824116#(= main_~x~0 9), 824246#(= main_~x~0 35), 824241#(= main_~x~0 34), 824141#(= main_~x~0 14), 824271#(= main_~x~0 40), 824136#(= main_~x~0 13), 824266#(= main_~x~0 39), 824261#(= main_~x~0 38), 824256#(= main_~x~0 37), 824131#(= main_~x~0 12), 824156#(= main_~x~0 17), 824286#(= main_~x~0 43), 824281#(= main_~x~0 42), 824276#(= main_~x~0 41), 824151#(= main_~x~0 16), 824146#(= main_~x~0 15), 824301#(= main_~x~0 46), 824296#(= main_~x~0 45), 824171#(= main_~x~0 20), 824166#(= main_~x~0 19), 824161#(= main_~x~0 18), 824291#(= main_~x~0 44), 824191#(= main_~x~0 24), 824186#(= main_~x~0 23), 824181#(= main_~x~0 22), 824176#(= main_~x~0 21), 824306#(and (< main_~x~0 100000) (<= 0 main_~x~0))] [2018-04-13 14:20:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10954 backedges. 0 proven. 6627 refuted. 0 times theorem prover too weak. 4327 trivial. 0 not checked. [2018-04-13 14:20:04,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 14:20:04,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 14:20:04,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 14:20:04,032 INFO L87 Difference]: Start difference. First operand 734 states and 866 transitions. Second operand 50 states. [2018-04-13 14:20:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:06,486 INFO L93 Difference]: Finished difference Result 740 states and 873 transitions. [2018-04-13 14:20:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 14:20:06,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 487 [2018-04-13 14:20:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:06,487 INFO L225 Difference]: With dead ends: 740 [2018-04-13 14:20:06,487 INFO L226 Difference]: Without dead ends: 740 [2018-04-13 14:20:06,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 14:20:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-04-13 14:20:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-04-13 14:20:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-04-13 14:20:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 873 transitions. [2018-04-13 14:20:06,490 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 873 transitions. Word has length 487 [2018-04-13 14:20:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:06,491 INFO L459 AbstractCegarLoop]: Abstraction has 740 states and 873 transitions. [2018-04-13 14:20:06,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 14:20:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 873 transitions. [2018-04-13 14:20:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-04-13 14:20:06,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:06,492 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:06,492 INFO L408 AbstractCegarLoop]: === Iteration 137 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1891605687, now seen corresponding path program 87 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:06,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:08,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:08,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-13 14:20:08,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:08,427 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-13 14:20:08,428 INFO L182 omatonBuilderFactory]: Interpolants [825868#(= main_~i~0 77), 825869#(= main_~i~0 78), 825870#(= main_~i~0 79), 825871#(= main_~i~0 80), 825864#(= main_~i~0 73), 825865#(= main_~i~0 74), 825866#(= main_~i~0 75), 825867#(= main_~i~0 76), 825860#(= main_~i~0 69), 825861#(= main_~i~0 70), 825862#(= main_~i~0 71), 825863#(= main_~i~0 72), 825856#(= main_~i~0 65), 825857#(= main_~i~0 66), 825858#(= main_~i~0 67), 825859#(= main_~i~0 68), 825876#(= main_~i~0 85), 825877#(= main_~i~0 86), 825878#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 825872#(= main_~i~0 81), 825873#(= main_~i~0 82), 825874#(= main_~i~0 83), 825875#(= main_~i~0 84), 825788#false, 825791#(= main_~i~0 0), 825787#true, 825804#(= main_~i~0 13), 825805#(= main_~i~0 14), 825806#(= main_~i~0 15), 825807#(= main_~i~0 16), 825800#(= main_~i~0 9), 825801#(= main_~i~0 10), 825802#(= main_~i~0 11), 825803#(= main_~i~0 12), 825796#(= main_~i~0 5), 825797#(= main_~i~0 6), 825798#(= main_~i~0 7), 825799#(= main_~i~0 8), 825792#(= main_~i~0 1), 825793#(= main_~i~0 2), 825794#(= main_~i~0 3), 825795#(= main_~i~0 4), 825820#(= main_~i~0 29), 825821#(= main_~i~0 30), 825822#(= main_~i~0 31), 825823#(= main_~i~0 32), 825816#(= main_~i~0 25), 825817#(= main_~i~0 26), 825818#(= main_~i~0 27), 825819#(= main_~i~0 28), 825812#(= main_~i~0 21), 825813#(= main_~i~0 22), 825814#(= main_~i~0 23), 825815#(= main_~i~0 24), 825808#(= main_~i~0 17), 825809#(= main_~i~0 18), 825810#(= main_~i~0 19), 825811#(= main_~i~0 20), 825836#(= main_~i~0 45), 825837#(= main_~i~0 46), 825838#(= main_~i~0 47), 825839#(= main_~i~0 48), 825832#(= main_~i~0 41), 825833#(= main_~i~0 42), 825834#(= main_~i~0 43), 825835#(= main_~i~0 44), 825828#(= main_~i~0 37), 825829#(= main_~i~0 38), 825830#(= main_~i~0 39), 825831#(= main_~i~0 40), 825824#(= main_~i~0 33), 825825#(= main_~i~0 34), 825826#(= main_~i~0 35), 825827#(= main_~i~0 36), 825852#(= main_~i~0 61), 825853#(= main_~i~0 62), 825854#(= main_~i~0 63), 825855#(= main_~i~0 64), 825848#(= main_~i~0 57), 825849#(= main_~i~0 58), 825850#(= main_~i~0 59), 825851#(= main_~i~0 60), 825844#(= main_~i~0 53), 825845#(= main_~i~0 54), 825846#(= main_~i~0 55), 825847#(= main_~i~0 56), 825840#(= main_~i~0 49), 825841#(= main_~i~0 50), 825842#(= main_~i~0 51), 825843#(= main_~i~0 52)] [2018-04-13 14:20:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:08,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 14:20:08,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 14:20:08,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 14:20:08,429 INFO L87 Difference]: Start difference. First operand 740 states and 873 transitions. Second operand 90 states. [2018-04-13 14:20:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:19,839 INFO L93 Difference]: Finished difference Result 25943 states and 30205 transitions. [2018-04-13 14:20:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 14:20:19,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 442 [2018-04-13 14:20:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:19,863 INFO L225 Difference]: With dead ends: 25943 [2018-04-13 14:20:19,863 INFO L226 Difference]: Without dead ends: 25943 [2018-04-13 14:20:19,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 14:20:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25943 states. [2018-04-13 14:20:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25943 to 745. [2018-04-13 14:20:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-13 14:20:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 879 transitions. [2018-04-13 14:20:20,003 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 879 transitions. Word has length 442 [2018-04-13 14:20:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:20,003 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 879 transitions. [2018-04-13 14:20:20,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 14:20:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 879 transitions. [2018-04-13 14:20:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-13 14:20:20,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:20,004 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:20,004 INFO L408 AbstractCegarLoop]: === Iteration 138 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1642518874, now seen corresponding path program 88 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:20,007 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:22,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:22,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-13 14:20:22,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:22,003 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-13 14:20:22,003 INFO L182 omatonBuilderFactory]: Interpolants [852621#(= main_~i~0 50), 852620#(= main_~i~0 49), 852623#(= main_~i~0 52), 852622#(= main_~i~0 51), 852617#(= main_~i~0 46), 852616#(= main_~i~0 45), 852619#(= main_~i~0 48), 852618#(= main_~i~0 47), 852613#(= main_~i~0 42), 852612#(= main_~i~0 41), 852615#(= main_~i~0 44), 852614#(= main_~i~0 43), 852609#(= main_~i~0 38), 852608#(= main_~i~0 37), 852611#(= main_~i~0 40), 852610#(= main_~i~0 39), 852637#(= main_~i~0 66), 852636#(= main_~i~0 65), 852639#(= main_~i~0 68), 852638#(= main_~i~0 67), 852633#(= main_~i~0 62), 852632#(= main_~i~0 61), 852635#(= main_~i~0 64), 852634#(= main_~i~0 63), 852629#(= main_~i~0 58), 852628#(= main_~i~0 57), 852631#(= main_~i~0 60), 852630#(= main_~i~0 59), 852625#(= main_~i~0 54), 852624#(= main_~i~0 53), 852627#(= main_~i~0 56), 852626#(= main_~i~0 55), 852653#(= main_~i~0 82), 852652#(= main_~i~0 81), 852655#(= main_~i~0 84), 852654#(= main_~i~0 83), 852649#(= main_~i~0 78), 852648#(= main_~i~0 77), 852651#(= main_~i~0 80), 852650#(= main_~i~0 79), 852645#(= main_~i~0 74), 852644#(= main_~i~0 73), 852647#(= main_~i~0 76), 852646#(= main_~i~0 75), 852641#(= main_~i~0 70), 852640#(= main_~i~0 69), 852643#(= main_~i~0 72), 852642#(= main_~i~0 71), 852657#(= main_~i~0 86), 852656#(= main_~i~0 85), 852659#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 852658#(= main_~i~0 87), 852573#(= main_~i~0 2), 852572#(= main_~i~0 1), 852575#(= main_~i~0 4), 852574#(= main_~i~0 3), 852568#false, 852571#(= main_~i~0 0), 852567#true, 852589#(= main_~i~0 18), 852588#(= main_~i~0 17), 852591#(= main_~i~0 20), 852590#(= main_~i~0 19), 852585#(= main_~i~0 14), 852584#(= main_~i~0 13), 852587#(= main_~i~0 16), 852586#(= main_~i~0 15), 852581#(= main_~i~0 10), 852580#(= main_~i~0 9), 852583#(= main_~i~0 12), 852582#(= main_~i~0 11), 852577#(= main_~i~0 6), 852576#(= main_~i~0 5), 852579#(= main_~i~0 8), 852578#(= main_~i~0 7), 852605#(= main_~i~0 34), 852604#(= main_~i~0 33), 852607#(= main_~i~0 36), 852606#(= main_~i~0 35), 852601#(= main_~i~0 30), 852600#(= main_~i~0 29), 852603#(= main_~i~0 32), 852602#(= main_~i~0 31), 852597#(= main_~i~0 26), 852596#(= main_~i~0 25), 852599#(= main_~i~0 28), 852598#(= main_~i~0 27), 852593#(= main_~i~0 22), 852592#(= main_~i~0 21), 852595#(= main_~i~0 24), 852594#(= main_~i~0 23)] [2018-04-13 14:20:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:22,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 14:20:22,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 14:20:22,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 14:20:22,004 INFO L87 Difference]: Start difference. First operand 745 states and 879 transitions. Second operand 91 states. [2018-04-13 14:20:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:33,458 INFO L93 Difference]: Finished difference Result 26241 states and 30552 transitions. [2018-04-13 14:20:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 14:20:33,459 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 447 [2018-04-13 14:20:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:33,484 INFO L225 Difference]: With dead ends: 26241 [2018-04-13 14:20:33,484 INFO L226 Difference]: Without dead ends: 26241 [2018-04-13 14:20:33,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 14:20:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26241 states. [2018-04-13 14:20:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26241 to 750. [2018-04-13 14:20:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-04-13 14:20:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 885 transitions. [2018-04-13 14:20:33,617 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 885 transitions. Word has length 447 [2018-04-13 14:20:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:33,617 INFO L459 AbstractCegarLoop]: Abstraction has 750 states and 885 transitions. [2018-04-13 14:20:33,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 14:20:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 885 transitions. [2018-04-13 14:20:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-13 14:20:33,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:33,618 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:33,619 INFO L408 AbstractCegarLoop]: === Iteration 139 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1093194347, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:33,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11427 backedges. 0 proven. 6912 refuted. 0 times theorem prover too weak. 4515 trivial. 0 not checked. [2018-04-13 14:20:34,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:34,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 14:20:34,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2018-04-13 14:20:34,429 INFO L182 omatonBuilderFactory]: Interpolants [879885#(= main_~x~0 46), 879880#(= main_~x~0 45), 879755#(= main_~x~0 20), 879750#(= main_~x~0 19), 879745#(= main_~x~0 18), 879875#(= main_~x~0 44), 879775#(= main_~x~0 24), 879770#(= main_~x~0 23), 879765#(= main_~x~0 22), 879895#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 879760#(= main_~x~0 21), 879890#(= main_~x~0 47), 879660#(= 1 main_~x~0), 879790#(= main_~x~0 27), 879785#(= main_~x~0 26), 879652#false, 879780#(= main_~x~0 25), 879655#(= 0 main_~x~0), 879651#true, 879805#(= main_~x~0 30), 879800#(= main_~x~0 29), 879675#(= main_~x~0 4), 879670#(= main_~x~0 3), 879665#(= main_~x~0 2), 879795#(= main_~x~0 28), 879820#(= main_~x~0 33), 879695#(= main_~x~0 8), 879690#(= main_~x~0 7), 879685#(= main_~x~0 6), 879815#(= main_~x~0 32), 879680#(= main_~x~0 5), 879810#(= main_~x~0 31), 879710#(= main_~x~0 11), 879705#(= main_~x~0 10), 879835#(= main_~x~0 36), 879700#(= main_~x~0 9), 879830#(= main_~x~0 35), 879825#(= main_~x~0 34), 879725#(= main_~x~0 14), 879855#(= main_~x~0 40), 879720#(= main_~x~0 13), 879850#(= main_~x~0 39), 879845#(= main_~x~0 38), 879840#(= main_~x~0 37), 879715#(= main_~x~0 12), 879740#(= main_~x~0 17), 879870#(= main_~x~0 43), 879865#(= main_~x~0 42), 879860#(= main_~x~0 41), 879735#(= main_~x~0 16), 879730#(= main_~x~0 15)] [2018-04-13 14:20:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11427 backedges. 0 proven. 6912 refuted. 0 times theorem prover too weak. 4515 trivial. 0 not checked. [2018-04-13 14:20:34,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 14:20:34,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 14:20:34,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 14:20:34,429 INFO L87 Difference]: Start difference. First operand 750 states and 885 transitions. Second operand 51 states. [2018-04-13 14:20:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:36,993 INFO L93 Difference]: Finished difference Result 756 states and 892 transitions. [2018-04-13 14:20:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 14:20:36,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 497 [2018-04-13 14:20:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:36,994 INFO L225 Difference]: With dead ends: 756 [2018-04-13 14:20:36,994 INFO L226 Difference]: Without dead ends: 756 [2018-04-13 14:20:36,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 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-13 14:20:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-13 14:20:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2018-04-13 14:20:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-04-13 14:20:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 892 transitions. [2018-04-13 14:20:36,997 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 892 transitions. Word has length 497 [2018-04-13 14:20:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:36,997 INFO L459 AbstractCegarLoop]: Abstraction has 756 states and 892 transitions. [2018-04-13 14:20:36,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 14:20:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 892 transitions. [2018-04-13 14:20:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-13 14:20:36,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:36,998 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:36,999 INFO L408 AbstractCegarLoop]: === Iteration 140 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1076066839, now seen corresponding path program 89 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:37,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:39,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:39,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 14:20:39,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:39,157 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-13 14:20:39,157 INFO L182 omatonBuilderFactory]: Interpolants [881421#(= main_~i~0 9), 881420#(= main_~i~0 8), 881423#(= main_~i~0 11), 881422#(= main_~i~0 10), 881417#(= main_~i~0 5), 881416#(= main_~i~0 4), 881419#(= main_~i~0 7), 881418#(= main_~i~0 6), 881413#(= main_~i~0 1), 881412#(= main_~i~0 0), 881415#(= main_~i~0 3), 881414#(= main_~i~0 2), 881409#false, 881408#true, 881437#(= main_~i~0 25), 881436#(= main_~i~0 24), 881439#(= main_~i~0 27), 881438#(= main_~i~0 26), 881433#(= main_~i~0 21), 881432#(= main_~i~0 20), 881435#(= main_~i~0 23), 881434#(= main_~i~0 22), 881429#(= main_~i~0 17), 881428#(= main_~i~0 16), 881431#(= main_~i~0 19), 881430#(= main_~i~0 18), 881425#(= main_~i~0 13), 881424#(= main_~i~0 12), 881427#(= main_~i~0 15), 881426#(= main_~i~0 14), 881453#(= main_~i~0 41), 881452#(= main_~i~0 40), 881455#(= main_~i~0 43), 881454#(= main_~i~0 42), 881449#(= main_~i~0 37), 881448#(= main_~i~0 36), 881451#(= main_~i~0 39), 881450#(= main_~i~0 38), 881445#(= main_~i~0 33), 881444#(= main_~i~0 32), 881447#(= main_~i~0 35), 881446#(= main_~i~0 34), 881441#(= main_~i~0 29), 881440#(= main_~i~0 28), 881443#(= main_~i~0 31), 881442#(= main_~i~0 30), 881469#(= main_~i~0 57), 881468#(= main_~i~0 56), 881471#(= main_~i~0 59), 881470#(= main_~i~0 58), 881465#(= main_~i~0 53), 881464#(= main_~i~0 52), 881467#(= main_~i~0 55), 881466#(= main_~i~0 54), 881461#(= main_~i~0 49), 881460#(= main_~i~0 48), 881463#(= main_~i~0 51), 881462#(= main_~i~0 50), 881457#(= main_~i~0 45), 881456#(= main_~i~0 44), 881459#(= main_~i~0 47), 881458#(= main_~i~0 46), 881485#(= main_~i~0 73), 881484#(= main_~i~0 72), 881487#(= main_~i~0 75), 881486#(= main_~i~0 74), 881481#(= main_~i~0 69), 881480#(= main_~i~0 68), 881483#(= main_~i~0 71), 881482#(= main_~i~0 70), 881477#(= main_~i~0 65), 881476#(= main_~i~0 64), 881479#(= main_~i~0 67), 881478#(= main_~i~0 66), 881473#(= main_~i~0 61), 881472#(= main_~i~0 60), 881475#(= main_~i~0 63), 881474#(= main_~i~0 62), 881501#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 881500#(= main_~i~0 88), 881497#(= main_~i~0 85), 881496#(= main_~i~0 84), 881499#(= main_~i~0 87), 881498#(= main_~i~0 86), 881493#(= main_~i~0 81), 881492#(= main_~i~0 80), 881495#(= main_~i~0 83), 881494#(= main_~i~0 82), 881489#(= main_~i~0 77), 881488#(= main_~i~0 76), 881491#(= main_~i~0 79), 881490#(= main_~i~0 78)] [2018-04-13 14:20:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:39,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 14:20:39,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 14:20:39,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 14:20:39,159 INFO L87 Difference]: Start difference. First operand 756 states and 892 transitions. Second operand 92 states. [2018-04-13 14:20:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:20:50,882 INFO L93 Difference]: Finished difference Result 27073 states and 31522 transitions. [2018-04-13 14:20:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 14:20:50,882 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 452 [2018-04-13 14:20:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:20:50,909 INFO L225 Difference]: With dead ends: 27073 [2018-04-13 14:20:50,909 INFO L226 Difference]: Without dead ends: 27073 [2018-04-13 14:20:50,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 14:20:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27073 states. [2018-04-13 14:20:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27073 to 761. [2018-04-13 14:20:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-04-13 14:20:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 898 transitions. [2018-04-13 14:20:51,066 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 898 transitions. Word has length 452 [2018-04-13 14:20:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:20:51,066 INFO L459 AbstractCegarLoop]: Abstraction has 761 states and 898 transitions. [2018-04-13 14:20:51,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 14:20:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 898 transitions. [2018-04-13 14:20:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-13 14:20:51,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:20:51,067 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-13 14:20:51,067 INFO L408 AbstractCegarLoop]: === Iteration 141 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:20:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1217878714, now seen corresponding path program 90 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:20:51,070 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:20:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:20:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:53,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:20:53,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-13 14:20:53,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:20:53,187 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-13 14:20:53,187 INFO L182 omatonBuilderFactory]: Interpolants [909341#(= main_~i~0 1), 909340#(= main_~i~0 0), 909343#(= main_~i~0 3), 909342#(= main_~i~0 2), 909337#false, 909336#true, 909357#(= main_~i~0 17), 909356#(= main_~i~0 16), 909359#(= main_~i~0 19), 909358#(= main_~i~0 18), 909353#(= main_~i~0 13), 909352#(= main_~i~0 12), 909355#(= main_~i~0 15), 909354#(= main_~i~0 14), 909349#(= main_~i~0 9), 909348#(= main_~i~0 8), 909351#(= main_~i~0 11), 909350#(= main_~i~0 10), 909345#(= main_~i~0 5), 909344#(= main_~i~0 4), 909347#(= main_~i~0 7), 909346#(= main_~i~0 6), 909373#(= main_~i~0 33), 909372#(= main_~i~0 32), 909375#(= main_~i~0 35), 909374#(= main_~i~0 34), 909369#(= main_~i~0 29), 909368#(= main_~i~0 28), 909371#(= main_~i~0 31), 909370#(= main_~i~0 30), 909365#(= main_~i~0 25), 909364#(= main_~i~0 24), 909367#(= main_~i~0 27), 909366#(= main_~i~0 26), 909361#(= main_~i~0 21), 909360#(= main_~i~0 20), 909363#(= main_~i~0 23), 909362#(= main_~i~0 22), 909389#(= main_~i~0 49), 909388#(= main_~i~0 48), 909391#(= main_~i~0 51), 909390#(= main_~i~0 50), 909385#(= main_~i~0 45), 909384#(= main_~i~0 44), 909387#(= main_~i~0 47), 909386#(= main_~i~0 46), 909381#(= main_~i~0 41), 909380#(= main_~i~0 40), 909383#(= main_~i~0 43), 909382#(= main_~i~0 42), 909377#(= main_~i~0 37), 909376#(= main_~i~0 36), 909379#(= main_~i~0 39), 909378#(= main_~i~0 38), 909405#(= main_~i~0 65), 909404#(= main_~i~0 64), 909407#(= main_~i~0 67), 909406#(= main_~i~0 66), 909401#(= main_~i~0 61), 909400#(= main_~i~0 60), 909403#(= main_~i~0 63), 909402#(= main_~i~0 62), 909397#(= main_~i~0 57), 909396#(= main_~i~0 56), 909399#(= main_~i~0 59), 909398#(= main_~i~0 58), 909393#(= main_~i~0 53), 909392#(= main_~i~0 52), 909395#(= main_~i~0 55), 909394#(= main_~i~0 54), 909421#(= main_~i~0 81), 909420#(= main_~i~0 80), 909423#(= main_~i~0 83), 909422#(= main_~i~0 82), 909417#(= main_~i~0 77), 909416#(= main_~i~0 76), 909419#(= main_~i~0 79), 909418#(= main_~i~0 78), 909413#(= main_~i~0 73), 909412#(= main_~i~0 72), 909415#(= main_~i~0 75), 909414#(= main_~i~0 74), 909409#(= main_~i~0 69), 909408#(= main_~i~0 68), 909411#(= main_~i~0 71), 909410#(= main_~i~0 70), 909429#(= main_~i~0 89), 909428#(= main_~i~0 88), 909430#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 909425#(= main_~i~0 85), 909424#(= main_~i~0 84), 909427#(= main_~i~0 87), 909426#(= main_~i~0 86)] [2018-04-13 14:20:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:20:53,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 14:20:53,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 14:20:53,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 14:20:53,188 INFO L87 Difference]: Start difference. First operand 761 states and 898 transitions. Second operand 93 states. [2018-04-13 14:21:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:05,612 INFO L93 Difference]: Finished difference Result 27377 states and 31876 transitions. [2018-04-13 14:21:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 14:21:05,612 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 457 [2018-04-13 14:21:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:05,639 INFO L225 Difference]: With dead ends: 27377 [2018-04-13 14:21:05,639 INFO L226 Difference]: Without dead ends: 27377 [2018-04-13 14:21:05,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 14:21:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27377 states. [2018-04-13 14:21:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27377 to 766. [2018-04-13 14:21:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-04-13 14:21:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 904 transitions. [2018-04-13 14:21:05,773 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 904 transitions. Word has length 457 [2018-04-13 14:21:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:05,773 INFO L459 AbstractCegarLoop]: Abstraction has 766 states and 904 transitions. [2018-04-13 14:21:05,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 14:21:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 904 transitions. [2018-04-13 14:21:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-13 14:21:05,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:05,775 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:05,775 INFO L408 AbstractCegarLoop]: === Iteration 142 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1935681422, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:05,799 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11910 backedges. 0 proven. 7203 refuted. 0 times theorem prover too weak. 4707 trivial. 0 not checked. [2018-04-13 14:21:06,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:06,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 14:21:06,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2018-04-13 14:21:06,634 INFO L182 omatonBuilderFactory]: Interpolants [937743#(= main_~x~0 33), 937613#(= main_~x~0 7), 937738#(= main_~x~0 32), 937608#(= main_~x~0 6), 937733#(= main_~x~0 31), 937603#(= main_~x~0 5), 937728#(= main_~x~0 30), 937758#(= main_~x~0 36), 937628#(= main_~x~0 10), 937753#(= main_~x~0 35), 937623#(= main_~x~0 9), 937748#(= main_~x~0 34), 937618#(= main_~x~0 8), 937773#(= main_~x~0 39), 937643#(= main_~x~0 13), 937768#(= main_~x~0 38), 937638#(= main_~x~0 12), 937763#(= main_~x~0 37), 937633#(= main_~x~0 11), 937663#(= main_~x~0 17), 937788#(= main_~x~0 42), 937658#(= main_~x~0 16), 937783#(= main_~x~0 41), 937653#(= main_~x~0 15), 937778#(= main_~x~0 40), 937648#(= main_~x~0 14), 937678#(= main_~x~0 20), 937803#(= main_~x~0 45), 937673#(= main_~x~0 19), 937798#(= main_~x~0 44), 937668#(= main_~x~0 18), 937793#(= main_~x~0 43), 937823#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 937693#(= main_~x~0 23), 937818#(= main_~x~0 48), 937688#(= main_~x~0 22), 937813#(= main_~x~0 47), 937683#(= main_~x~0 21), 937808#(= main_~x~0 46), 937583#(= 1 main_~x~0), 937708#(= main_~x~0 26), 937578#(= 0 main_~x~0), 937574#true, 937575#false, 937703#(= main_~x~0 25), 937698#(= main_~x~0 24), 937598#(= main_~x~0 4), 937723#(= main_~x~0 29), 937593#(= main_~x~0 3), 937718#(= main_~x~0 28), 937588#(= main_~x~0 2), 937713#(= main_~x~0 27)] [2018-04-13 14:21:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11910 backedges. 0 proven. 7203 refuted. 0 times theorem prover too weak. 4707 trivial. 0 not checked. [2018-04-13 14:21:06,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 14:21:06,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 14:21:06,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 14:21:06,634 INFO L87 Difference]: Start difference. First operand 766 states and 904 transitions. Second operand 52 states. [2018-04-13 14:21:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:09,145 INFO L93 Difference]: Finished difference Result 772 states and 911 transitions. [2018-04-13 14:21:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 14:21:09,145 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 507 [2018-04-13 14:21:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:09,146 INFO L225 Difference]: With dead ends: 772 [2018-04-13 14:21:09,146 INFO L226 Difference]: Without dead ends: 772 [2018-04-13 14:21:09,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 101 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-13 14:21:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-04-13 14:21:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2018-04-13 14:21:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-04-13 14:21:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 911 transitions. [2018-04-13 14:21:09,149 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 911 transitions. Word has length 507 [2018-04-13 14:21:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:09,149 INFO L459 AbstractCegarLoop]: Abstraction has 772 states and 911 transitions. [2018-04-13 14:21:09,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 14:21:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 911 transitions. [2018-04-13 14:21:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-13 14:21:09,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:09,150 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:09,150 INFO L408 AbstractCegarLoop]: === Iteration 143 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1277550729, now seen corresponding path program 91 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:09,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:11,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:11,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 14:21:11,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:11,109 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-13 14:21:11,109 INFO L182 omatonBuilderFactory]: Interpolants [939406#(= main_~i~0 34), 939407#(= main_~i~0 35), 939404#(= main_~i~0 32), 939405#(= main_~i~0 33), 939402#(= main_~i~0 30), 939403#(= main_~i~0 31), 939400#(= main_~i~0 28), 939401#(= main_~i~0 29), 939398#(= main_~i~0 26), 939399#(= main_~i~0 27), 939396#(= main_~i~0 24), 939397#(= main_~i~0 25), 939394#(= main_~i~0 22), 939395#(= main_~i~0 23), 939392#(= main_~i~0 20), 939393#(= main_~i~0 21), 939422#(= main_~i~0 50), 939423#(= main_~i~0 51), 939420#(= main_~i~0 48), 939421#(= main_~i~0 49), 939418#(= main_~i~0 46), 939419#(= main_~i~0 47), 939416#(= main_~i~0 44), 939417#(= main_~i~0 45), 939414#(= main_~i~0 42), 939415#(= main_~i~0 43), 939412#(= main_~i~0 40), 939413#(= main_~i~0 41), 939410#(= main_~i~0 38), 939411#(= main_~i~0 39), 939408#(= main_~i~0 36), 939409#(= main_~i~0 37), 939438#(= main_~i~0 66), 939439#(= main_~i~0 67), 939436#(= main_~i~0 64), 939437#(= main_~i~0 65), 939434#(= main_~i~0 62), 939435#(= main_~i~0 63), 939432#(= main_~i~0 60), 939433#(= main_~i~0 61), 939430#(= main_~i~0 58), 939431#(= main_~i~0 59), 939428#(= main_~i~0 56), 939429#(= main_~i~0 57), 939426#(= main_~i~0 54), 939427#(= main_~i~0 55), 939424#(= main_~i~0 52), 939425#(= main_~i~0 53), 939454#(= main_~i~0 82), 939455#(= main_~i~0 83), 939452#(= main_~i~0 80), 939453#(= main_~i~0 81), 939450#(= main_~i~0 78), 939451#(= main_~i~0 79), 939448#(= main_~i~0 76), 939449#(= main_~i~0 77), 939446#(= main_~i~0 74), 939447#(= main_~i~0 75), 939444#(= main_~i~0 72), 939445#(= main_~i~0 73), 939442#(= main_~i~0 70), 939443#(= main_~i~0 71), 939440#(= main_~i~0 68), 939441#(= main_~i~0 69), 939462#(= main_~i~0 90), 939463#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 939460#(= main_~i~0 88), 939461#(= main_~i~0 89), 939458#(= main_~i~0 86), 939459#(= main_~i~0 87), 939456#(= main_~i~0 84), 939457#(= main_~i~0 85), 939374#(= main_~i~0 2), 939375#(= main_~i~0 3), 939372#(= main_~i~0 0), 939373#(= main_~i~0 1), 939368#true, 939369#false, 939390#(= main_~i~0 18), 939391#(= main_~i~0 19), 939388#(= main_~i~0 16), 939389#(= main_~i~0 17), 939386#(= main_~i~0 14), 939387#(= main_~i~0 15), 939384#(= main_~i~0 12), 939385#(= main_~i~0 13), 939382#(= main_~i~0 10), 939383#(= main_~i~0 11), 939380#(= main_~i~0 8), 939381#(= main_~i~0 9), 939378#(= main_~i~0 6), 939379#(= main_~i~0 7), 939376#(= main_~i~0 4), 939377#(= main_~i~0 5)] [2018-04-13 14:21:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:11,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 14:21:11,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 14:21:11,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 14:21:11,110 INFO L87 Difference]: Start difference. First operand 772 states and 911 transitions. Second operand 94 states. [2018-04-13 14:21:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:23,370 INFO L93 Difference]: Finished difference Result 28227 states and 32867 transitions. [2018-04-13 14:21:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 14:21:23,370 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 462 [2018-04-13 14:21:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:23,398 INFO L225 Difference]: With dead ends: 28227 [2018-04-13 14:21:23,399 INFO L226 Difference]: Without dead ends: 28227 [2018-04-13 14:21:23,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 14:21:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2018-04-13 14:21:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 777. [2018-04-13 14:21:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-04-13 14:21:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 917 transitions. [2018-04-13 14:21:23,551 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 917 transitions. Word has length 462 [2018-04-13 14:21:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:23,551 INFO L459 AbstractCegarLoop]: Abstraction has 777 states and 917 transitions. [2018-04-13 14:21:23,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 14:21:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 917 transitions. [2018-04-13 14:21:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-13 14:21:23,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:23,553 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:23,553 INFO L408 AbstractCegarLoop]: === Iteration 144 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 680153871, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:23,555 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 7500 refuted. 0 times theorem prover too weak. 4903 trivial. 0 not checked. [2018-04-13 14:21:24,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:24,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 14:21:24,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2018-04-13 14:21:24,302 INFO L182 omatonBuilderFactory]: Interpolants [968717#(= main_~x~0 49), 968587#(= main_~x~0 23), 968712#(= main_~x~0 48), 968582#(= main_~x~0 22), 968707#(= main_~x~0 47), 968577#(= main_~x~0 21), 968607#(= main_~x~0 27), 968477#(= 1 main_~x~0), 968602#(= main_~x~0 26), 968472#(= 0 main_~x~0), 968468#true, 968469#false, 968597#(= main_~x~0 25), 968722#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 968592#(= main_~x~0 24), 968622#(= main_~x~0 30), 968492#(= main_~x~0 4), 968617#(= main_~x~0 29), 968487#(= main_~x~0 3), 968612#(= main_~x~0 28), 968482#(= main_~x~0 2), 968637#(= main_~x~0 33), 968507#(= main_~x~0 7), 968632#(= main_~x~0 32), 968502#(= main_~x~0 6), 968627#(= main_~x~0 31), 968497#(= main_~x~0 5), 968527#(= main_~x~0 11), 968652#(= main_~x~0 36), 968522#(= main_~x~0 10), 968647#(= main_~x~0 35), 968517#(= main_~x~0 9), 968642#(= main_~x~0 34), 968512#(= main_~x~0 8), 968542#(= main_~x~0 14), 968667#(= main_~x~0 39), 968537#(= main_~x~0 13), 968662#(= main_~x~0 38), 968532#(= main_~x~0 12), 968657#(= main_~x~0 37), 968687#(= main_~x~0 43), 968557#(= main_~x~0 17), 968682#(= main_~x~0 42), 968552#(= main_~x~0 16), 968677#(= main_~x~0 41), 968547#(= main_~x~0 15), 968672#(= main_~x~0 40), 968702#(= main_~x~0 46), 968572#(= main_~x~0 20), 968697#(= main_~x~0 45), 968567#(= main_~x~0 19), 968692#(= main_~x~0 44), 968562#(= main_~x~0 18)] [2018-04-13 14:21:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 7500 refuted. 0 times theorem prover too weak. 4903 trivial. 0 not checked. [2018-04-13 14:21:24,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 14:21:24,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 14:21:24,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 14:21:24,303 INFO L87 Difference]: Start difference. First operand 777 states and 917 transitions. Second operand 53 states. [2018-04-13 14:21:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:26,906 INFO L93 Difference]: Finished difference Result 783 states and 924 transitions. [2018-04-13 14:21:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 14:21:26,906 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 517 [2018-04-13 14:21:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:26,907 INFO L225 Difference]: With dead ends: 783 [2018-04-13 14:21:26,907 INFO L226 Difference]: Without dead ends: 783 [2018-04-13 14:21:26,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 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-13 14:21:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-04-13 14:21:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2018-04-13 14:21:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-04-13 14:21:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 924 transitions. [2018-04-13 14:21:26,910 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 924 transitions. Word has length 517 [2018-04-13 14:21:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:26,910 INFO L459 AbstractCegarLoop]: Abstraction has 783 states and 924 transitions. [2018-04-13 14:21:26,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 14:21:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 924 transitions. [2018-04-13 14:21:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-13 14:21:26,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:26,912 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:26,912 INFO L408 AbstractCegarLoop]: === Iteration 145 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1491229670, now seen corresponding path program 92 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:26,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:29,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:29,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-13 14:21:29,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:29,090 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-13 14:21:29,090 INFO L182 omatonBuilderFactory]: Interpolants [970382#(= main_~i~0 89), 970383#(= main_~i~0 90), 970380#(= main_~i~0 87), 970381#(= main_~i~0 88), 970378#(= main_~i~0 85), 970379#(= main_~i~0 86), 970376#(= main_~i~0 83), 970377#(= main_~i~0 84), 970374#(= main_~i~0 81), 970375#(= main_~i~0 82), 970372#(= main_~i~0 79), 970373#(= main_~i~0 80), 970370#(= main_~i~0 77), 970371#(= main_~i~0 78), 970368#(= main_~i~0 75), 970369#(= main_~i~0 76), 970384#(= main_~i~0 91), 970385#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 970302#(= main_~i~0 9), 970303#(= main_~i~0 10), 970300#(= main_~i~0 7), 970301#(= main_~i~0 8), 970298#(= main_~i~0 5), 970299#(= main_~i~0 6), 970296#(= main_~i~0 3), 970297#(= main_~i~0 4), 970294#(= main_~i~0 1), 970295#(= main_~i~0 2), 970293#(= main_~i~0 0), 970290#false, 970289#true, 970318#(= main_~i~0 25), 970319#(= main_~i~0 26), 970316#(= main_~i~0 23), 970317#(= main_~i~0 24), 970314#(= main_~i~0 21), 970315#(= main_~i~0 22), 970312#(= main_~i~0 19), 970313#(= main_~i~0 20), 970310#(= main_~i~0 17), 970311#(= main_~i~0 18), 970308#(= main_~i~0 15), 970309#(= main_~i~0 16), 970306#(= main_~i~0 13), 970307#(= main_~i~0 14), 970304#(= main_~i~0 11), 970305#(= main_~i~0 12), 970334#(= main_~i~0 41), 970335#(= main_~i~0 42), 970332#(= main_~i~0 39), 970333#(= main_~i~0 40), 970330#(= main_~i~0 37), 970331#(= main_~i~0 38), 970328#(= main_~i~0 35), 970329#(= main_~i~0 36), 970326#(= main_~i~0 33), 970327#(= main_~i~0 34), 970324#(= main_~i~0 31), 970325#(= main_~i~0 32), 970322#(= main_~i~0 29), 970323#(= main_~i~0 30), 970320#(= main_~i~0 27), 970321#(= main_~i~0 28), 970350#(= main_~i~0 57), 970351#(= main_~i~0 58), 970348#(= main_~i~0 55), 970349#(= main_~i~0 56), 970346#(= main_~i~0 53), 970347#(= main_~i~0 54), 970344#(= main_~i~0 51), 970345#(= main_~i~0 52), 970342#(= main_~i~0 49), 970343#(= main_~i~0 50), 970340#(= main_~i~0 47), 970341#(= main_~i~0 48), 970338#(= main_~i~0 45), 970339#(= main_~i~0 46), 970336#(= main_~i~0 43), 970337#(= main_~i~0 44), 970366#(= main_~i~0 73), 970367#(= main_~i~0 74), 970364#(= main_~i~0 71), 970365#(= main_~i~0 72), 970362#(= main_~i~0 69), 970363#(= main_~i~0 70), 970360#(= main_~i~0 67), 970361#(= main_~i~0 68), 970358#(= main_~i~0 65), 970359#(= main_~i~0 66), 970356#(= main_~i~0 63), 970357#(= main_~i~0 64), 970354#(= main_~i~0 61), 970355#(= main_~i~0 62), 970352#(= main_~i~0 59), 970353#(= main_~i~0 60)] [2018-04-13 14:21:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:29,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 14:21:29,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 14:21:29,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 14:21:29,091 INFO L87 Difference]: Start difference. First operand 783 states and 924 transitions. Second operand 95 states. [2018-04-13 14:21:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:41,676 INFO L93 Difference]: Finished difference Result 29089 states and 33872 transitions. [2018-04-13 14:21:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 14:21:41,677 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 467 [2018-04-13 14:21:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:41,705 INFO L225 Difference]: With dead ends: 29089 [2018-04-13 14:21:41,705 INFO L226 Difference]: Without dead ends: 29089 [2018-04-13 14:21:41,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 14:21:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29089 states. [2018-04-13 14:21:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29089 to 788. [2018-04-13 14:21:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-04-13 14:21:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 930 transitions. [2018-04-13 14:21:42,106 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 930 transitions. Word has length 467 [2018-04-13 14:21:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:42,106 INFO L459 AbstractCegarLoop]: Abstraction has 788 states and 930 transitions. [2018-04-13 14:21:42,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 14:21:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 930 transitions. [2018-04-13 14:21:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-04-13 14:21:42,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:42,108 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:42,108 INFO L408 AbstractCegarLoop]: === Iteration 146 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1190556457, now seen corresponding path program 93 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:42,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:44,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:44,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-13 14:21:44,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:44,413 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-13 14:21:44,413 INFO L182 omatonBuilderFactory]: Interpolants [1000335#(= main_~i~0 68), 1000334#(= main_~i~0 67), 1000333#(= main_~i~0 66), 1000332#(= main_~i~0 65), 1000331#(= main_~i~0 64), 1000330#(= main_~i~0 63), 1000329#(= main_~i~0 62), 1000328#(= main_~i~0 61), 1000327#(= main_~i~0 60), 1000326#(= main_~i~0 59), 1000325#(= main_~i~0 58), 1000324#(= main_~i~0 57), 1000323#(= main_~i~0 56), 1000322#(= main_~i~0 55), 1000321#(= main_~i~0 54), 1000320#(= main_~i~0 53), 1000351#(= main_~i~0 84), 1000350#(= main_~i~0 83), 1000349#(= main_~i~0 82), 1000348#(= main_~i~0 81), 1000347#(= main_~i~0 80), 1000346#(= main_~i~0 79), 1000345#(= main_~i~0 78), 1000344#(= main_~i~0 77), 1000343#(= main_~i~0 76), 1000342#(= main_~i~0 75), 1000341#(= main_~i~0 74), 1000340#(= main_~i~0 73), 1000339#(= main_~i~0 72), 1000338#(= main_~i~0 71), 1000337#(= main_~i~0 70), 1000336#(= main_~i~0 69), 1000360#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1000359#(= main_~i~0 92), 1000358#(= main_~i~0 91), 1000357#(= main_~i~0 90), 1000356#(= main_~i~0 89), 1000355#(= main_~i~0 88), 1000354#(= main_~i~0 87), 1000353#(= main_~i~0 86), 1000352#(= main_~i~0 85), 1000271#(= main_~i~0 4), 1000270#(= main_~i~0 3), 1000269#(= main_~i~0 2), 1000268#(= main_~i~0 1), 1000267#(= main_~i~0 0), 1000264#false, 1000263#true, 1000287#(= main_~i~0 20), 1000286#(= main_~i~0 19), 1000285#(= main_~i~0 18), 1000284#(= main_~i~0 17), 1000283#(= main_~i~0 16), 1000282#(= main_~i~0 15), 1000281#(= main_~i~0 14), 1000280#(= main_~i~0 13), 1000279#(= main_~i~0 12), 1000278#(= main_~i~0 11), 1000277#(= main_~i~0 10), 1000276#(= main_~i~0 9), 1000275#(= main_~i~0 8), 1000274#(= main_~i~0 7), 1000273#(= main_~i~0 6), 1000272#(= main_~i~0 5), 1000303#(= main_~i~0 36), 1000302#(= main_~i~0 35), 1000301#(= main_~i~0 34), 1000300#(= main_~i~0 33), 1000299#(= main_~i~0 32), 1000298#(= main_~i~0 31), 1000297#(= main_~i~0 30), 1000296#(= main_~i~0 29), 1000295#(= main_~i~0 28), 1000294#(= main_~i~0 27), 1000293#(= main_~i~0 26), 1000292#(= main_~i~0 25), 1000291#(= main_~i~0 24), 1000290#(= main_~i~0 23), 1000289#(= main_~i~0 22), 1000288#(= main_~i~0 21), 1000319#(= main_~i~0 52), 1000318#(= main_~i~0 51), 1000317#(= main_~i~0 50), 1000316#(= main_~i~0 49), 1000315#(= main_~i~0 48), 1000314#(= main_~i~0 47), 1000313#(= main_~i~0 46), 1000312#(= main_~i~0 45), 1000311#(= main_~i~0 44), 1000310#(= main_~i~0 43), 1000309#(= main_~i~0 42), 1000308#(= main_~i~0 41), 1000307#(= main_~i~0 40), 1000306#(= main_~i~0 39), 1000305#(= main_~i~0 38), 1000304#(= main_~i~0 37)] [2018-04-13 14:21:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:21:44,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-13 14:21:44,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-13 14:21:44,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 14:21:44,414 INFO L87 Difference]: Start difference. First operand 788 states and 930 transitions. Second operand 96 states. [2018-04-13 14:21:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:21:57,186 INFO L93 Difference]: Finished difference Result 29405 states and 34240 transitions. [2018-04-13 14:21:57,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 14:21:57,187 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 472 [2018-04-13 14:21:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:21:57,212 INFO L225 Difference]: With dead ends: 29405 [2018-04-13 14:21:57,212 INFO L226 Difference]: Without dead ends: 29405 [2018-04-13 14:21:57,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 14:21:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29405 states. [2018-04-13 14:21:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29405 to 793. [2018-04-13 14:21:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-04-13 14:21:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 936 transitions. [2018-04-13 14:21:57,355 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 936 transitions. Word has length 472 [2018-04-13 14:21:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:21:57,355 INFO L459 AbstractCegarLoop]: Abstraction has 793 states and 936 transitions. [2018-04-13 14:21:57,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-13 14:21:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 936 transitions. [2018-04-13 14:21:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-13 14:21:57,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:21:57,357 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:21:57,357 INFO L408 AbstractCegarLoop]: === Iteration 147 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:21:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1251611284, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:21:57,359 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:21:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:21:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12906 backedges. 0 proven. 7803 refuted. 0 times theorem prover too weak. 5103 trivial. 0 not checked. [2018-04-13 14:21:58,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:21:58,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 14:21:58,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:21:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2018-04-13 14:21:58,280 INFO L182 omatonBuilderFactory]: Interpolants [1030798#(= main_~x~0 47), 1030668#(= main_~x~0 21), 1030793#(= main_~x~0 46), 1030663#(= main_~x~0 20), 1030788#(= main_~x~0 45), 1030658#(= main_~x~0 19), 1030559#true, 1030813#(= main_~x~0 50), 1030683#(= main_~x~0 24), 1030808#(= main_~x~0 49), 1030678#(= main_~x~0 23), 1030803#(= main_~x~0 48), 1030673#(= main_~x~0 22), 1030703#(= main_~x~0 28), 1030573#(= main_~x~0 2), 1030698#(= main_~x~0 27), 1030568#(= 1 main_~x~0), 1030693#(= main_~x~0 26), 1030563#(= 0 main_~x~0), 1030818#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1030560#false, 1030688#(= main_~x~0 25), 1030718#(= main_~x~0 31), 1030588#(= main_~x~0 5), 1030713#(= main_~x~0 30), 1030583#(= main_~x~0 4), 1030708#(= main_~x~0 29), 1030578#(= main_~x~0 3), 1030733#(= main_~x~0 34), 1030603#(= main_~x~0 8), 1030728#(= main_~x~0 33), 1030598#(= main_~x~0 7), 1030723#(= main_~x~0 32), 1030593#(= main_~x~0 6), 1030623#(= main_~x~0 12), 1030748#(= main_~x~0 37), 1030618#(= main_~x~0 11), 1030743#(= main_~x~0 36), 1030613#(= main_~x~0 10), 1030738#(= main_~x~0 35), 1030608#(= main_~x~0 9), 1030638#(= main_~x~0 15), 1030763#(= main_~x~0 40), 1030633#(= main_~x~0 14), 1030758#(= main_~x~0 39), 1030628#(= main_~x~0 13), 1030753#(= main_~x~0 38), 1030783#(= main_~x~0 44), 1030653#(= main_~x~0 18), 1030778#(= main_~x~0 43), 1030648#(= main_~x~0 17), 1030773#(= main_~x~0 42), 1030643#(= main_~x~0 16), 1030768#(= main_~x~0 41)] [2018-04-13 14:21:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12906 backedges. 0 proven. 7803 refuted. 0 times theorem prover too weak. 5103 trivial. 0 not checked. [2018-04-13 14:21:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 14:21:58,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 14:21:58,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 14:21:58,280 INFO L87 Difference]: Start difference. First operand 793 states and 936 transitions. Second operand 54 states. [2018-04-13 14:22:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:22:00,998 INFO L93 Difference]: Finished difference Result 799 states and 943 transitions. [2018-04-13 14:22:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 14:22:00,998 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 527 [2018-04-13 14:22:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:22:00,998 INFO L225 Difference]: With dead ends: 799 [2018-04-13 14:22:00,999 INFO L226 Difference]: Without dead ends: 799 [2018-04-13 14:22:00,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 105 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-13 14:22:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-13 14:22:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2018-04-13 14:22:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-04-13 14:22:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 943 transitions. [2018-04-13 14:22:01,002 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 943 transitions. Word has length 527 [2018-04-13 14:22:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:22:01,002 INFO L459 AbstractCegarLoop]: Abstraction has 799 states and 943 transitions. [2018-04-13 14:22:01,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 14:22:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 943 transitions. [2018-04-13 14:22:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-04-13 14:22:01,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:22:01,003 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-04-13 14:22:01,003 INFO L408 AbstractCegarLoop]: === Iteration 148 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:22:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -585086330, now seen corresponding path program 94 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:22:01,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:22:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:03,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:22:03,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-13 14:22:03,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:22:03,556 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-13 14:22:03,556 INFO L182 omatonBuilderFactory]: Interpolants [1032463#(= main_~i~0 42), 1032462#(= main_~i~0 41), 1032461#(= main_~i~0 40), 1032460#(= main_~i~0 39), 1032459#(= main_~i~0 38), 1032458#(= main_~i~0 37), 1032457#(= main_~i~0 36), 1032456#(= main_~i~0 35), 1032455#(= main_~i~0 34), 1032454#(= main_~i~0 33), 1032453#(= main_~i~0 32), 1032452#(= main_~i~0 31), 1032451#(= main_~i~0 30), 1032450#(= main_~i~0 29), 1032449#(= main_~i~0 28), 1032448#(= main_~i~0 27), 1032479#(= main_~i~0 58), 1032478#(= main_~i~0 57), 1032477#(= main_~i~0 56), 1032476#(= main_~i~0 55), 1032475#(= main_~i~0 54), 1032474#(= main_~i~0 53), 1032473#(= main_~i~0 52), 1032472#(= main_~i~0 51), 1032471#(= main_~i~0 50), 1032470#(= main_~i~0 49), 1032469#(= main_~i~0 48), 1032468#(= main_~i~0 47), 1032467#(= main_~i~0 46), 1032466#(= main_~i~0 45), 1032465#(= main_~i~0 44), 1032464#(= main_~i~0 43), 1032495#(= main_~i~0 74), 1032494#(= main_~i~0 73), 1032493#(= main_~i~0 72), 1032492#(= main_~i~0 71), 1032491#(= main_~i~0 70), 1032490#(= main_~i~0 69), 1032489#(= main_~i~0 68), 1032488#(= main_~i~0 67), 1032487#(= main_~i~0 66), 1032486#(= main_~i~0 65), 1032485#(= main_~i~0 64), 1032484#(= main_~i~0 63), 1032483#(= main_~i~0 62), 1032482#(= main_~i~0 61), 1032481#(= main_~i~0 60), 1032480#(= main_~i~0 59), 1032511#(= main_~i~0 90), 1032510#(= main_~i~0 89), 1032509#(= main_~i~0 88), 1032508#(= main_~i~0 87), 1032507#(= main_~i~0 86), 1032506#(= main_~i~0 85), 1032505#(= main_~i~0 84), 1032504#(= main_~i~0 83), 1032503#(= main_~i~0 82), 1032502#(= main_~i~0 81), 1032501#(= main_~i~0 80), 1032500#(= main_~i~0 79), 1032499#(= main_~i~0 78), 1032498#(= main_~i~0 77), 1032497#(= main_~i~0 76), 1032496#(= main_~i~0 75), 1032515#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1032514#(= main_~i~0 93), 1032513#(= main_~i~0 92), 1032512#(= main_~i~0 91), 1032431#(= main_~i~0 10), 1032430#(= main_~i~0 9), 1032429#(= main_~i~0 8), 1032428#(= main_~i~0 7), 1032427#(= main_~i~0 6), 1032426#(= main_~i~0 5), 1032425#(= main_~i~0 4), 1032424#(= main_~i~0 3), 1032423#(= main_~i~0 2), 1032422#(= main_~i~0 1), 1032421#(= main_~i~0 0), 1032418#false, 1032417#true, 1032447#(= main_~i~0 26), 1032446#(= main_~i~0 25), 1032445#(= main_~i~0 24), 1032444#(= main_~i~0 23), 1032443#(= main_~i~0 22), 1032442#(= main_~i~0 21), 1032441#(= main_~i~0 20), 1032440#(= main_~i~0 19), 1032439#(= main_~i~0 18), 1032438#(= main_~i~0 17), 1032437#(= main_~i~0 16), 1032436#(= main_~i~0 15), 1032435#(= main_~i~0 14), 1032434#(= main_~i~0 13), 1032433#(= main_~i~0 12), 1032432#(= main_~i~0 11)] [2018-04-13 14:22:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:03,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 14:22:03,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 14:22:03,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 14:22:03,558 INFO L87 Difference]: Start difference. First operand 799 states and 943 transitions. Second operand 97 states. [2018-04-13 14:22:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:22:16,529 INFO L93 Difference]: Finished difference Result 30285 states and 35266 transitions. [2018-04-13 14:22:16,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 14:22:16,530 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 477 [2018-04-13 14:22:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:22:16,559 INFO L225 Difference]: With dead ends: 30285 [2018-04-13 14:22:16,559 INFO L226 Difference]: Without dead ends: 30285 [2018-04-13 14:22:16,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 14:22:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30285 states. [2018-04-13 14:22:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30285 to 804. [2018-04-13 14:22:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-04-13 14:22:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 949 transitions. [2018-04-13 14:22:16,713 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 949 transitions. Word has length 477 [2018-04-13 14:22:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:22:16,713 INFO L459 AbstractCegarLoop]: Abstraction has 804 states and 949 transitions. [2018-04-13 14:22:16,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 14:22:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 949 transitions. [2018-04-13 14:22:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-04-13 14:22:16,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:22:16,715 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-04-13 14:22:16,715 INFO L408 AbstractCegarLoop]: === Iteration 149 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:22:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2057846217, now seen corresponding path program 95 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:22:16,717 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:22:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:19,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:22:19,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-13 14:22:19,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:22:19,028 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-13 14:22:19,029 INFO L182 omatonBuilderFactory]: Interpolants [1063696#(= main_~i~0 87), 1063697#(= main_~i~0 88), 1063698#(= main_~i~0 89), 1063699#(= main_~i~0 90), 1063700#(= main_~i~0 91), 1063701#(= main_~i~0 92), 1063702#(= main_~i~0 93), 1063703#(= main_~i~0 94), 1063704#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1063680#(= main_~i~0 71), 1063681#(= main_~i~0 72), 1063682#(= main_~i~0 73), 1063683#(= main_~i~0 74), 1063684#(= main_~i~0 75), 1063685#(= main_~i~0 76), 1063686#(= main_~i~0 77), 1063687#(= main_~i~0 78), 1063688#(= main_~i~0 79), 1063689#(= main_~i~0 80), 1063690#(= main_~i~0 81), 1063691#(= main_~i~0 82), 1063692#(= main_~i~0 83), 1063693#(= main_~i~0 84), 1063694#(= main_~i~0 85), 1063695#(= main_~i~0 86), 1063605#true, 1063606#false, 1063609#(= main_~i~0 0), 1063610#(= main_~i~0 1), 1063611#(= main_~i~0 2), 1063612#(= main_~i~0 3), 1063613#(= main_~i~0 4), 1063614#(= main_~i~0 5), 1063615#(= main_~i~0 6), 1063632#(= main_~i~0 23), 1063633#(= main_~i~0 24), 1063634#(= main_~i~0 25), 1063635#(= main_~i~0 26), 1063636#(= main_~i~0 27), 1063637#(= main_~i~0 28), 1063638#(= main_~i~0 29), 1063639#(= main_~i~0 30), 1063640#(= main_~i~0 31), 1063641#(= main_~i~0 32), 1063642#(= main_~i~0 33), 1063643#(= main_~i~0 34), 1063644#(= main_~i~0 35), 1063645#(= main_~i~0 36), 1063646#(= main_~i~0 37), 1063647#(= main_~i~0 38), 1063616#(= main_~i~0 7), 1063617#(= main_~i~0 8), 1063618#(= main_~i~0 9), 1063619#(= main_~i~0 10), 1063620#(= main_~i~0 11), 1063621#(= main_~i~0 12), 1063622#(= main_~i~0 13), 1063623#(= main_~i~0 14), 1063624#(= main_~i~0 15), 1063625#(= main_~i~0 16), 1063626#(= main_~i~0 17), 1063627#(= main_~i~0 18), 1063628#(= main_~i~0 19), 1063629#(= main_~i~0 20), 1063630#(= main_~i~0 21), 1063631#(= main_~i~0 22), 1063664#(= main_~i~0 55), 1063665#(= main_~i~0 56), 1063666#(= main_~i~0 57), 1063667#(= main_~i~0 58), 1063668#(= main_~i~0 59), 1063669#(= main_~i~0 60), 1063670#(= main_~i~0 61), 1063671#(= main_~i~0 62), 1063672#(= main_~i~0 63), 1063673#(= main_~i~0 64), 1063674#(= main_~i~0 65), 1063675#(= main_~i~0 66), 1063676#(= main_~i~0 67), 1063677#(= main_~i~0 68), 1063678#(= main_~i~0 69), 1063679#(= main_~i~0 70), 1063648#(= main_~i~0 39), 1063649#(= main_~i~0 40), 1063650#(= main_~i~0 41), 1063651#(= main_~i~0 42), 1063652#(= main_~i~0 43), 1063653#(= main_~i~0 44), 1063654#(= main_~i~0 45), 1063655#(= main_~i~0 46), 1063656#(= main_~i~0 47), 1063657#(= main_~i~0 48), 1063658#(= main_~i~0 49), 1063659#(= main_~i~0 50), 1063660#(= main_~i~0 51), 1063661#(= main_~i~0 52), 1063662#(= main_~i~0 53), 1063663#(= main_~i~0 54)] [2018-04-13 14:22:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 14:22:19,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 14:22:19,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=9218, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 14:22:19,030 INFO L87 Difference]: Start difference. First operand 804 states and 949 transitions. Second operand 98 states. [2018-04-13 14:22:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:22:31,956 INFO L93 Difference]: Finished difference Result 30607 states and 35641 transitions. [2018-04-13 14:22:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 14:22:31,956 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 482 [2018-04-13 14:22:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:22:31,985 INFO L225 Difference]: With dead ends: 30607 [2018-04-13 14:22:31,985 INFO L226 Difference]: Without dead ends: 30607 [2018-04-13 14:22:31,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=288, Invalid=9218, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 14:22:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30607 states. [2018-04-13 14:22:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30607 to 809. [2018-04-13 14:22:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-04-13 14:22:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 955 transitions. [2018-04-13 14:22:32,132 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 955 transitions. Word has length 482 [2018-04-13 14:22:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:22:32,133 INFO L459 AbstractCegarLoop]: Abstraction has 809 states and 955 transitions. [2018-04-13 14:22:32,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 14:22:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 955 transitions. [2018-04-13 14:22:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-04-13 14:22:32,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:22:32,134 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:22:32,134 INFO L408 AbstractCegarLoop]: === Iteration 150 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:22:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash -685901943, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:22:32,137 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:22:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13419 backedges. 0 proven. 8112 refuted. 0 times theorem prover too weak. 5307 trivial. 0 not checked. [2018-04-13 14:22:33,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:22:33,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 14:22:33,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:22:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2018-04-13 14:22:33,185 INFO L182 omatonBuilderFactory]: Interpolants [1095185#(= main_~x~0 12), 1095315#(= main_~x~0 38), 1095190#(= main_~x~0 13), 1095320#(= main_~x~0 39), 1095195#(= main_~x~0 14), 1095325#(= main_~x~0 40), 1095170#(= main_~x~0 9), 1095300#(= main_~x~0 35), 1095175#(= main_~x~0 10), 1095305#(= main_~x~0 36), 1095180#(= main_~x~0 11), 1095310#(= main_~x~0 37), 1095345#(= main_~x~0 44), 1095220#(= main_~x~0 19), 1095350#(= main_~x~0 45), 1095225#(= main_~x~0 20), 1095355#(= main_~x~0 46), 1095230#(= main_~x~0 21), 1095200#(= main_~x~0 15), 1095330#(= main_~x~0 41), 1095205#(= main_~x~0 16), 1095335#(= main_~x~0 42), 1095210#(= main_~x~0 17), 1095340#(= main_~x~0 43), 1095215#(= main_~x~0 18), 1095121#true, 1095122#false, 1095250#(= main_~x~0 25), 1095380#(= main_~x~0 51), 1095125#(= 0 main_~x~0), 1095255#(= main_~x~0 26), 1095385#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1095130#(= 1 main_~x~0), 1095260#(= main_~x~0 27), 1095135#(= main_~x~0 2), 1095360#(= main_~x~0 47), 1095235#(= main_~x~0 22), 1095365#(= main_~x~0 48), 1095240#(= main_~x~0 23), 1095370#(= main_~x~0 49), 1095245#(= main_~x~0 24), 1095375#(= main_~x~0 50), 1095280#(= main_~x~0 31), 1095155#(= main_~x~0 6), 1095285#(= main_~x~0 32), 1095160#(= main_~x~0 7), 1095290#(= main_~x~0 33), 1095165#(= main_~x~0 8), 1095295#(= main_~x~0 34), 1095265#(= main_~x~0 28), 1095140#(= main_~x~0 3), 1095270#(= main_~x~0 29), 1095145#(= main_~x~0 4), 1095275#(= main_~x~0 30), 1095150#(= main_~x~0 5)] [2018-04-13 14:22:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13419 backedges. 0 proven. 8112 refuted. 0 times theorem prover too weak. 5307 trivial. 0 not checked. [2018-04-13 14:22:33,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 14:22:33,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 14:22:33,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 14:22:33,186 INFO L87 Difference]: Start difference. First operand 809 states and 955 transitions. Second operand 55 states. [2018-04-13 14:22:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:22:36,047 INFO L93 Difference]: Finished difference Result 815 states and 962 transitions. [2018-04-13 14:22:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 14:22:36,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 537 [2018-04-13 14:22:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:22:36,048 INFO L225 Difference]: With dead ends: 815 [2018-04-13 14:22:36,048 INFO L226 Difference]: Without dead ends: 815 [2018-04-13 14:22:36,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 14:22:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-04-13 14:22:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-04-13 14:22:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-13 14:22:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 962 transitions. [2018-04-13 14:22:36,052 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 962 transitions. Word has length 537 [2018-04-13 14:22:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:22:36,052 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 962 transitions. [2018-04-13 14:22:36,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 14:22:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 962 transitions. [2018-04-13 14:22:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-04-13 14:22:36,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:22:36,054 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-04-13 14:22:36,054 INFO L408 AbstractCegarLoop]: === Iteration 151 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:22:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1505988314, now seen corresponding path program 96 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:22:36,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:22:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:38,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:22:38,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-13 14:22:38,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:22:38,447 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-13 14:22:38,447 INFO L182 omatonBuilderFactory]: Interpolants [1097016#true, 1097017#false, 1097020#(= main_~i~0 0), 1097021#(= main_~i~0 1), 1097022#(= main_~i~0 2), 1097023#(= main_~i~0 3), 1097040#(= main_~i~0 20), 1097041#(= main_~i~0 21), 1097042#(= main_~i~0 22), 1097043#(= main_~i~0 23), 1097044#(= main_~i~0 24), 1097045#(= main_~i~0 25), 1097046#(= main_~i~0 26), 1097047#(= main_~i~0 27), 1097048#(= main_~i~0 28), 1097049#(= main_~i~0 29), 1097050#(= main_~i~0 30), 1097051#(= main_~i~0 31), 1097052#(= main_~i~0 32), 1097053#(= main_~i~0 33), 1097054#(= main_~i~0 34), 1097055#(= main_~i~0 35), 1097024#(= main_~i~0 4), 1097025#(= main_~i~0 5), 1097026#(= main_~i~0 6), 1097027#(= main_~i~0 7), 1097028#(= main_~i~0 8), 1097029#(= main_~i~0 9), 1097030#(= main_~i~0 10), 1097031#(= main_~i~0 11), 1097032#(= main_~i~0 12), 1097033#(= main_~i~0 13), 1097034#(= main_~i~0 14), 1097035#(= main_~i~0 15), 1097036#(= main_~i~0 16), 1097037#(= main_~i~0 17), 1097038#(= main_~i~0 18), 1097039#(= main_~i~0 19), 1097072#(= main_~i~0 52), 1097073#(= main_~i~0 53), 1097074#(= main_~i~0 54), 1097075#(= main_~i~0 55), 1097076#(= main_~i~0 56), 1097077#(= main_~i~0 57), 1097078#(= main_~i~0 58), 1097079#(= main_~i~0 59), 1097080#(= main_~i~0 60), 1097081#(= main_~i~0 61), 1097082#(= main_~i~0 62), 1097083#(= main_~i~0 63), 1097084#(= main_~i~0 64), 1097085#(= main_~i~0 65), 1097086#(= main_~i~0 66), 1097087#(= main_~i~0 67), 1097056#(= main_~i~0 36), 1097057#(= main_~i~0 37), 1097058#(= main_~i~0 38), 1097059#(= main_~i~0 39), 1097060#(= main_~i~0 40), 1097061#(= main_~i~0 41), 1097062#(= main_~i~0 42), 1097063#(= main_~i~0 43), 1097064#(= main_~i~0 44), 1097065#(= main_~i~0 45), 1097066#(= main_~i~0 46), 1097067#(= main_~i~0 47), 1097068#(= main_~i~0 48), 1097069#(= main_~i~0 49), 1097070#(= main_~i~0 50), 1097071#(= main_~i~0 51), 1097104#(= main_~i~0 84), 1097105#(= main_~i~0 85), 1097106#(= main_~i~0 86), 1097107#(= main_~i~0 87), 1097108#(= main_~i~0 88), 1097109#(= main_~i~0 89), 1097110#(= main_~i~0 90), 1097111#(= main_~i~0 91), 1097112#(= main_~i~0 92), 1097113#(= main_~i~0 93), 1097114#(= main_~i~0 94), 1097115#(= main_~i~0 95), 1097116#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1097088#(= main_~i~0 68), 1097089#(= main_~i~0 69), 1097090#(= main_~i~0 70), 1097091#(= main_~i~0 71), 1097092#(= main_~i~0 72), 1097093#(= main_~i~0 73), 1097094#(= main_~i~0 74), 1097095#(= main_~i~0 75), 1097096#(= main_~i~0 76), 1097097#(= main_~i~0 77), 1097098#(= main_~i~0 78), 1097099#(= main_~i~0 79), 1097100#(= main_~i~0 80), 1097101#(= main_~i~0 81), 1097102#(= main_~i~0 82), 1097103#(= main_~i~0 83)] [2018-04-13 14:22:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:38,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 14:22:38,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 14:22:38,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 14:22:38,449 INFO L87 Difference]: Start difference. First operand 815 states and 962 transitions. Second operand 99 states. [2018-04-13 14:22:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:22:51,805 INFO L93 Difference]: Finished difference Result 31505 states and 36688 transitions. [2018-04-13 14:22:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 14:22:51,805 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 487 [2018-04-13 14:22:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:22:51,832 INFO L225 Difference]: With dead ends: 31505 [2018-04-13 14:22:51,833 INFO L226 Difference]: Without dead ends: 31505 [2018-04-13 14:22:51,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 14:22:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31505 states. [2018-04-13 14:22:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31505 to 820. [2018-04-13 14:22:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-04-13 14:22:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 968 transitions. [2018-04-13 14:22:51,991 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 968 transitions. Word has length 487 [2018-04-13 14:22:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:22:51,991 INFO L459 AbstractCegarLoop]: Abstraction has 820 states and 968 transitions. [2018-04-13 14:22:51,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 14:22:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 968 transitions. [2018-04-13 14:22:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-13 14:22:51,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:22:51,993 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-04-13 14:22:51,993 INFO L408 AbstractCegarLoop]: === Iteration 152 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:22:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash -152387689, now seen corresponding path program 97 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:22:51,995 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:22:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:22:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:54,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:22:54,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 14:22:54,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:22:54,616 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-13 14:22:54,616 INFO L182 omatonBuilderFactory]: Interpolants [1129489#(= main_~i~0 43), 1129488#(= main_~i~0 42), 1129491#(= main_~i~0 45), 1129490#(= main_~i~0 44), 1129493#(= main_~i~0 47), 1129492#(= main_~i~0 46), 1129495#(= main_~i~0 49), 1129494#(= main_~i~0 48), 1129497#(= main_~i~0 51), 1129496#(= main_~i~0 50), 1129499#(= main_~i~0 53), 1129498#(= main_~i~0 52), 1129501#(= main_~i~0 55), 1129500#(= main_~i~0 54), 1129503#(= main_~i~0 57), 1129502#(= main_~i~0 56), 1129473#(= main_~i~0 27), 1129472#(= main_~i~0 26), 1129475#(= main_~i~0 29), 1129474#(= main_~i~0 28), 1129477#(= main_~i~0 31), 1129476#(= main_~i~0 30), 1129479#(= main_~i~0 33), 1129478#(= main_~i~0 32), 1129481#(= main_~i~0 35), 1129480#(= main_~i~0 34), 1129483#(= main_~i~0 37), 1129482#(= main_~i~0 36), 1129485#(= main_~i~0 39), 1129484#(= main_~i~0 38), 1129487#(= main_~i~0 41), 1129486#(= main_~i~0 40), 1129521#(= main_~i~0 75), 1129520#(= main_~i~0 74), 1129523#(= main_~i~0 77), 1129522#(= main_~i~0 76), 1129525#(= main_~i~0 79), 1129524#(= main_~i~0 78), 1129527#(= main_~i~0 81), 1129526#(= main_~i~0 80), 1129529#(= main_~i~0 83), 1129528#(= main_~i~0 82), 1129531#(= main_~i~0 85), 1129530#(= main_~i~0 84), 1129533#(= main_~i~0 87), 1129532#(= main_~i~0 86), 1129535#(= main_~i~0 89), 1129534#(= main_~i~0 88), 1129505#(= main_~i~0 59), 1129504#(= main_~i~0 58), 1129507#(= main_~i~0 61), 1129506#(= main_~i~0 60), 1129509#(= main_~i~0 63), 1129508#(= main_~i~0 62), 1129511#(= main_~i~0 65), 1129510#(= main_~i~0 64), 1129513#(= main_~i~0 67), 1129512#(= main_~i~0 66), 1129515#(= main_~i~0 69), 1129514#(= main_~i~0 68), 1129517#(= main_~i~0 71), 1129516#(= main_~i~0 70), 1129519#(= main_~i~0 73), 1129518#(= main_~i~0 72), 1129537#(= main_~i~0 91), 1129536#(= main_~i~0 90), 1129539#(= main_~i~0 93), 1129538#(= main_~i~0 92), 1129541#(= main_~i~0 95), 1129540#(= main_~i~0 94), 1129543#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1129542#(= main_~i~0 96), 1129457#(= main_~i~0 11), 1129456#(= main_~i~0 10), 1129459#(= main_~i~0 13), 1129458#(= main_~i~0 12), 1129461#(= main_~i~0 15), 1129460#(= main_~i~0 14), 1129463#(= main_~i~0 17), 1129462#(= main_~i~0 16), 1129465#(= main_~i~0 19), 1129464#(= main_~i~0 18), 1129467#(= main_~i~0 21), 1129466#(= main_~i~0 20), 1129469#(= main_~i~0 23), 1129468#(= main_~i~0 22), 1129471#(= main_~i~0 25), 1129470#(= main_~i~0 24), 1129443#false, 1129442#true, 1129447#(= main_~i~0 1), 1129446#(= main_~i~0 0), 1129449#(= main_~i~0 3), 1129448#(= main_~i~0 2), 1129451#(= main_~i~0 5), 1129450#(= main_~i~0 4), 1129453#(= main_~i~0 7), 1129452#(= main_~i~0 6), 1129455#(= main_~i~0 9), 1129454#(= main_~i~0 8)] [2018-04-13 14:22:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:22:54,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 14:22:54,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 14:22:54,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 14:22:54,617 INFO L87 Difference]: Start difference. First operand 820 states and 968 transitions. Second operand 100 states. [2018-04-13 14:23:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:23:08,977 INFO L93 Difference]: Finished difference Result 31833 states and 37070 transitions. [2018-04-13 14:23:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 14:23:08,977 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 492 [2018-04-13 14:23:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:23:09,006 INFO L225 Difference]: With dead ends: 31833 [2018-04-13 14:23:09,006 INFO L226 Difference]: Without dead ends: 31833 [2018-04-13 14:23:09,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 14:23:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31833 states. [2018-04-13 14:23:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31833 to 825. [2018-04-13 14:23:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-04-13 14:23:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 974 transitions. [2018-04-13 14:23:09,182 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 974 transitions. Word has length 492 [2018-04-13 14:23:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:23:09,182 INFO L459 AbstractCegarLoop]: Abstraction has 825 states and 974 transitions. [2018-04-13 14:23:09,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 14:23:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 974 transitions. [2018-04-13 14:23:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-13 14:23:09,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:23:09,184 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:23:09,184 INFO L408 AbstractCegarLoop]: === Iteration 153 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:23:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash -4603546, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:23:09,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:23:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13942 backedges. 0 proven. 8427 refuted. 0 times theorem prover too weak. 5515 trivial. 0 not checked. [2018-04-13 14:23:10,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:23:10,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 14:23:10,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:23:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2018-04-13 14:23:10,109 INFO L182 omatonBuilderFactory]: Interpolants [1162256#(= main_~x~0 10), 1162386#(= main_~x~0 36), 1162261#(= main_~x~0 11), 1162391#(= main_~x~0 37), 1162266#(= main_~x~0 12), 1162396#(= main_~x~0 38), 1162271#(= main_~x~0 13), 1162241#(= main_~x~0 7), 1162371#(= main_~x~0 33), 1162246#(= main_~x~0 8), 1162376#(= main_~x~0 34), 1162251#(= main_~x~0 9), 1162381#(= main_~x~0 35), 1162416#(= main_~x~0 42), 1162291#(= main_~x~0 17), 1162421#(= main_~x~0 43), 1162296#(= main_~x~0 18), 1162426#(= main_~x~0 44), 1162301#(= main_~x~0 19), 1162431#(= main_~x~0 45), 1162401#(= main_~x~0 39), 1162276#(= main_~x~0 14), 1162406#(= main_~x~0 40), 1162281#(= main_~x~0 15), 1162411#(= main_~x~0 41), 1162286#(= main_~x~0 16), 1162321#(= main_~x~0 23), 1162451#(= main_~x~0 49), 1162326#(= main_~x~0 24), 1162456#(= main_~x~0 50), 1162203#false, 1162331#(= main_~x~0 25), 1162202#true, 1162461#(= main_~x~0 51), 1162206#(= 0 main_~x~0), 1162306#(= main_~x~0 20), 1162436#(= main_~x~0 46), 1162311#(= main_~x~0 21), 1162441#(= main_~x~0 47), 1162316#(= main_~x~0 22), 1162446#(= main_~x~0 48), 1162226#(= main_~x~0 4), 1162356#(= main_~x~0 30), 1162231#(= main_~x~0 5), 1162361#(= main_~x~0 31), 1162236#(= main_~x~0 6), 1162366#(= main_~x~0 32), 1162336#(= main_~x~0 26), 1162211#(= 1 main_~x~0), 1162466#(= main_~x~0 52), 1162341#(= main_~x~0 27), 1162471#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1162216#(= main_~x~0 2), 1162346#(= main_~x~0 28), 1162221#(= main_~x~0 3), 1162351#(= main_~x~0 29)] [2018-04-13 14:23:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13942 backedges. 0 proven. 8427 refuted. 0 times theorem prover too weak. 5515 trivial. 0 not checked. [2018-04-13 14:23:10,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 14:23:10,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 14:23:10,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 14:23:10,110 INFO L87 Difference]: Start difference. First operand 825 states and 974 transitions. Second operand 56 states. [2018-04-13 14:23:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:23:13,134 INFO L93 Difference]: Finished difference Result 831 states and 981 transitions. [2018-04-13 14:23:13,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 14:23:13,134 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 547 [2018-04-13 14:23:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:23:13,135 INFO L225 Difference]: With dead ends: 831 [2018-04-13 14:23:13,135 INFO L226 Difference]: Without dead ends: 831 [2018-04-13 14:23:13,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 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-13 14:23:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-04-13 14:23:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-04-13 14:23:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-04-13 14:23:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 981 transitions. [2018-04-13 14:23:13,139 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 981 transitions. Word has length 547 [2018-04-13 14:23:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:23:13,139 INFO L459 AbstractCegarLoop]: Abstraction has 831 states and 981 transitions. [2018-04-13 14:23:13,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 14:23:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 981 transitions. [2018-04-13 14:23:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-13 14:23:13,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:23:13,141 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-04-13 14:23:13,141 INFO L408 AbstractCegarLoop]: === Iteration 154 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:23:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1110388794, now seen corresponding path program 98 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:23:13,143 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:23:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:15,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:23:15,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-13 14:23:15,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:23:15,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-13 14:23:15,590 INFO L182 omatonBuilderFactory]: Interpolants [1164145#(= main_~i~0 7), 1164144#(= main_~i~0 6), 1164147#(= main_~i~0 9), 1164146#(= main_~i~0 8), 1164149#(= main_~i~0 11), 1164148#(= main_~i~0 10), 1164151#(= main_~i~0 13), 1164150#(= main_~i~0 12), 1164153#(= main_~i~0 15), 1164152#(= main_~i~0 14), 1164155#(= main_~i~0 17), 1164154#(= main_~i~0 16), 1164157#(= main_~i~0 19), 1164156#(= main_~i~0 18), 1164159#(= main_~i~0 21), 1164158#(= main_~i~0 20), 1164135#false, 1164134#true, 1164139#(= main_~i~0 1), 1164138#(= main_~i~0 0), 1164141#(= main_~i~0 3), 1164140#(= main_~i~0 2), 1164143#(= main_~i~0 5), 1164142#(= main_~i~0 4), 1164177#(= main_~i~0 39), 1164176#(= main_~i~0 38), 1164179#(= main_~i~0 41), 1164178#(= main_~i~0 40), 1164181#(= main_~i~0 43), 1164180#(= main_~i~0 42), 1164183#(= main_~i~0 45), 1164182#(= main_~i~0 44), 1164185#(= main_~i~0 47), 1164184#(= main_~i~0 46), 1164187#(= main_~i~0 49), 1164186#(= main_~i~0 48), 1164189#(= main_~i~0 51), 1164188#(= main_~i~0 50), 1164191#(= main_~i~0 53), 1164190#(= main_~i~0 52), 1164161#(= main_~i~0 23), 1164160#(= main_~i~0 22), 1164163#(= main_~i~0 25), 1164162#(= main_~i~0 24), 1164165#(= main_~i~0 27), 1164164#(= main_~i~0 26), 1164167#(= main_~i~0 29), 1164166#(= main_~i~0 28), 1164169#(= main_~i~0 31), 1164168#(= main_~i~0 30), 1164171#(= main_~i~0 33), 1164170#(= main_~i~0 32), 1164173#(= main_~i~0 35), 1164172#(= main_~i~0 34), 1164175#(= main_~i~0 37), 1164174#(= main_~i~0 36), 1164209#(= main_~i~0 71), 1164208#(= main_~i~0 70), 1164211#(= main_~i~0 73), 1164210#(= main_~i~0 72), 1164213#(= main_~i~0 75), 1164212#(= main_~i~0 74), 1164215#(= main_~i~0 77), 1164214#(= main_~i~0 76), 1164217#(= main_~i~0 79), 1164216#(= main_~i~0 78), 1164219#(= main_~i~0 81), 1164218#(= main_~i~0 80), 1164221#(= main_~i~0 83), 1164220#(= main_~i~0 82), 1164223#(= main_~i~0 85), 1164222#(= main_~i~0 84), 1164193#(= main_~i~0 55), 1164192#(= main_~i~0 54), 1164195#(= main_~i~0 57), 1164194#(= main_~i~0 56), 1164197#(= main_~i~0 59), 1164196#(= main_~i~0 58), 1164199#(= main_~i~0 61), 1164198#(= main_~i~0 60), 1164201#(= main_~i~0 63), 1164200#(= main_~i~0 62), 1164203#(= main_~i~0 65), 1164202#(= main_~i~0 64), 1164205#(= main_~i~0 67), 1164204#(= main_~i~0 66), 1164207#(= main_~i~0 69), 1164206#(= main_~i~0 68), 1164225#(= main_~i~0 87), 1164224#(= main_~i~0 86), 1164227#(= main_~i~0 89), 1164226#(= main_~i~0 88), 1164229#(= main_~i~0 91), 1164228#(= main_~i~0 90), 1164231#(= main_~i~0 93), 1164230#(= main_~i~0 92), 1164233#(= main_~i~0 95), 1164232#(= main_~i~0 94), 1164235#(= main_~i~0 97), 1164234#(= main_~i~0 96), 1164236#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-04-13 14:23:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:15,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 14:23:15,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 14:23:15,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 14:23:15,591 INFO L87 Difference]: Start difference. First operand 831 states and 981 transitions. Second operand 101 states. [2018-04-13 14:23:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:23:30,027 INFO L93 Difference]: Finished difference Result 32749 states and 38138 transitions. [2018-04-13 14:23:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 14:23:30,028 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 497 [2018-04-13 14:23:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:23:30,062 INFO L225 Difference]: With dead ends: 32749 [2018-04-13 14:23:30,062 INFO L226 Difference]: Without dead ends: 32749 [2018-04-13 14:23:30,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 14:23:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32749 states. [2018-04-13 14:23:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32749 to 836. [2018-04-13 14:23:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-04-13 14:23:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 987 transitions. [2018-04-13 14:23:30,319 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 987 transitions. Word has length 497 [2018-04-13 14:23:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:23:30,319 INFO L459 AbstractCegarLoop]: Abstraction has 836 states and 987 transitions. [2018-04-13 14:23:30,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 14:23:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 987 transitions. [2018-04-13 14:23:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-13 14:23:30,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:23:30,321 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-04-13 14:23:30,321 INFO L408 AbstractCegarLoop]: === Iteration 155 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:23:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash -194476809, now seen corresponding path program 99 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:23:30,324 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:23:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:33,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:23:33,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-13 14:23:33,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:23:33,033 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-13 14:23:33,034 INFO L182 omatonBuilderFactory]: Interpolants [1197842#(= main_~i~0 16), 1197843#(= main_~i~0 17), 1197840#(= main_~i~0 14), 1197841#(= main_~i~0 15), 1197846#(= main_~i~0 20), 1197847#(= main_~i~0 21), 1197844#(= main_~i~0 18), 1197845#(= main_~i~0 19), 1197850#(= main_~i~0 24), 1197851#(= main_~i~0 25), 1197848#(= main_~i~0 22), 1197849#(= main_~i~0 23), 1197854#(= main_~i~0 28), 1197855#(= main_~i~0 29), 1197852#(= main_~i~0 26), 1197853#(= main_~i~0 27), 1197826#(= main_~i~0 0), 1197827#(= main_~i~0 1), 1197830#(= main_~i~0 4), 1197831#(= main_~i~0 5), 1197828#(= main_~i~0 2), 1197829#(= main_~i~0 3), 1197834#(= main_~i~0 8), 1197835#(= main_~i~0 9), 1197832#(= main_~i~0 6), 1197833#(= main_~i~0 7), 1197838#(= main_~i~0 12), 1197839#(= main_~i~0 13), 1197836#(= main_~i~0 10), 1197837#(= main_~i~0 11), 1197874#(= main_~i~0 48), 1197875#(= main_~i~0 49), 1197872#(= main_~i~0 46), 1197873#(= main_~i~0 47), 1197878#(= main_~i~0 52), 1197879#(= main_~i~0 53), 1197876#(= main_~i~0 50), 1197877#(= main_~i~0 51), 1197882#(= main_~i~0 56), 1197883#(= main_~i~0 57), 1197880#(= main_~i~0 54), 1197881#(= main_~i~0 55), 1197886#(= main_~i~0 60), 1197887#(= main_~i~0 61), 1197884#(= main_~i~0 58), 1197885#(= main_~i~0 59), 1197858#(= main_~i~0 32), 1197859#(= main_~i~0 33), 1197856#(= main_~i~0 30), 1197857#(= main_~i~0 31), 1197862#(= main_~i~0 36), 1197863#(= main_~i~0 37), 1197860#(= main_~i~0 34), 1197861#(= main_~i~0 35), 1197866#(= main_~i~0 40), 1197867#(= main_~i~0 41), 1197864#(= main_~i~0 38), 1197865#(= main_~i~0 39), 1197870#(= main_~i~0 44), 1197871#(= main_~i~0 45), 1197868#(= main_~i~0 42), 1197869#(= main_~i~0 43), 1197906#(= main_~i~0 80), 1197907#(= main_~i~0 81), 1197904#(= main_~i~0 78), 1197905#(= main_~i~0 79), 1197910#(= main_~i~0 84), 1197911#(= main_~i~0 85), 1197908#(= main_~i~0 82), 1197909#(= main_~i~0 83), 1197914#(= main_~i~0 88), 1197915#(= main_~i~0 89), 1197912#(= main_~i~0 86), 1197913#(= main_~i~0 87), 1197918#(= main_~i~0 92), 1197919#(= main_~i~0 93), 1197916#(= main_~i~0 90), 1197917#(= main_~i~0 91), 1197890#(= main_~i~0 64), 1197891#(= main_~i~0 65), 1197888#(= main_~i~0 62), 1197889#(= main_~i~0 63), 1197894#(= main_~i~0 68), 1197895#(= main_~i~0 69), 1197892#(= main_~i~0 66), 1197893#(= main_~i~0 67), 1197898#(= main_~i~0 72), 1197899#(= main_~i~0 73), 1197896#(= main_~i~0 70), 1197897#(= main_~i~0 71), 1197902#(= main_~i~0 76), 1197903#(= main_~i~0 77), 1197900#(= main_~i~0 74), 1197901#(= main_~i~0 75), 1197922#(= main_~i~0 96), 1197923#(= main_~i~0 97), 1197920#(= main_~i~0 94), 1197921#(= main_~i~0 95), 1197924#(= main_~i~0 98), 1197925#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1197822#true, 1197823#false] [2018-04-13 14:23:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:33,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-13 14:23:33,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-13 14:23:33,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=10002, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 14:23:33,035 INFO L87 Difference]: Start difference. First operand 836 states and 987 transitions. Second operand 102 states. [2018-04-13 14:23:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:23:47,577 INFO L93 Difference]: Finished difference Result 33083 states and 38527 transitions. [2018-04-13 14:23:47,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 14:23:47,577 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 502 [2018-04-13 14:23:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:23:47,607 INFO L225 Difference]: With dead ends: 33083 [2018-04-13 14:23:47,607 INFO L226 Difference]: Without dead ends: 33083 [2018-04-13 14:23:47,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=300, Invalid=10002, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 14:23:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33083 states. [2018-04-13 14:23:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33083 to 841. [2018-04-13 14:23:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-04-13 14:23:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 993 transitions. [2018-04-13 14:23:47,780 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 993 transitions. Word has length 502 [2018-04-13 14:23:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:23:47,781 INFO L459 AbstractCegarLoop]: Abstraction has 841 states and 993 transitions. [2018-04-13 14:23:47,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-13 14:23:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 993 transitions. [2018-04-13 14:23:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-04-13 14:23:47,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:23:47,783 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:23:47,783 INFO L408 AbstractCegarLoop]: === Iteration 156 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:23:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2086443779, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:23:47,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:23:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14475 backedges. 0 proven. 8748 refuted. 0 times theorem prover too weak. 5727 trivial. 0 not checked. [2018-04-13 14:23:48,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:23:48,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-13 14:23:48,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:23:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2018-04-13 14:23:48,784 INFO L182 omatonBuilderFactory]: Interpolants [1232019#(= main_~x~0 33), 1231889#(= main_~x~0 7), 1231894#(= main_~x~0 8), 1231899#(= main_~x~0 9), 1232024#(= main_~x~0 34), 1232029#(= main_~x~0 35), 1231874#(= main_~x~0 4), 1231879#(= main_~x~0 5), 1232004#(= main_~x~0 30), 1232009#(= main_~x~0 31), 1232014#(= main_~x~0 32), 1231884#(= main_~x~0 6), 1232049#(= main_~x~0 39), 1232054#(= main_~x~0 40), 1231924#(= main_~x~0 14), 1232059#(= main_~x~0 41), 1231929#(= main_~x~0 15), 1231934#(= main_~x~0 16), 1232034#(= main_~x~0 36), 1231904#(= main_~x~0 10), 1232039#(= main_~x~0 37), 1231909#(= main_~x~0 11), 1231914#(= main_~x~0 12), 1231919#(= main_~x~0 13), 1232044#(= main_~x~0 38), 1231954#(= main_~x~0 20), 1231959#(= main_~x~0 21), 1232084#(= main_~x~0 46), 1232089#(= main_~x~0 47), 1232094#(= main_~x~0 48), 1231964#(= main_~x~0 22), 1231939#(= main_~x~0 17), 1232064#(= main_~x~0 42), 1232069#(= main_~x~0 43), 1232074#(= main_~x~0 44), 1231944#(= main_~x~0 18), 1232079#(= main_~x~0 45), 1231949#(= main_~x~0 19), 1232114#(= main_~x~0 52), 1231859#(= 1 main_~x~0), 1231984#(= main_~x~0 26), 1232119#(= main_~x~0 53), 1231989#(= main_~x~0 27), 1231994#(= main_~x~0 28), 1231864#(= main_~x~0 2), 1231999#(= main_~x~0 29), 1232124#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1231869#(= main_~x~0 3), 1232099#(= main_~x~0 49), 1231969#(= main_~x~0 23), 1231974#(= main_~x~0 24), 1231850#true, 1231851#false, 1231979#(= main_~x~0 25), 1232104#(= main_~x~0 50), 1231854#(= 0 main_~x~0), 1232109#(= main_~x~0 51)] [2018-04-13 14:23:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14475 backedges. 0 proven. 8748 refuted. 0 times theorem prover too weak. 5727 trivial. 0 not checked. [2018-04-13 14:23:48,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 14:23:48,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 14:23:48,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 14:23:48,785 INFO L87 Difference]: Start difference. First operand 841 states and 993 transitions. Second operand 57 states. [2018-04-13 14:23:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:23:51,968 INFO L93 Difference]: Finished difference Result 847 states and 1000 transitions. [2018-04-13 14:23:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 14:23:51,969 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 557 [2018-04-13 14:23:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:23:51,969 INFO L225 Difference]: With dead ends: 847 [2018-04-13 14:23:51,969 INFO L226 Difference]: Without dead ends: 847 [2018-04-13 14:23:51,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 14:23:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-04-13 14:23:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2018-04-13 14:23:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-04-13 14:23:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1000 transitions. [2018-04-13 14:23:51,973 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1000 transitions. Word has length 557 [2018-04-13 14:23:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:23:51,973 INFO L459 AbstractCegarLoop]: Abstraction has 847 states and 1000 transitions. [2018-04-13 14:23:51,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 14:23:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1000 transitions. [2018-04-13 14:23:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-13 14:23:51,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:23:51,976 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-04-13 14:23:51,976 INFO L408 AbstractCegarLoop]: === Iteration 157 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:23:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1962370662, now seen corresponding path program 100 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:23:51,978 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:23:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:23:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:54,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:23:54,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-13 14:23:54,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:23:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:54,784 INFO L182 omatonBuilderFactory]: Interpolants [1233922#(= main_~i~0 99), 1233923#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1233920#(= main_~i~0 97), 1233921#(= main_~i~0 98), 1233819#true, 1233823#(= main_~i~0 0), 1233820#false, 1233842#(= main_~i~0 19), 1233843#(= main_~i~0 20), 1233840#(= main_~i~0 17), 1233841#(= main_~i~0 18), 1233846#(= main_~i~0 23), 1233847#(= main_~i~0 24), 1233844#(= main_~i~0 21), 1233845#(= main_~i~0 22), 1233850#(= main_~i~0 27), 1233851#(= main_~i~0 28), 1233848#(= main_~i~0 25), 1233849#(= main_~i~0 26), 1233854#(= main_~i~0 31), 1233855#(= main_~i~0 32), 1233852#(= main_~i~0 29), 1233853#(= main_~i~0 30), 1233826#(= main_~i~0 3), 1233827#(= main_~i~0 4), 1233824#(= main_~i~0 1), 1233825#(= main_~i~0 2), 1233830#(= main_~i~0 7), 1233831#(= main_~i~0 8), 1233828#(= main_~i~0 5), 1233829#(= main_~i~0 6), 1233834#(= main_~i~0 11), 1233835#(= main_~i~0 12), 1233832#(= main_~i~0 9), 1233833#(= main_~i~0 10), 1233838#(= main_~i~0 15), 1233839#(= main_~i~0 16), 1233836#(= main_~i~0 13), 1233837#(= main_~i~0 14), 1233874#(= main_~i~0 51), 1233875#(= main_~i~0 52), 1233872#(= main_~i~0 49), 1233873#(= main_~i~0 50), 1233878#(= main_~i~0 55), 1233879#(= main_~i~0 56), 1233876#(= main_~i~0 53), 1233877#(= main_~i~0 54), 1233882#(= main_~i~0 59), 1233883#(= main_~i~0 60), 1233880#(= main_~i~0 57), 1233881#(= main_~i~0 58), 1233886#(= main_~i~0 63), 1233887#(= main_~i~0 64), 1233884#(= main_~i~0 61), 1233885#(= main_~i~0 62), 1233858#(= main_~i~0 35), 1233859#(= main_~i~0 36), 1233856#(= main_~i~0 33), 1233857#(= main_~i~0 34), 1233862#(= main_~i~0 39), 1233863#(= main_~i~0 40), 1233860#(= main_~i~0 37), 1233861#(= main_~i~0 38), 1233866#(= main_~i~0 43), 1233867#(= main_~i~0 44), 1233864#(= main_~i~0 41), 1233865#(= main_~i~0 42), 1233870#(= main_~i~0 47), 1233871#(= main_~i~0 48), 1233868#(= main_~i~0 45), 1233869#(= main_~i~0 46), 1233906#(= main_~i~0 83), 1233907#(= main_~i~0 84), 1233904#(= main_~i~0 81), 1233905#(= main_~i~0 82), 1233910#(= main_~i~0 87), 1233911#(= main_~i~0 88), 1233908#(= main_~i~0 85), 1233909#(= main_~i~0 86), 1233914#(= main_~i~0 91), 1233915#(= main_~i~0 92), 1233912#(= main_~i~0 89), 1233913#(= main_~i~0 90), 1233918#(= main_~i~0 95), 1233919#(= main_~i~0 96), 1233916#(= main_~i~0 93), 1233917#(= main_~i~0 94), 1233890#(= main_~i~0 67), 1233891#(= main_~i~0 68), 1233888#(= main_~i~0 65), 1233889#(= main_~i~0 66), 1233894#(= main_~i~0 71), 1233895#(= main_~i~0 72), 1233892#(= main_~i~0 69), 1233893#(= main_~i~0 70), 1233898#(= main_~i~0 75), 1233899#(= main_~i~0 76), 1233896#(= main_~i~0 73), 1233897#(= main_~i~0 74), 1233902#(= main_~i~0 79), 1233903#(= main_~i~0 80), 1233900#(= main_~i~0 77), 1233901#(= main_~i~0 78)] [2018-04-13 14:23:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:23:54,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-13 14:23:54,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-13 14:23:54,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 14:23:54,785 INFO L87 Difference]: Start difference. First operand 847 states and 1000 transitions. Second operand 103 states. [2018-04-13 14:24:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:24:10,115 INFO L93 Difference]: Finished difference Result 34017 states and 39616 transitions. [2018-04-13 14:24:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-13 14:24:10,116 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 507 [2018-04-13 14:24:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:24:10,148 INFO L225 Difference]: With dead ends: 34017 [2018-04-13 14:24:10,149 INFO L226 Difference]: Without dead ends: 34017 [2018-04-13 14:24:10,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 14:24:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34017 states. [2018-04-13 14:24:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34017 to 852. [2018-04-13 14:24:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-04-13 14:24:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1006 transitions. [2018-04-13 14:24:10,431 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1006 transitions. Word has length 507 [2018-04-13 14:24:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:24:10,479 INFO L459 AbstractCegarLoop]: Abstraction has 852 states and 1006 transitions. [2018-04-13 14:24:10,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-13 14:24:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1006 transitions. [2018-04-13 14:24:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-04-13 14:24:10,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:24:10,481 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:24:10,481 INFO L408 AbstractCegarLoop]: === Iteration 158 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:24:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1111872608, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:24:10,484 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:24:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15018 backedges. 0 proven. 9075 refuted. 0 times theorem prover too weak. 5943 trivial. 0 not checked. [2018-04-13 14:24:11,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:24:11,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 14:24:11,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:24:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-04-13 14:24:11,543 INFO L182 omatonBuilderFactory]: Interpolants [1268882#(= main_~x~0 17), 1268887#(= main_~x~0 18), 1269012#(= main_~x~0 43), 1269017#(= main_~x~0 44), 1269022#(= main_~x~0 45), 1268892#(= main_~x~0 19), 1268867#(= main_~x~0 14), 1268992#(= main_~x~0 39), 1268997#(= main_~x~0 40), 1269002#(= main_~x~0 41), 1268872#(= main_~x~0 15), 1269007#(= main_~x~0 42), 1268877#(= main_~x~0 16), 1269042#(= main_~x~0 49), 1268912#(= main_~x~0 23), 1269047#(= main_~x~0 50), 1268917#(= main_~x~0 24), 1268794#false, 1268922#(= main_~x~0 25), 1268793#true, 1268927#(= main_~x~0 26), 1268797#(= 0 main_~x~0), 1269052#(= main_~x~0 51), 1269027#(= main_~x~0 46), 1268897#(= main_~x~0 20), 1268902#(= main_~x~0 21), 1268907#(= main_~x~0 22), 1269032#(= main_~x~0 47), 1269037#(= main_~x~0 48), 1268947#(= main_~x~0 30), 1268817#(= main_~x~0 4), 1269072#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1268822#(= main_~x~0 5), 1268827#(= main_~x~0 6), 1268952#(= main_~x~0 31), 1268957#(= main_~x~0 32), 1268802#(= 1 main_~x~0), 1269057#(= main_~x~0 52), 1268807#(= main_~x~0 2), 1269062#(= main_~x~0 53), 1268932#(= main_~x~0 27), 1269067#(= main_~x~0 54), 1268937#(= main_~x~0 28), 1268942#(= main_~x~0 29), 1268812#(= main_~x~0 3), 1268977#(= main_~x~0 36), 1268982#(= main_~x~0 37), 1268852#(= main_~x~0 11), 1268987#(= main_~x~0 38), 1268857#(= main_~x~0 12), 1268862#(= main_~x~0 13), 1268962#(= main_~x~0 33), 1268832#(= main_~x~0 7), 1268967#(= main_~x~0 34), 1268837#(= main_~x~0 8), 1268842#(= main_~x~0 9), 1268847#(= main_~x~0 10), 1268972#(= main_~x~0 35)] [2018-04-13 14:24:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15018 backedges. 0 proven. 9075 refuted. 0 times theorem prover too weak. 5943 trivial. 0 not checked. [2018-04-13 14:24:11,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 14:24:11,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 14:24:11,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 14:24:11,544 INFO L87 Difference]: Start difference. First operand 852 states and 1006 transitions. Second operand 58 states. [2018-04-13 14:24:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:24:14,765 INFO L93 Difference]: Finished difference Result 858 states and 1013 transitions. [2018-04-13 14:24:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 14:24:14,766 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 567 [2018-04-13 14:24:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:24:14,766 INFO L225 Difference]: With dead ends: 858 [2018-04-13 14:24:14,766 INFO L226 Difference]: Without dead ends: 858 [2018-04-13 14:24:14,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 14:24:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-04-13 14:24:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-04-13 14:24:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-04-13 14:24:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1013 transitions. [2018-04-13 14:24:14,770 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1013 transitions. Word has length 567 [2018-04-13 14:24:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:24:14,770 INFO L459 AbstractCegarLoop]: Abstraction has 858 states and 1013 transitions. [2018-04-13 14:24:14,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 14:24:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1013 transitions. [2018-04-13 14:24:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-04-13 14:24:14,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:24:14,771 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-04-13 14:24:14,771 INFO L408 AbstractCegarLoop]: === Iteration 159 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:24:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash -856223145, now seen corresponding path program 101 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:24:14,774 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:24:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:17,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:24:17,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-13 14:24:17,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:24:17,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-13 14:24:17,523 INFO L182 omatonBuilderFactory]: Interpolants [1270803#(= main_~i~0 10), 1270802#(= main_~i~0 9), 1270801#(= main_~i~0 8), 1270800#(= main_~i~0 7), 1270807#(= main_~i~0 14), 1270806#(= main_~i~0 13), 1270805#(= main_~i~0 12), 1270804#(= main_~i~0 11), 1270811#(= main_~i~0 18), 1270810#(= main_~i~0 17), 1270809#(= main_~i~0 16), 1270808#(= main_~i~0 15), 1270815#(= main_~i~0 22), 1270814#(= main_~i~0 21), 1270813#(= main_~i~0 20), 1270812#(= main_~i~0 19), 1270790#false, 1270789#true, 1270795#(= main_~i~0 2), 1270794#(= main_~i~0 1), 1270793#(= main_~i~0 0), 1270799#(= main_~i~0 6), 1270798#(= main_~i~0 5), 1270797#(= main_~i~0 4), 1270796#(= main_~i~0 3), 1270835#(= main_~i~0 42), 1270834#(= main_~i~0 41), 1270833#(= main_~i~0 40), 1270832#(= main_~i~0 39), 1270839#(= main_~i~0 46), 1270838#(= main_~i~0 45), 1270837#(= main_~i~0 44), 1270836#(= main_~i~0 43), 1270843#(= main_~i~0 50), 1270842#(= main_~i~0 49), 1270841#(= main_~i~0 48), 1270840#(= main_~i~0 47), 1270847#(= main_~i~0 54), 1270846#(= main_~i~0 53), 1270845#(= main_~i~0 52), 1270844#(= main_~i~0 51), 1270819#(= main_~i~0 26), 1270818#(= main_~i~0 25), 1270817#(= main_~i~0 24), 1270816#(= main_~i~0 23), 1270823#(= main_~i~0 30), 1270822#(= main_~i~0 29), 1270821#(= main_~i~0 28), 1270820#(= main_~i~0 27), 1270827#(= main_~i~0 34), 1270826#(= main_~i~0 33), 1270825#(= main_~i~0 32), 1270824#(= main_~i~0 31), 1270831#(= main_~i~0 38), 1270830#(= main_~i~0 37), 1270829#(= main_~i~0 36), 1270828#(= main_~i~0 35), 1270867#(= main_~i~0 74), 1270866#(= main_~i~0 73), 1270865#(= main_~i~0 72), 1270864#(= main_~i~0 71), 1270871#(= main_~i~0 78), 1270870#(= main_~i~0 77), 1270869#(= main_~i~0 76), 1270868#(= main_~i~0 75), 1270875#(= main_~i~0 82), 1270874#(= main_~i~0 81), 1270873#(= main_~i~0 80), 1270872#(= main_~i~0 79), 1270879#(= main_~i~0 86), 1270878#(= main_~i~0 85), 1270877#(= main_~i~0 84), 1270876#(= main_~i~0 83), 1270851#(= main_~i~0 58), 1270850#(= main_~i~0 57), 1270849#(= main_~i~0 56), 1270848#(= main_~i~0 55), 1270855#(= main_~i~0 62), 1270854#(= main_~i~0 61), 1270853#(= main_~i~0 60), 1270852#(= main_~i~0 59), 1270859#(= main_~i~0 66), 1270858#(= main_~i~0 65), 1270857#(= main_~i~0 64), 1270856#(= main_~i~0 63), 1270863#(= main_~i~0 70), 1270862#(= main_~i~0 69), 1270861#(= main_~i~0 68), 1270860#(= main_~i~0 67), 1270883#(= main_~i~0 90), 1270882#(= main_~i~0 89), 1270881#(= main_~i~0 88), 1270880#(= main_~i~0 87), 1270887#(= main_~i~0 94), 1270886#(= main_~i~0 93), 1270885#(= main_~i~0 92), 1270884#(= main_~i~0 91), 1270891#(= main_~i~0 98), 1270890#(= main_~i~0 97), 1270889#(= main_~i~0 96), 1270888#(= main_~i~0 95), 1270894#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1270893#(= main_~i~0 100), 1270892#(= main_~i~0 99)] [2018-04-13 14:24:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-13 14:24:17,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-13 14:24:17,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=10406, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 14:24:17,525 INFO L87 Difference]: Start difference. First operand 858 states and 1013 transitions. Second operand 104 states. [2018-04-13 14:24:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:24:33,736 INFO L93 Difference]: Finished difference Result 34963 states and 40719 transitions. [2018-04-13 14:24:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 14:24:33,737 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 512 [2018-04-13 14:24:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:24:33,772 INFO L225 Difference]: With dead ends: 34963 [2018-04-13 14:24:33,772 INFO L226 Difference]: Without dead ends: 34963 [2018-04-13 14:24:33,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=306, Invalid=10406, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 14:24:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34963 states. [2018-04-13 14:24:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34963 to 863. [2018-04-13 14:24:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-04-13 14:24:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1019 transitions. [2018-04-13 14:24:34,090 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1019 transitions. Word has length 512 [2018-04-13 14:24:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:24:34,091 INFO L459 AbstractCegarLoop]: Abstraction has 863 states and 1019 transitions. [2018-04-13 14:24:34,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-13 14:24:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1019 transitions. [2018-04-13 14:24:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-13 14:24:34,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:24:34,094 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-04-13 14:24:34,094 INFO L408 AbstractCegarLoop]: === Iteration 160 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:24:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash 71972102, now seen corresponding path program 102 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:24:34,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:24:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:36,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:24:36,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-13 14:24:36,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:24:36,667 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-13 14:24:36,667 INFO L182 omatonBuilderFactory]: Interpolants [1306739#(= main_~i~0 14), 1306738#(= main_~i~0 13), 1306737#(= main_~i~0 12), 1306736#(= main_~i~0 11), 1306743#(= main_~i~0 18), 1306742#(= main_~i~0 17), 1306741#(= main_~i~0 16), 1306740#(= main_~i~0 15), 1306747#(= main_~i~0 22), 1306746#(= main_~i~0 21), 1306745#(= main_~i~0 20), 1306744#(= main_~i~0 19), 1306751#(= main_~i~0 26), 1306750#(= main_~i~0 25), 1306749#(= main_~i~0 24), 1306748#(= main_~i~0 23), 1306722#false, 1306721#true, 1306727#(= main_~i~0 2), 1306726#(= main_~i~0 1), 1306725#(= main_~i~0 0), 1306731#(= main_~i~0 6), 1306730#(= main_~i~0 5), 1306729#(= main_~i~0 4), 1306728#(= main_~i~0 3), 1306735#(= main_~i~0 10), 1306734#(= main_~i~0 9), 1306733#(= main_~i~0 8), 1306732#(= main_~i~0 7), 1306771#(= main_~i~0 46), 1306770#(= main_~i~0 45), 1306769#(= main_~i~0 44), 1306768#(= main_~i~0 43), 1306775#(= main_~i~0 50), 1306774#(= main_~i~0 49), 1306773#(= main_~i~0 48), 1306772#(= main_~i~0 47), 1306779#(= main_~i~0 54), 1306778#(= main_~i~0 53), 1306777#(= main_~i~0 52), 1306776#(= main_~i~0 51), 1306783#(= main_~i~0 58), 1306782#(= main_~i~0 57), 1306781#(= main_~i~0 56), 1306780#(= main_~i~0 55), 1306755#(= main_~i~0 30), 1306754#(= main_~i~0 29), 1306753#(= main_~i~0 28), 1306752#(= main_~i~0 27), 1306759#(= main_~i~0 34), 1306758#(= main_~i~0 33), 1306757#(= main_~i~0 32), 1306756#(= main_~i~0 31), 1306763#(= main_~i~0 38), 1306762#(= main_~i~0 37), 1306761#(= main_~i~0 36), 1306760#(= main_~i~0 35), 1306767#(= main_~i~0 42), 1306766#(= main_~i~0 41), 1306765#(= main_~i~0 40), 1306764#(= main_~i~0 39), 1306803#(= main_~i~0 78), 1306802#(= main_~i~0 77), 1306801#(= main_~i~0 76), 1306800#(= main_~i~0 75), 1306807#(= main_~i~0 82), 1306806#(= main_~i~0 81), 1306805#(= main_~i~0 80), 1306804#(= main_~i~0 79), 1306811#(= main_~i~0 86), 1306810#(= main_~i~0 85), 1306809#(= main_~i~0 84), 1306808#(= main_~i~0 83), 1306815#(= main_~i~0 90), 1306814#(= main_~i~0 89), 1306813#(= main_~i~0 88), 1306812#(= main_~i~0 87), 1306787#(= main_~i~0 62), 1306786#(= main_~i~0 61), 1306785#(= main_~i~0 60), 1306784#(= main_~i~0 59), 1306791#(= main_~i~0 66), 1306790#(= main_~i~0 65), 1306789#(= main_~i~0 64), 1306788#(= main_~i~0 63), 1306795#(= main_~i~0 70), 1306794#(= main_~i~0 69), 1306793#(= main_~i~0 68), 1306792#(= main_~i~0 67), 1306799#(= main_~i~0 74), 1306798#(= main_~i~0 73), 1306797#(= main_~i~0 72), 1306796#(= main_~i~0 71), 1306819#(= main_~i~0 94), 1306818#(= main_~i~0 93), 1306817#(= main_~i~0 92), 1306816#(= main_~i~0 91), 1306823#(= main_~i~0 98), 1306822#(= main_~i~0 97), 1306821#(= main_~i~0 96), 1306820#(= main_~i~0 95), 1306827#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1306826#(= main_~i~0 101), 1306825#(= main_~i~0 100), 1306824#(= main_~i~0 99)] [2018-04-13 14:24:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:36,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-13 14:24:36,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-13 14:24:36,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 14:24:36,669 INFO L87 Difference]: Start difference. First operand 863 states and 1019 transitions. Second operand 105 states. [2018-04-13 14:24:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:24:52,150 INFO L93 Difference]: Finished difference Result 35309 states and 41122 transitions. [2018-04-13 14:24:52,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-13 14:24:52,189 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 517 [2018-04-13 14:24:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:24:52,223 INFO L225 Difference]: With dead ends: 35309 [2018-04-13 14:24:52,223 INFO L226 Difference]: Without dead ends: 35309 [2018-04-13 14:24:52,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 14:24:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35309 states. [2018-04-13 14:24:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35309 to 868. [2018-04-13 14:24:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 14:24:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2018-04-13 14:24:52,421 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 517 [2018-04-13 14:24:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:24:52,421 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2018-04-13 14:24:52,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-13 14:24:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2018-04-13 14:24:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-04-13 14:24:52,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:24:52,423 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 56, 56, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 14:24:52,423 INFO L408 AbstractCegarLoop]: === Iteration 161 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:24:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2077277565, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:24:52,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:24:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15571 backedges. 0 proven. 9408 refuted. 0 times theorem prover too weak. 6163 trivial. 0 not checked. [2018-04-13 14:24:53,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:24:53,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-13 14:24:53,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:24:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-04-13 14:24:53,358 INFO L182 omatonBuilderFactory]: Interpolants [1343124#(= main_~x~0 23), 1343254#(= main_~x~0 49), 1343249#(= main_~x~0 48), 1343005#true, 1343006#false, 1343134#(= main_~x~0 25), 1343129#(= main_~x~0 24), 1343259#(= main_~x~0 50), 1343109#(= main_~x~0 20), 1343239#(= main_~x~0 46), 1343104#(= main_~x~0 19), 1343234#(= main_~x~0 45), 1343244#(= main_~x~0 47), 1343119#(= main_~x~0 22), 1343114#(= main_~x~0 21), 1343284#(= main_~x~0 55), 1343029#(= main_~x~0 4), 1343159#(= main_~x~0 30), 1343024#(= main_~x~0 3), 1343154#(= main_~x~0 29), 1343164#(= main_~x~0 31), 1343039#(= main_~x~0 6), 1343289#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1343034#(= main_~x~0 5), 1343269#(= main_~x~0 52), 1343014#(= 1 main_~x~0), 1343264#(= main_~x~0 51), 1343009#(= 0 main_~x~0), 1343139#(= main_~x~0 26), 1343149#(= main_~x~0 28), 1343279#(= main_~x~0 54), 1343144#(= main_~x~0 27), 1343274#(= main_~x~0 53), 1343019#(= main_~x~0 2), 1343189#(= main_~x~0 36), 1343184#(= main_~x~0 35), 1343059#(= main_~x~0 10), 1343069#(= main_~x~0 12), 1343199#(= main_~x~0 38), 1343064#(= main_~x~0 11), 1343194#(= main_~x~0 37), 1343044#(= main_~x~0 7), 1343174#(= main_~x~0 33), 1343169#(= main_~x~0 32), 1343054#(= main_~x~0 9), 1343049#(= main_~x~0 8), 1343179#(= main_~x~0 34), 1343094#(= main_~x~0 17), 1343089#(= main_~x~0 16), 1343219#(= main_~x~0 42), 1343229#(= main_~x~0 44), 1343224#(= main_~x~0 43), 1343099#(= main_~x~0 18), 1343204#(= main_~x~0 39), 1343079#(= main_~x~0 14), 1343074#(= main_~x~0 13), 1343084#(= main_~x~0 15), 1343214#(= main_~x~0 41), 1343209#(= main_~x~0 40)] [2018-04-13 14:24:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15571 backedges. 0 proven. 9408 refuted. 0 times theorem prover too weak. 6163 trivial. 0 not checked. [2018-04-13 14:24:53,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 14:24:53,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 14:24:53,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 14:24:53,359 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 59 states. [2018-04-13 14:24:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:24:56,592 INFO L93 Difference]: Finished difference Result 874 states and 1032 transitions. [2018-04-13 14:24:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 14:24:56,592 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 577 [2018-04-13 14:24:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:24:56,593 INFO L225 Difference]: With dead ends: 874 [2018-04-13 14:24:56,593 INFO L226 Difference]: Without dead ends: 874 [2018-04-13 14:24:56,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 14:24:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-04-13 14:24:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-04-13 14:24:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-04-13 14:24:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1032 transitions. [2018-04-13 14:24:56,597 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1032 transitions. Word has length 577 [2018-04-13 14:24:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:24:56,598 INFO L459 AbstractCegarLoop]: Abstraction has 874 states and 1032 transitions. [2018-04-13 14:24:56,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 14:24:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1032 transitions. [2018-04-13 14:24:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-04-13 14:24:56,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:24:56,600 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-04-13 14:24:56,600 INFO L408 AbstractCegarLoop]: === Iteration 162 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:24:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1740871753, now seen corresponding path program 103 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:24:56,602 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:24:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:24:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:59,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:24:59,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-13 14:24:59,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:24:59,389 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-13 14:24:59,389 INFO L182 omatonBuilderFactory]: Interpolants [1345044#(= main_~i~0 2), 1345045#(= main_~i~0 3), 1345046#(= main_~i~0 4), 1345047#(= main_~i~0 5), 1345042#(= main_~i~0 0), 1345043#(= main_~i~0 1), 1345052#(= main_~i~0 10), 1345053#(= main_~i~0 11), 1345054#(= main_~i~0 12), 1345055#(= main_~i~0 13), 1345048#(= main_~i~0 6), 1345049#(= main_~i~0 7), 1345050#(= main_~i~0 8), 1345051#(= main_~i~0 9), 1345038#true, 1345039#false, 1345076#(= main_~i~0 34), 1345077#(= main_~i~0 35), 1345078#(= main_~i~0 36), 1345079#(= main_~i~0 37), 1345072#(= main_~i~0 30), 1345073#(= main_~i~0 31), 1345074#(= main_~i~0 32), 1345075#(= main_~i~0 33), 1345084#(= main_~i~0 42), 1345085#(= main_~i~0 43), 1345086#(= main_~i~0 44), 1345087#(= main_~i~0 45), 1345080#(= main_~i~0 38), 1345081#(= main_~i~0 39), 1345082#(= main_~i~0 40), 1345083#(= main_~i~0 41), 1345060#(= main_~i~0 18), 1345061#(= main_~i~0 19), 1345062#(= main_~i~0 20), 1345063#(= main_~i~0 21), 1345056#(= main_~i~0 14), 1345057#(= main_~i~0 15), 1345058#(= main_~i~0 16), 1345059#(= main_~i~0 17), 1345068#(= main_~i~0 26), 1345069#(= main_~i~0 27), 1345070#(= main_~i~0 28), 1345071#(= main_~i~0 29), 1345064#(= main_~i~0 22), 1345065#(= main_~i~0 23), 1345066#(= main_~i~0 24), 1345067#(= main_~i~0 25), 1345108#(= main_~i~0 66), 1345109#(= main_~i~0 67), 1345110#(= main_~i~0 68), 1345111#(= main_~i~0 69), 1345104#(= main_~i~0 62), 1345105#(= main_~i~0 63), 1345106#(= main_~i~0 64), 1345107#(= main_~i~0 65), 1345116#(= main_~i~0 74), 1345117#(= main_~i~0 75), 1345118#(= main_~i~0 76), 1345119#(= main_~i~0 77), 1345112#(= main_~i~0 70), 1345113#(= main_~i~0 71), 1345114#(= main_~i~0 72), 1345115#(= main_~i~0 73), 1345092#(= main_~i~0 50), 1345093#(= main_~i~0 51), 1345094#(= main_~i~0 52), 1345095#(= main_~i~0 53), 1345088#(= main_~i~0 46), 1345089#(= main_~i~0 47), 1345090#(= main_~i~0 48), 1345091#(= main_~i~0 49), 1345100#(= main_~i~0 58), 1345101#(= main_~i~0 59), 1345102#(= main_~i~0 60), 1345103#(= main_~i~0 61), 1345096#(= main_~i~0 54), 1345097#(= main_~i~0 55), 1345098#(= main_~i~0 56), 1345099#(= main_~i~0 57), 1345140#(= main_~i~0 98), 1345141#(= main_~i~0 99), 1345142#(= main_~i~0 100), 1345143#(= main_~i~0 101), 1345136#(= main_~i~0 94), 1345137#(= main_~i~0 95), 1345138#(= main_~i~0 96), 1345139#(= main_~i~0 97), 1345144#(= main_~i~0 102), 1345145#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1345124#(= main_~i~0 82), 1345125#(= main_~i~0 83), 1345126#(= main_~i~0 84), 1345127#(= main_~i~0 85), 1345120#(= main_~i~0 78), 1345121#(= main_~i~0 79), 1345122#(= main_~i~0 80), 1345123#(= main_~i~0 81), 1345132#(= main_~i~0 90), 1345133#(= main_~i~0 91), 1345134#(= main_~i~0 92), 1345135#(= main_~i~0 93), 1345128#(= main_~i~0 86), 1345129#(= main_~i~0 87), 1345130#(= main_~i~0 88), 1345131#(= main_~i~0 89)] [2018-04-13 14:24:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:24:59,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-13 14:24:59,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-13 14:24:59,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=10818, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 14:24:59,390 INFO L87 Difference]: Start difference. First operand 874 states and 1032 transitions. Second operand 106 states. [2018-04-13 14:25:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 14:25:14,901 INFO L93 Difference]: Finished difference Result 36273 states and 42246 transitions. [2018-04-13 14:25:14,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-13 14:25:14,902 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 522 [2018-04-13 14:25:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 14:25:14,935 INFO L225 Difference]: With dead ends: 36273 [2018-04-13 14:25:14,935 INFO L226 Difference]: Without dead ends: 36273 [2018-04-13 14:25:14,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=312, Invalid=10818, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 14:25:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36273 states. [2018-04-13 14:25:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36273 to 879. [2018-04-13 14:25:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-04-13 14:25:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1038 transitions. [2018-04-13 14:25:15,125 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1038 transitions. Word has length 522 [2018-04-13 14:25:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 14:25:15,125 INFO L459 AbstractCegarLoop]: Abstraction has 879 states and 1038 transitions. [2018-04-13 14:25:15,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-13 14:25:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1038 transitions. [2018-04-13 14:25:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-13 14:25:15,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 14:25:15,127 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-04-13 14:25:15,127 INFO L408 AbstractCegarLoop]: === Iteration 163 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 14:25:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 736312230, now seen corresponding path program 104 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-13 14:25:15,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 14:25:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:25:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 14:25:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:25:17,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 14:25:17,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-13 14:25:17,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 14:25:17,989 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-13 14:25:17,989 INFO L182 omatonBuilderFactory]: Interpolants [1382405#(= main_~i~0 103), 1382404#(= main_~i~0 102), 1382406#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1382401#(= main_~i~0 99), 1382400#(= main_~i~0 98), 1382403#(= main_~i~0 101), 1382402#(= main_~i~0 100), 1382303#(= main_~i~0 1), 1382302#(= main_~i~0 0), 1382299#false, 1382298#true, 1382325#(= main_~i~0 23), 1382324#(= main_~i~0 22), 1382327#(= main_~i~0 25), 1382326#(= main_~i~0 24), 1382321#(= main_~i~0 19), 1382320#(= main_~i~0 18), 1382323#(= main_~i~0 21), 1382322#(= main_~i~0 20), 1382333#(= main_~i~0 31), 1382332#(= main_~i~0 30), 1382335#(= main_~i~0 33), 1382334#(= main_~i~0 32), 1382329#(= main_~i~0 27), 1382328#(= main_~i~0 26), 1382331#(= main_~i~0 29), 1382330#(= main_~i~0 28), 1382309#(= main_~i~0 7), 1382308#(= main_~i~0 6), 1382311#(= main_~i~0 9), 1382310#(= main_~i~0 8), 1382305#(= main_~i~0 3), 1382304#(= main_~i~0 2), 1382307#(= main_~i~0 5), 1382306#(= main_~i~0 4), 1382317#(= main_~i~0 15), 1382316#(= main_~i~0 14), 1382319#(= main_~i~0 17), 1382318#(= main_~i~0 16), 1382313#(= main_~i~0 11), 1382312#(= main_~i~0 10), 1382315#(= main_~i~0 13), 1382314#(= main_~i~0 12), 1382357#(= main_~i~0 55), 1382356#(= main_~i~0 54), 1382359#(= main_~i~0 57), 1382358#(= main_~i~0 56), 1382353#(= main_~i~0 51), 1382352#(= main_~i~0 50), 1382355#(= main_~i~0 53), 1382354#(= main_~i~0 52), 1382365#(= main_~i~0 63), 1382364#(= main_~i~0 62), 1382367#(= main_~i~0 65), 1382366#(= main_~i~0 64), 1382361#(= main_~i~0 59), 1382360#(= main_~i~0 58), 1382363#(= main_~i~0 61), 1382362#(= main_~i~0 60), 1382341#(= main_~i~0 39), 1382340#(= main_~i~0 38), 1382343#(= main_~i~0 41), 1382342#(= main_~i~0 40), 1382337#(= main_~i~0 35), 1382336#(= main_~i~0 34), 1382339#(= main_~i~0 37), 1382338#(= main_~i~0 36), 1382349#(= main_~i~0 47), 1382348#(= main_~i~0 46), 1382351#(= main_~i~0 49), 1382350#(= main_~i~0 48), 1382345#(= main_~i~0 43), 1382344#(= main_~i~0 42), 1382347#(= main_~i~0 45), 1382346#(= main_~i~0 44), 1382389#(= main_~i~0 87), 1382388#(= main_~i~0 86), 1382391#(= main_~i~0 89), 1382390#(= main_~i~0 88), 1382385#(= main_~i~0 83), 1382384#(= main_~i~0 82), 1382387#(= main_~i~0 85), 1382386#(= main_~i~0 84), 1382397#(= main_~i~0 95), 1382396#(= main_~i~0 94), 1382399#(= main_~i~0 97), 1382398#(= main_~i~0 96), 1382393#(= main_~i~0 91), 1382392#(= main_~i~0 90), 1382395#(= main_~i~0 93), 1382394#(= main_~i~0 92), 1382373#(= main_~i~0 71), 1382372#(= main_~i~0 70), 1382375#(= main_~i~0 73), 1382374#(= main_~i~0 72), 1382369#(= main_~i~0 67), 1382368#(= main_~i~0 66), 1382371#(= main_~i~0 69), 1382370#(= main_~i~0 68), 1382381#(= main_~i~0 79), 1382380#(= main_~i~0 78), 1382383#(= main_~i~0 81), 1382382#(= main_~i~0 80), 1382377#(= main_~i~0 75), 1382376#(= main_~i~0 74), 1382379#(= main_~i~0 77), 1382378#(= main_~i~0 76)] [2018-04-13 14:25:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 14:25:17,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 14:25:17,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 14:25:17,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 14:25:17,991 INFO L87 Difference]: Start difference. First operand 879 states and 1038 transitions. Second operand 107 states. Received shutdown request... [2018-04-13 14:25:31,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 14:25:31,364 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 14:25:31,368 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 14:25:31,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 02:25:31 BoogieIcfgContainer [2018-04-13 14:25:31,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 14:25:31,369 INFO L168 Benchmark]: Toolchain (without parser) took 744558.30 ms. Allocated memory was 395.3 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 335.6 MB in the beginning and 1.2 GB in the end (delta: -885.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-04-13 14:25:31,370 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 395.3 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 14:25:31,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.61 ms. Allocated memory is still 395.3 MB. Free memory was 335.6 MB in the beginning and 326.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-13 14:25:31,370 INFO L168 Benchmark]: Boogie Preprocessor took 21.47 ms. Allocated memory is still 395.3 MB. Free memory was 326.3 MB in the beginning and 325.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 14:25:31,371 INFO L168 Benchmark]: RCFGBuilder took 184.93 ms. Allocated memory was 395.3 MB in the beginning and 596.1 MB in the end (delta: 200.8 MB). Free memory was 325.0 MB in the beginning and 563.1 MB in the end (delta: -238.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-13 14:25:31,371 INFO L168 Benchmark]: TraceAbstraction took 744196.20 ms. Allocated memory was 596.1 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 563.1 MB in the beginning and 1.2 GB in the end (delta: -658.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-04-13 14:25:31,372 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.12 ms. Allocated memory is still 395.3 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.61 ms. Allocated memory is still 395.3 MB. Free memory was 335.6 MB in the beginning and 326.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.47 ms. Allocated memory is still 395.3 MB. Free memory was 326.3 MB in the beginning and 325.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 184.93 ms. Allocated memory was 395.3 MB in the beginning and 596.1 MB in the end (delta: 200.8 MB). Free memory was 325.0 MB in the beginning and 563.1 MB in the end (delta: -238.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 744196.20 ms. Allocated memory was 596.1 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 563.1 MB in the beginning and 1.2 GB in the end (delta: -658.4 MB). Peak memory consumption was 1.3 GB. 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 (879states) and interpolant automaton (currently 107 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 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 (879states) and interpolant automaton (currently 107 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 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 (879states) and interpolant automaton (currently 107 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 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 (879states) and interpolant automaton (currently 107 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 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 (879states) and interpolant automaton (currently 107 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 744.1s OverallTime, 163 OverallIterations, 105 TraceHistogramMax, 611.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54934 SDtfs, 74761 SDslu, 2968325 SDs, 0 SdLazy, 2950552 SolverSat, 10310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 483.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10905 GetRequests, 3684 SyntacticMatches, 0 SemanticMatches, 7221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 103.6s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 117211/1245779 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 162 MinimizatonAttempts, 1222987 StatesRemovedByMinimization, 103 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 111.7s InterpolantComputationTime, 44981 NumberOfCodeBlocks, 44981 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 44818 ConstructedInterpolants, 0 QuantifiedInterpolants, 43884068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 163 InterpolantComputations, 3 PerfectInterpolantSequences, 117211/1245779 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-13_14-25-31-379.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-13_14-25-31-379.csv Completed graceful shutdown