java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:53:43,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:53:43,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:53:43,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:53:43,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:53:43,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:53:43,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:53:43,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:53:43,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:53:43,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:53:43,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:53:43,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:53:43,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:53:43,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:53:43,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:53:43,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:53:43,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:53:43,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:53:43,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:53:43,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:53:43,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:53:43,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:53:43,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:53:43,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:53:43,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:53:43,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:53:43,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:53:43,625 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:53:43,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:53:43,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:53:43,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:53:43,626 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 10:53:43,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:53:43,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:53:43,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:53:43,637 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:53:43,637 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:53:43,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:53:43,637 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:53:43,638 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:53:43,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:53:43,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:53:43,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:53:43,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:53:43,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 10:53:43,640 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 10:53:43,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:43,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:53:43,677 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:53:43,680 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:53:43,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:53:43,682 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:53:43,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-02 10:53:43,748 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:53:43,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:53:43,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:53:43,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:53:43,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:53:43,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3466ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43, skipping insertion in model container [2018-02-02 10:53:43,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,765 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:53:43,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:53:43,854 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:53:43,862 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:53:43,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43 WrapperNode [2018-02-02 10:53:43,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:53:43,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:53:43,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:53:43,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:53:43,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... [2018-02-02 10:53:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:53:43,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:53:43,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:53:43,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:53:43,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:53:43,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:53:43,926 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:53:43,926 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 10:53:43,926 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:53:43,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:53:43,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 10:53:43,926 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:53:43,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:53:43,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:53:44,021 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:53:44,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:53:44 BoogieIcfgContainer [2018-02-02 10:53:44,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:53:44,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:53:44,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:53:44,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:53:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:53:43" (1/3) ... [2018-02-02 10:53:44,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34083b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:53:44, skipping insertion in model container [2018-02-02 10:53:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:53:43" (2/3) ... [2018-02-02 10:53:44,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34083b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:53:44, skipping insertion in model container [2018-02-02 10:53:44,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:53:44" (3/3) ... [2018-02-02 10:53:44,026 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-02 10:53:44,031 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:53:44,040 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:53:44,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:53:44,066 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:53:44,066 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 10:53:44,066 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:53:44,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:53:44,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:53:44,067 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:53:44,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:53:44,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:53:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 10:53:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:53:44,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,087 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:53:44,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:53:44,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,183 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 41#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:53:44,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:53:44,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:53:44,196 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-02 10:53:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:44,250 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-02 10:53:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:53:44,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:53:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:44,258 INFO L225 Difference]: With dead ends: 34 [2018-02-02 10:53:44,258 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 10:53:44,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:53:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 10:53:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 10:53:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:53:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-02 10:53:44,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 7 [2018-02-02 10:53:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:44,282 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-02 10:53:44,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:53:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-02 10:53:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:53:44,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,283 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,283 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:44,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 10:53:44,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,325 INFO L182 omatonBuilderFactory]: Interpolants [104#true, 105#false, 108#(= main_~i~0 0), 109#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:53:44,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:53:44,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:53:44,327 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-02-02 10:53:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:44,374 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 10:53:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:53:44,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:53:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:44,376 INFO L225 Difference]: With dead ends: 41 [2018-02-02 10:53:44,377 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 10:53:44,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:53:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 10:53:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-02 10:53:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:53:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 10:53:44,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2018-02-02 10:53:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:44,385 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 10:53:44,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:53:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 10:53:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:53:44,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,386 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,387 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:44,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:53:44,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,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-02-02 10:53:44,440 INFO L182 omatonBuilderFactory]: Interpolants [192#false, 195#(= main_~i~0 0), 196#(= main_~i~0 1), 197#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 191#true] [2018-02-02 10:53:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:53:44,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:53:44,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:53:44,441 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-02-02 10:53:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:44,513 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 10:53:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:53:44,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:53:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:44,515 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:53:44,515 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:53:44,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:53:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:53:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-02-02 10:53:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:53:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-02 10:53:44,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 17 [2018-02-02 10:53:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:44,521 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-02 10:53:44,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:53:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-02 10:53:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:53:44,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,522 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,522 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:44,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:53:44,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,587 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 308#(= main_~i~0 0), 309#(= main_~i~0 1), 310#(= main_~i~0 2), 311#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:53:44,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:53:44,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:53:44,588 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-02-02 10:53:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:44,666 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 10:53:44,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:53:44,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:53:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:44,667 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:53:44,667 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:53:44,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:53:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:53:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-02-02 10:53:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:53:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-02-02 10:53:44,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2018-02-02 10:53:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:44,672 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-02-02 10:53:44,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:53:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-02-02 10:53:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:53:44,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,673 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,673 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:44,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:53:44,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,751 INFO L182 omatonBuilderFactory]: Interpolants [448#(= main_~i~0 1), 449#(= main_~i~0 2), 450#(= main_~i~0 3), 451#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 443#true, 444#false, 447#(= main_~i~0 0)] [2018-02-02 10:53:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:53:44,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:53:44,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:53:44,752 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 7 states. [2018-02-02 10:53:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:44,841 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-02 10:53:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:53:44,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:53:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:44,842 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:53:44,842 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:53:44,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:53:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:53:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-02 10:53:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:53:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-02-02 10:53:44,848 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 27 [2018-02-02 10:53:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:44,849 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-02-02 10:53:44,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:53:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-02-02 10:53:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:53:44,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:44,850 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:44,850 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:44,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:44,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:53:44,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,897 INFO L182 omatonBuilderFactory]: Interpolants [608#true, 609#false, 612#(= main_~i~0 0), 613#(= main_~i~0 1), 614#(= main_~i~0 2), 615#(= main_~i~0 3), 616#(= main_~i~0 4), 617#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:44,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:53:44,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:53:44,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:53:44,897 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-02-02 10:53:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:45,036 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-02 10:53:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:53:45,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 10:53:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:45,037 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:53:45,038 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:53:45,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:53:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:53:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-02-02 10:53:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:53:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-02 10:53:45,044 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 32 [2018-02-02 10:53:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:45,044 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-02 10:53:45,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:53:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-02 10:53:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:53:45,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:45,045 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:45,045 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:45,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:45,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:53:45,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,100 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 803#(= main_~i~0 0), 804#(= main_~i~0 1), 805#(= main_~i~0 2), 806#(= main_~i~0 3), 807#(= main_~i~0 4), 808#(= main_~i~0 5), 809#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 799#true] [2018-02-02 10:53:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:53:45,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:53:45,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:53:45,101 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 9 states. [2018-02-02 10:53:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:45,268 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-02 10:53:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:53:45,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-02 10:53:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:45,269 INFO L225 Difference]: With dead ends: 106 [2018-02-02 10:53:45,269 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 10:53:45,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:53:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 10:53:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-02-02 10:53:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:53:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-02-02 10:53:45,275 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 37 [2018-02-02 10:53:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:45,275 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-02-02 10:53:45,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:53:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-02-02 10:53:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:53:45,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:45,276 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:45,276 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:45,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:45,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:53:45,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,327 INFO L182 omatonBuilderFactory]: Interpolants [1024#(= main_~i~0 4), 1025#(= main_~i~0 5), 1026#(= main_~i~0 6), 1027#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1016#true, 1017#false, 1020#(= main_~i~0 0), 1021#(= main_~i~0 1), 1022#(= main_~i~0 2), 1023#(= main_~i~0 3)] [2018-02-02 10:53:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:53:45,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:53:45,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:53:45,328 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 10 states. [2018-02-02 10:53:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:45,558 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-02 10:53:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:53:45,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 10:53:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:45,559 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:53:45,559 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:53:45,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:53:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:53:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-02-02 10:53:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:53:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-02-02 10:53:45,564 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 42 [2018-02-02 10:53:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:45,565 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-02-02 10:53:45,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:53:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-02-02 10:53:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:53:45,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:45,566 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:45,566 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:45,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:45,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:53:45,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,633 INFO L182 omatonBuilderFactory]: Interpolants [1264#(= main_~i~0 1), 1265#(= main_~i~0 2), 1266#(= main_~i~0 3), 1267#(= main_~i~0 4), 1268#(= main_~i~0 5), 1269#(= main_~i~0 6), 1270#(= main_~i~0 7), 1271#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1259#true, 1260#false, 1263#(= main_~i~0 0)] [2018-02-02 10:53:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:53:45,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:53:45,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:53:45,634 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 11 states. [2018-02-02 10:53:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:45,838 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-02 10:53:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:53:45,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 10:53:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:45,839 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:53:45,839 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:53:45,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:53:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:53:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2018-02-02 10:53:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:53:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-02-02 10:53:45,845 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 47 [2018-02-02 10:53:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:45,846 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-02-02 10:53:45,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:53:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-02-02 10:53:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:53:45,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:45,847 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:45,848 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:45,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:45,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:53:45,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,951 INFO L182 omatonBuilderFactory]: Interpolants [1536#(= main_~i~0 4), 1537#(= main_~i~0 5), 1538#(= main_~i~0 6), 1539#(= main_~i~0 7), 1540#(= main_~i~0 8), 1541#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1528#true, 1529#false, 1532#(= main_~i~0 0), 1533#(= main_~i~0 1), 1534#(= main_~i~0 2), 1535#(= main_~i~0 3)] [2018-02-02 10:53:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:45,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:53:45,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:53:45,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:53:45,952 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 12 states. [2018-02-02 10:53:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:46,363 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-02 10:53:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:53:46,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-02 10:53:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:46,364 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:53:46,364 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:53:46,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:53:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:53:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2018-02-02 10:53:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 10:53:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2018-02-02 10:53:46,369 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 52 [2018-02-02 10:53:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:46,370 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2018-02-02 10:53:46,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:53:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2018-02-02 10:53:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:53:46,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:46,371 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:46,372 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:46,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:46,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:46,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:53:46,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:46,452 INFO L182 omatonBuilderFactory]: Interpolants [1824#false, 1827#(= main_~i~0 0), 1828#(= main_~i~0 1), 1829#(= main_~i~0 2), 1830#(= main_~i~0 3), 1831#(= main_~i~0 4), 1832#(= main_~i~0 5), 1833#(= main_~i~0 6), 1834#(= main_~i~0 7), 1835#(= main_~i~0 8), 1836#(= main_~i~0 9), 1837#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1823#true] [2018-02-02 10:53:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:46,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:53:46,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:53:46,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:53:46,452 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand 13 states. [2018-02-02 10:53:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:46,896 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-02 10:53:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:53:46,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-02 10:53:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:46,898 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:53:46,898 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:53:46,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:53:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:53:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2018-02-02 10:53:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:53:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2018-02-02 10:53:46,904 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 57 [2018-02-02 10:53:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:46,904 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2018-02-02 10:53:46,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:53:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-02-02 10:53:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:53:46,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:46,906 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:46,906 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:46,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:47,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:53:47,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,002 INFO L182 omatonBuilderFactory]: Interpolants [2144#true, 2145#false, 2148#(= main_~i~0 0), 2149#(= main_~i~0 1), 2150#(= main_~i~0 2), 2151#(= main_~i~0 3), 2152#(= main_~i~0 4), 2153#(= main_~i~0 5), 2154#(= main_~i~0 6), 2155#(= main_~i~0 7), 2156#(= main_~i~0 8), 2157#(= main_~i~0 9), 2158#(= main_~i~0 10), 2159#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:53:47,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:53:47,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:53:47,003 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 14 states. [2018-02-02 10:53:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:47,370 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-02 10:53:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:53:47,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-02 10:53:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:47,371 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:53:47,371 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:53:47,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:53:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:53:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-02-02 10:53:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:53:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-02-02 10:53:47,375 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 62 [2018-02-02 10:53:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:47,375 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-02-02 10:53:47,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:53:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-02-02 10:53:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:53:47,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:47,377 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:47,377 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:47,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:47,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:53:47,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,464 INFO L182 omatonBuilderFactory]: Interpolants [2496#(= main_~i~0 1), 2497#(= main_~i~0 2), 2498#(= main_~i~0 3), 2499#(= main_~i~0 4), 2500#(= main_~i~0 5), 2501#(= main_~i~0 6), 2502#(= main_~i~0 7), 2503#(= main_~i~0 8), 2504#(= main_~i~0 9), 2505#(= main_~i~0 10), 2506#(= main_~i~0 11), 2507#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2491#true, 2492#false, 2495#(= main_~i~0 0)] [2018-02-02 10:53:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:53:47,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:53:47,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:53:47,465 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 15 states. [2018-02-02 10:53:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:47,863 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-02 10:53:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:53:47,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-02-02 10:53:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:47,864 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:53:47,864 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:53:47,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:53:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:53:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2018-02-02 10:53:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:53:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2018-02-02 10:53:47,868 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 67 [2018-02-02 10:53:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:47,869 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2018-02-02 10:53:47,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:53:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2018-02-02 10:53:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:53:47,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:47,870 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:47,870 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:47,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:47,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:53:47,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,966 INFO L182 omatonBuilderFactory]: Interpolants [2880#(= main_~i~0 12), 2881#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2864#true, 2865#false, 2868#(= main_~i~0 0), 2869#(= main_~i~0 1), 2870#(= main_~i~0 2), 2871#(= main_~i~0 3), 2872#(= main_~i~0 4), 2873#(= main_~i~0 5), 2874#(= main_~i~0 6), 2875#(= main_~i~0 7), 2876#(= main_~i~0 8), 2877#(= main_~i~0 9), 2878#(= main_~i~0 10), 2879#(= main_~i~0 11)] [2018-02-02 10:53:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:47,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:53:47,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:53:47,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:53:47,967 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand 16 states. [2018-02-02 10:53:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:48,447 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-02 10:53:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:53:48,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 10:53:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:48,448 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:53:48,448 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:53:48,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:53:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:53:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2018-02-02 10:53:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:53:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2018-02-02 10:53:48,451 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 72 [2018-02-02 10:53:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:48,452 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2018-02-02 10:53:48,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:53:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-02-02 10:53:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:53:48,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:48,452 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:48,452 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:48,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:48,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:48,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:53:48,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:48,569 INFO L182 omatonBuilderFactory]: Interpolants [3264#false, 3267#(= main_~i~0 0), 3268#(= main_~i~0 1), 3269#(= main_~i~0 2), 3270#(= main_~i~0 3), 3271#(= main_~i~0 4), 3272#(= main_~i~0 5), 3273#(= main_~i~0 6), 3274#(= main_~i~0 7), 3275#(= main_~i~0 8), 3276#(= main_~i~0 9), 3277#(= main_~i~0 10), 3278#(= main_~i~0 11), 3279#(= main_~i~0 12), 3280#(= main_~i~0 13), 3281#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 3263#true] [2018-02-02 10:53:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:48,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:53:48,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:53:48,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:53:48,570 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand 17 states. [2018-02-02 10:53:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:49,069 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-02 10:53:49,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:53:49,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-02 10:53:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:49,070 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:53:49,070 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:53:49,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:53:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:53:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-02-02 10:53:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 10:53:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2018-02-02 10:53:49,074 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 77 [2018-02-02 10:53:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:49,074 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2018-02-02 10:53:49,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:53:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2018-02-02 10:53:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:53:49,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:49,075 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:49,075 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:49,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:49,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:49,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:53:49,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:49,207 INFO L182 omatonBuilderFactory]: Interpolants [3688#true, 3689#false, 3692#(= main_~i~0 0), 3693#(= main_~i~0 1), 3694#(= main_~i~0 2), 3695#(= main_~i~0 3), 3696#(= main_~i~0 4), 3697#(= main_~i~0 5), 3698#(= main_~i~0 6), 3699#(= main_~i~0 7), 3700#(= main_~i~0 8), 3701#(= main_~i~0 9), 3702#(= main_~i~0 10), 3703#(= main_~i~0 11), 3704#(= main_~i~0 12), 3705#(= main_~i~0 13), 3706#(= main_~i~0 14), 3707#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:49,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:53:49,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:53:49,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:53:49,208 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand 18 states. [2018-02-02 10:53:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:49,770 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 10:53:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:53:49,770 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-02-02 10:53:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:49,771 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:53:49,771 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:53:49,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:53:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:53:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2018-02-02 10:53:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:53:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2018-02-02 10:53:49,775 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 82 [2018-02-02 10:53:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:49,776 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2018-02-02 10:53:49,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:53:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2018-02-02 10:53:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:53:49,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:49,777 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:49,777 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:49,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:49,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:49,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:53:49,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:49,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-02-02 10:53:49,902 INFO L182 omatonBuilderFactory]: Interpolants [4139#true, 4140#false, 4143#(= main_~i~0 0), 4144#(= main_~i~0 1), 4145#(= main_~i~0 2), 4146#(= main_~i~0 3), 4147#(= main_~i~0 4), 4148#(= main_~i~0 5), 4149#(= main_~i~0 6), 4150#(= main_~i~0 7), 4151#(= main_~i~0 8), 4152#(= main_~i~0 9), 4153#(= main_~i~0 10), 4154#(= main_~i~0 11), 4155#(= main_~i~0 12), 4156#(= main_~i~0 13), 4157#(= main_~i~0 14), 4158#(= main_~i~0 15), 4159#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:49,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:53:49,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:53:49,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:53:49,902 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand 19 states. [2018-02-02 10:53:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:50,543 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-02 10:53:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:53:50,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-02 10:53:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:50,544 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:53:50,544 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:53:50,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:53:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:53:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-02 10:53:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:53:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 253 transitions. [2018-02-02 10:53:50,548 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 253 transitions. Word has length 87 [2018-02-02 10:53:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:50,549 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 253 transitions. [2018-02-02 10:53:50,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:53:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 253 transitions. [2018-02-02 10:53:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:53:50,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:50,550 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:50,550 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:50,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:50,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:50,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:53:50,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:50,666 INFO L182 omatonBuilderFactory]: Interpolants [4616#true, 4617#false, 4620#(= main_~i~0 0), 4621#(= main_~i~0 1), 4622#(= main_~i~0 2), 4623#(= main_~i~0 3), 4624#(= main_~i~0 4), 4625#(= main_~i~0 5), 4626#(= main_~i~0 6), 4627#(= main_~i~0 7), 4628#(= main_~i~0 8), 4629#(= main_~i~0 9), 4630#(= main_~i~0 10), 4631#(= main_~i~0 11), 4632#(= main_~i~0 12), 4633#(= main_~i~0 13), 4634#(= main_~i~0 14), 4635#(= main_~i~0 15), 4636#(= main_~i~0 16), 4637#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:50,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:53:50,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:53:50,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:53:50,667 INFO L87 Difference]: Start difference. First operand 220 states and 253 transitions. Second operand 20 states. [2018-02-02 10:53:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:51,456 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-02 10:53:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:53:51,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-02-02 10:53:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:51,458 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:53:51,458 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:53:51,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:53:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:53:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 232. [2018-02-02 10:53:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 10:53:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 267 transitions. [2018-02-02 10:53:51,465 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 267 transitions. Word has length 92 [2018-02-02 10:53:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:51,465 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 267 transitions. [2018-02-02 10:53:51,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:53:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 267 transitions. [2018-02-02 10:53:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:53:51,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:51,466 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:51,466 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:51,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:51,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:51,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:53:51,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:51,610 INFO L182 omatonBuilderFactory]: Interpolants [5120#false, 5123#(= main_~i~0 0), 5124#(= main_~i~0 1), 5125#(= main_~i~0 2), 5126#(= main_~i~0 3), 5127#(= main_~i~0 4), 5128#(= main_~i~0 5), 5129#(= main_~i~0 6), 5130#(= main_~i~0 7), 5131#(= main_~i~0 8), 5132#(= main_~i~0 9), 5133#(= main_~i~0 10), 5134#(= main_~i~0 11), 5135#(= main_~i~0 12), 5136#(= main_~i~0 13), 5137#(= main_~i~0 14), 5138#(= main_~i~0 15), 5139#(= main_~i~0 16), 5140#(= main_~i~0 17), 5141#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 5119#true] [2018-02-02 10:53:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:51,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:53:51,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:53:51,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:53:51,612 INFO L87 Difference]: Start difference. First operand 232 states and 267 transitions. Second operand 21 states. [2018-02-02 10:53:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:52,464 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-02 10:53:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:53:52,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-02-02 10:53:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:52,465 INFO L225 Difference]: With dead ends: 262 [2018-02-02 10:53:52,465 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 10:53:52,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:53:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 10:53:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2018-02-02 10:53:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:53:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 281 transitions. [2018-02-02 10:53:52,468 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 281 transitions. Word has length 97 [2018-02-02 10:53:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:52,468 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 281 transitions. [2018-02-02 10:53:52,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:53:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 281 transitions. [2018-02-02 10:53:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:53:52,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:52,469 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:52,469 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:52,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:52,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:52,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:53:52,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:52,619 INFO L182 omatonBuilderFactory]: Interpolants [5664#(= main_~i~0 12), 5665#(= main_~i~0 13), 5666#(= main_~i~0 14), 5667#(= main_~i~0 15), 5668#(= main_~i~0 16), 5669#(= main_~i~0 17), 5670#(= main_~i~0 18), 5671#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 5648#true, 5649#false, 5652#(= main_~i~0 0), 5653#(= main_~i~0 1), 5654#(= main_~i~0 2), 5655#(= main_~i~0 3), 5656#(= main_~i~0 4), 5657#(= main_~i~0 5), 5658#(= main_~i~0 6), 5659#(= main_~i~0 7), 5660#(= main_~i~0 8), 5661#(= main_~i~0 9), 5662#(= main_~i~0 10), 5663#(= main_~i~0 11)] [2018-02-02 10:53:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:52,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:53:52,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:53:52,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:53:52,620 INFO L87 Difference]: Start difference. First operand 244 states and 281 transitions. Second operand 22 states. [2018-02-02 10:53:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:53,871 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-02 10:53:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:53:53,872 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-02 10:53:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:53,873 INFO L225 Difference]: With dead ends: 275 [2018-02-02 10:53:53,873 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 10:53:53,873 INFO L554 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-02-02 10:53:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 10:53:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 256. [2018-02-02 10:53:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 10:53:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2018-02-02 10:53:53,877 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 102 [2018-02-02 10:53:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:53,877 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2018-02-02 10:53:53,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:53:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2018-02-02 10:53:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:53:53,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:53,877 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:53,878 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:53,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:54,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:54,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:53:54,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:54,030 INFO L182 omatonBuilderFactory]: Interpolants [6208#(= main_~i~0 1), 6209#(= main_~i~0 2), 6210#(= main_~i~0 3), 6211#(= main_~i~0 4), 6212#(= main_~i~0 5), 6213#(= main_~i~0 6), 6214#(= main_~i~0 7), 6215#(= main_~i~0 8), 6216#(= main_~i~0 9), 6217#(= main_~i~0 10), 6218#(= main_~i~0 11), 6219#(= main_~i~0 12), 6220#(= main_~i~0 13), 6221#(= main_~i~0 14), 6222#(= main_~i~0 15), 6223#(= main_~i~0 16), 6224#(= main_~i~0 17), 6225#(= main_~i~0 18), 6226#(= main_~i~0 19), 6227#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 6203#true, 6204#false, 6207#(= main_~i~0 0)] [2018-02-02 10:53:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:54,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:53:54,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:53:54,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:53:54,032 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand 23 states. [2018-02-02 10:53:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:55,057 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-02 10:53:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:53:55,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2018-02-02 10:53:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:55,058 INFO L225 Difference]: With dead ends: 288 [2018-02-02 10:53:55,058 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 10:53:55,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:53:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 10:53:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2018-02-02 10:53:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:53:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 309 transitions. [2018-02-02 10:53:55,061 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 309 transitions. Word has length 107 [2018-02-02 10:53:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:55,061 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 309 transitions. [2018-02-02 10:53:55,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:53:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 309 transitions. [2018-02-02 10:53:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:53:55,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:55,062 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:55,062 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:55,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:55,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:55,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:53:55,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:55,354 INFO L182 omatonBuilderFactory]: Interpolants [6784#true, 6785#false, 6788#(= main_~i~0 0), 6789#(= main_~i~0 1), 6790#(= main_~i~0 2), 6791#(= main_~i~0 3), 6792#(= main_~i~0 4), 6793#(= main_~i~0 5), 6794#(= main_~i~0 6), 6795#(= main_~i~0 7), 6796#(= main_~i~0 8), 6797#(= main_~i~0 9), 6798#(= main_~i~0 10), 6799#(= main_~i~0 11), 6800#(= main_~i~0 12), 6801#(= main_~i~0 13), 6802#(= main_~i~0 14), 6803#(= main_~i~0 15), 6804#(= main_~i~0 16), 6805#(= main_~i~0 17), 6806#(= main_~i~0 18), 6807#(= main_~i~0 19), 6808#(= main_~i~0 20), 6809#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:55,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:53:55,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:53:55,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:53:55,355 INFO L87 Difference]: Start difference. First operand 268 states and 309 transitions. Second operand 24 states. [2018-02-02 10:53:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:56,529 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-02 10:53:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:53:56,530 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2018-02-02 10:53:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:56,531 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:53:56,531 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:53:56,531 INFO L554 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-02-02 10:53:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:53:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2018-02-02 10:53:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-02 10:53:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 323 transitions. [2018-02-02 10:53:56,536 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 323 transitions. Word has length 112 [2018-02-02 10:53:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:56,537 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 323 transitions. [2018-02-02 10:53:56,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:53:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 323 transitions. [2018-02-02 10:53:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 10:53:56,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:56,538 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:56,538 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:56,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:56,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:56,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:53:56,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:56,724 INFO L182 omatonBuilderFactory]: Interpolants [7391#true, 7392#false, 7395#(= main_~i~0 0), 7396#(= main_~i~0 1), 7397#(= main_~i~0 2), 7398#(= main_~i~0 3), 7399#(= main_~i~0 4), 7400#(= main_~i~0 5), 7401#(= main_~i~0 6), 7402#(= main_~i~0 7), 7403#(= main_~i~0 8), 7404#(= main_~i~0 9), 7405#(= main_~i~0 10), 7406#(= main_~i~0 11), 7407#(= main_~i~0 12), 7408#(= main_~i~0 13), 7409#(= main_~i~0 14), 7410#(= main_~i~0 15), 7411#(= main_~i~0 16), 7412#(= main_~i~0 17), 7413#(= main_~i~0 18), 7414#(= main_~i~0 19), 7415#(= main_~i~0 20), 7416#(= main_~i~0 21), 7417#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:56,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:53:56,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:53:56,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:53:56,726 INFO L87 Difference]: Start difference. First operand 280 states and 323 transitions. Second operand 25 states. [2018-02-02 10:53:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:57,990 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-02 10:53:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:53:57,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-02-02 10:53:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:57,991 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:53:57,991 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 10:53:57,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:53:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 10:53:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 292. [2018-02-02 10:53:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 10:53:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 337 transitions. [2018-02-02 10:53:57,995 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 337 transitions. Word has length 117 [2018-02-02 10:53:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:57,995 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 337 transitions. [2018-02-02 10:53:57,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:53:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 337 transitions. [2018-02-02 10:53:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 10:53:57,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:57,996 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:57,996 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:57,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:58,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:58,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:53:58,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:58,186 INFO L182 omatonBuilderFactory]: Interpolants [8024#true, 8025#false, 8028#(= main_~i~0 0), 8029#(= main_~i~0 1), 8030#(= main_~i~0 2), 8031#(= main_~i~0 3), 8032#(= main_~i~0 4), 8033#(= main_~i~0 5), 8034#(= main_~i~0 6), 8035#(= main_~i~0 7), 8036#(= main_~i~0 8), 8037#(= main_~i~0 9), 8038#(= main_~i~0 10), 8039#(= main_~i~0 11), 8040#(= main_~i~0 12), 8041#(= main_~i~0 13), 8042#(= main_~i~0 14), 8043#(= main_~i~0 15), 8044#(= main_~i~0 16), 8045#(= main_~i~0 17), 8046#(= main_~i~0 18), 8047#(= main_~i~0 19), 8048#(= main_~i~0 20), 8049#(= main_~i~0 21), 8050#(= main_~i~0 22), 8051#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:53:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:58,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:53:58,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:53:58,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:53:58,187 INFO L87 Difference]: Start difference. First operand 292 states and 337 transitions. Second operand 26 states. [2018-02-02 10:53:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:53:59,565 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-02 10:53:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:53:59,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-02-02 10:53:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:53:59,566 INFO L225 Difference]: With dead ends: 327 [2018-02-02 10:53:59,566 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 10:53:59,566 INFO L554 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-02-02 10:53:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 10:53:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 304. [2018-02-02 10:53:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-02 10:53:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 351 transitions. [2018-02-02 10:53:59,571 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 351 transitions. Word has length 122 [2018-02-02 10:53:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:53:59,571 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 351 transitions. [2018-02-02 10:53:59,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:53:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 351 transitions. [2018-02-02 10:53:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:53:59,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:53:59,572 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 10:53:59,572 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:53:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:53:59,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:53:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:53:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:59,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:53:59,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:53:59,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:53:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:59,750 INFO L182 omatonBuilderFactory]: Interpolants [8704#(= main_~i~0 17), 8705#(= main_~i~0 18), 8706#(= main_~i~0 19), 8707#(= main_~i~0 20), 8708#(= main_~i~0 21), 8709#(= main_~i~0 22), 8710#(= main_~i~0 23), 8711#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 8683#true, 8684#false, 8687#(= main_~i~0 0), 8688#(= main_~i~0 1), 8689#(= main_~i~0 2), 8690#(= main_~i~0 3), 8691#(= main_~i~0 4), 8692#(= main_~i~0 5), 8693#(= main_~i~0 6), 8694#(= main_~i~0 7), 8695#(= main_~i~0 8), 8696#(= main_~i~0 9), 8697#(= main_~i~0 10), 8698#(= main_~i~0 11), 8699#(= main_~i~0 12), 8700#(= main_~i~0 13), 8701#(= main_~i~0 14), 8702#(= main_~i~0 15), 8703#(= main_~i~0 16)] [2018-02-02 10:53:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:53:59,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:53:59,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:53:59,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:53:59,751 INFO L87 Difference]: Start difference. First operand 304 states and 351 transitions. Second operand 27 states. [2018-02-02 10:54:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:01,223 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-02 10:54:01,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:54:01,224 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2018-02-02 10:54:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:01,224 INFO L225 Difference]: With dead ends: 340 [2018-02-02 10:54:01,225 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 10:54:01,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:54:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 10:54:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 316. [2018-02-02 10:54:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 10:54:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 365 transitions. [2018-02-02 10:54:01,228 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 365 transitions. Word has length 127 [2018-02-02 10:54:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:01,228 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 365 transitions. [2018-02-02 10:54:01,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:54:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 365 transitions. [2018-02-02 10:54:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 10:54:01,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:01,228 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:01,229 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:01,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:01,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:01,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:54:01,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:01,450 INFO L182 omatonBuilderFactory]: Interpolants [9368#true, 9369#false, 9372#(= main_~i~0 0), 9373#(= main_~i~0 1), 9374#(= main_~i~0 2), 9375#(= main_~i~0 3), 9376#(= main_~i~0 4), 9377#(= main_~i~0 5), 9378#(= main_~i~0 6), 9379#(= main_~i~0 7), 9380#(= main_~i~0 8), 9381#(= main_~i~0 9), 9382#(= main_~i~0 10), 9383#(= main_~i~0 11), 9384#(= main_~i~0 12), 9385#(= main_~i~0 13), 9386#(= main_~i~0 14), 9387#(= main_~i~0 15), 9388#(= main_~i~0 16), 9389#(= main_~i~0 17), 9390#(= main_~i~0 18), 9391#(= main_~i~0 19), 9392#(= main_~i~0 20), 9393#(= main_~i~0 21), 9394#(= main_~i~0 22), 9395#(= main_~i~0 23), 9396#(= main_~i~0 24), 9397#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:54:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:01,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:54:01,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:54:01,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:54:01,451 INFO L87 Difference]: Start difference. First operand 316 states and 365 transitions. Second operand 28 states. [2018-02-02 10:54:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:03,632 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-02 10:54:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:54:03,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 132 [2018-02-02 10:54:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:03,633 INFO L225 Difference]: With dead ends: 353 [2018-02-02 10:54:03,633 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 10:54:03,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:54:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 10:54:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2018-02-02 10:54:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:54:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2018-02-02 10:54:03,637 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 132 [2018-02-02 10:54:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:03,637 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2018-02-02 10:54:03,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:54:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2018-02-02 10:54:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 10:54:03,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:03,639 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:03,639 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:03,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:04,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:04,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:54:04,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:04,004 INFO L182 omatonBuilderFactory]: Interpolants [10079#true, 10080#false, 10083#(= main_~i~0 0), 10084#(= main_~i~0 1), 10085#(= main_~i~0 2), 10086#(= main_~i~0 3), 10087#(= main_~i~0 4), 10088#(= main_~i~0 5), 10089#(= main_~i~0 6), 10090#(= main_~i~0 7), 10091#(= main_~i~0 8), 10092#(= main_~i~0 9), 10093#(= main_~i~0 10), 10094#(= main_~i~0 11), 10095#(= main_~i~0 12), 10096#(= main_~i~0 13), 10097#(= main_~i~0 14), 10098#(= main_~i~0 15), 10099#(= main_~i~0 16), 10100#(= main_~i~0 17), 10101#(= main_~i~0 18), 10102#(= main_~i~0 19), 10103#(= main_~i~0 20), 10104#(= main_~i~0 21), 10105#(= main_~i~0 22), 10106#(= main_~i~0 23), 10107#(= main_~i~0 24), 10108#(= main_~i~0 25), 10109#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:54:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:04,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:54:04,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:54:04,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:54:04,005 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 29 states. [2018-02-02 10:54:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:05,905 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-02 10:54:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:54:05,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 137 [2018-02-02 10:54:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:05,906 INFO L225 Difference]: With dead ends: 366 [2018-02-02 10:54:05,906 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 10:54:05,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:54:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 10:54:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-02 10:54:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 10:54:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 393 transitions. [2018-02-02 10:54:05,912 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 393 transitions. Word has length 137 [2018-02-02 10:54:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:05,913 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 393 transitions. [2018-02-02 10:54:05,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:54:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 393 transitions. [2018-02-02 10:54:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 10:54:05,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:05,914 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:05,914 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:05,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:06,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:06,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:54:06,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:06,163 INFO L182 omatonBuilderFactory]: Interpolants [10816#true, 10817#false, 10820#(= main_~i~0 0), 10821#(= main_~i~0 1), 10822#(= main_~i~0 2), 10823#(= main_~i~0 3), 10824#(= main_~i~0 4), 10825#(= main_~i~0 5), 10826#(= main_~i~0 6), 10827#(= main_~i~0 7), 10828#(= main_~i~0 8), 10829#(= main_~i~0 9), 10830#(= main_~i~0 10), 10831#(= main_~i~0 11), 10832#(= main_~i~0 12), 10833#(= main_~i~0 13), 10834#(= main_~i~0 14), 10835#(= main_~i~0 15), 10836#(= main_~i~0 16), 10837#(= main_~i~0 17), 10838#(= main_~i~0 18), 10839#(= main_~i~0 19), 10840#(= main_~i~0 20), 10841#(= main_~i~0 21), 10842#(= main_~i~0 22), 10843#(= main_~i~0 23), 10844#(= main_~i~0 24), 10845#(= main_~i~0 25), 10846#(= main_~i~0 26), 10847#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:54:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:06,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:54:06,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:54:06,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:54:06,165 INFO L87 Difference]: Start difference. First operand 340 states and 393 transitions. Second operand 30 states. [2018-02-02 10:54:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:07,956 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-02 10:54:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:54:07,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 142 [2018-02-02 10:54:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:07,957 INFO L225 Difference]: With dead ends: 379 [2018-02-02 10:54:07,958 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 10:54:07,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:54:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 10:54:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2018-02-02 10:54:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:54:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2018-02-02 10:54:07,962 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 142 [2018-02-02 10:54:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:07,962 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2018-02-02 10:54:07,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:54:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2018-02-02 10:54:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 10:54:07,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:07,963 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:07,963 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:07,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:08,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:08,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:54:08,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:08,221 INFO L182 omatonBuilderFactory]: Interpolants [11584#(= main_~i~0 1), 11585#(= main_~i~0 2), 11586#(= main_~i~0 3), 11587#(= main_~i~0 4), 11588#(= main_~i~0 5), 11589#(= main_~i~0 6), 11590#(= main_~i~0 7), 11591#(= main_~i~0 8), 11592#(= main_~i~0 9), 11593#(= main_~i~0 10), 11594#(= main_~i~0 11), 11595#(= main_~i~0 12), 11596#(= main_~i~0 13), 11597#(= main_~i~0 14), 11598#(= main_~i~0 15), 11599#(= main_~i~0 16), 11600#(= main_~i~0 17), 11601#(= main_~i~0 18), 11602#(= main_~i~0 19), 11603#(= main_~i~0 20), 11604#(= main_~i~0 21), 11605#(= main_~i~0 22), 11606#(= main_~i~0 23), 11607#(= main_~i~0 24), 11608#(= main_~i~0 25), 11609#(= main_~i~0 26), 11610#(= main_~i~0 27), 11611#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 11579#true, 11580#false, 11583#(= main_~i~0 0)] [2018-02-02 10:54:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:08,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:54:08,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:54:08,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:54:08,222 INFO L87 Difference]: Start difference. First operand 352 states and 407 transitions. Second operand 31 states. [2018-02-02 10:54:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:10,137 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-02 10:54:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:54:10,138 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-02-02 10:54:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:10,139 INFO L225 Difference]: With dead ends: 392 [2018-02-02 10:54:10,139 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 10:54:10,139 INFO L554 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-02-02 10:54:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 10:54:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 364. [2018-02-02 10:54:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 10:54:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 421 transitions. [2018-02-02 10:54:10,143 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 421 transitions. Word has length 147 [2018-02-02 10:54:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:10,144 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 421 transitions. [2018-02-02 10:54:10,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:54:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 421 transitions. [2018-02-02 10:54:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 10:54:10,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:10,145 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:10,145 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:10,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:10,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:10,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:54:10,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:10,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-02-02 10:54:10,447 INFO L182 omatonBuilderFactory]: Interpolants [12368#true, 12369#false, 12372#(= main_~i~0 0), 12373#(= main_~i~0 1), 12374#(= main_~i~0 2), 12375#(= main_~i~0 3), 12376#(= main_~i~0 4), 12377#(= main_~i~0 5), 12378#(= main_~i~0 6), 12379#(= main_~i~0 7), 12380#(= main_~i~0 8), 12381#(= main_~i~0 9), 12382#(= main_~i~0 10), 12383#(= main_~i~0 11), 12384#(= main_~i~0 12), 12385#(= main_~i~0 13), 12386#(= main_~i~0 14), 12387#(= main_~i~0 15), 12388#(= main_~i~0 16), 12389#(= main_~i~0 17), 12390#(= main_~i~0 18), 12391#(= main_~i~0 19), 12392#(= main_~i~0 20), 12393#(= main_~i~0 21), 12394#(= main_~i~0 22), 12395#(= main_~i~0 23), 12396#(= main_~i~0 24), 12397#(= main_~i~0 25), 12398#(= main_~i~0 26), 12399#(= main_~i~0 27), 12400#(= main_~i~0 28), 12401#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:54:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:10,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:54:10,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:54:10,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:54:10,448 INFO L87 Difference]: Start difference. First operand 364 states and 421 transitions. Second operand 32 states. [2018-02-02 10:54:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:12,492 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-02 10:54:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:54:12,492 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 152 [2018-02-02 10:54:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:12,493 INFO L225 Difference]: With dead ends: 405 [2018-02-02 10:54:12,493 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 10:54:12,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:54:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 10:54:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 376. [2018-02-02 10:54:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-02 10:54:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 435 transitions. [2018-02-02 10:54:12,497 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 435 transitions. Word has length 152 [2018-02-02 10:54:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:12,497 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 435 transitions. [2018-02-02 10:54:12,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:54:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 435 transitions. [2018-02-02 10:54:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 10:54:12,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:12,498 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:12,498 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:12,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:12,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:12,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:54:12,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:12,782 INFO L182 omatonBuilderFactory]: Interpolants [13184#false, 13187#(= main_~i~0 0), 13188#(= main_~i~0 1), 13189#(= main_~i~0 2), 13190#(= main_~i~0 3), 13191#(= main_~i~0 4), 13192#(= main_~i~0 5), 13193#(= main_~i~0 6), 13194#(= main_~i~0 7), 13195#(= main_~i~0 8), 13196#(= main_~i~0 9), 13197#(= main_~i~0 10), 13198#(= main_~i~0 11), 13199#(= main_~i~0 12), 13200#(= main_~i~0 13), 13201#(= main_~i~0 14), 13202#(= main_~i~0 15), 13203#(= main_~i~0 16), 13204#(= main_~i~0 17), 13205#(= main_~i~0 18), 13206#(= main_~i~0 19), 13207#(= main_~i~0 20), 13208#(= main_~i~0 21), 13209#(= main_~i~0 22), 13210#(= main_~i~0 23), 13211#(= main_~i~0 24), 13212#(= main_~i~0 25), 13213#(= main_~i~0 26), 13214#(= main_~i~0 27), 13215#(= main_~i~0 28), 13216#(= main_~i~0 29), 13217#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 13183#true] [2018-02-02 10:54:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:12,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:54:12,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:54:12,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:54:12,784 INFO L87 Difference]: Start difference. First operand 376 states and 435 transitions. Second operand 33 states. [2018-02-02 10:54:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:14,926 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-02 10:54:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:54:14,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2018-02-02 10:54:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:14,928 INFO L225 Difference]: With dead ends: 418 [2018-02-02 10:54:14,928 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 10:54:14,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:54:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 10:54:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 388. [2018-02-02 10:54:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-02 10:54:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 449 transitions. [2018-02-02 10:54:14,934 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 449 transitions. Word has length 157 [2018-02-02 10:54:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:14,934 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 449 transitions. [2018-02-02 10:54:14,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:54:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 449 transitions. [2018-02-02 10:54:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 10:54:14,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:14,936 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:14,936 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:14,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:15,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:15,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:54:15,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:15,399 INFO L182 omatonBuilderFactory]: Interpolants [14024#true, 14025#false, 14028#(= main_~i~0 0), 14029#(= main_~i~0 1), 14030#(= main_~i~0 2), 14031#(= main_~i~0 3), 14032#(= main_~i~0 4), 14033#(= main_~i~0 5), 14034#(= main_~i~0 6), 14035#(= main_~i~0 7), 14036#(= main_~i~0 8), 14037#(= main_~i~0 9), 14038#(= main_~i~0 10), 14039#(= main_~i~0 11), 14040#(= main_~i~0 12), 14041#(= main_~i~0 13), 14042#(= main_~i~0 14), 14043#(= main_~i~0 15), 14044#(= main_~i~0 16), 14045#(= main_~i~0 17), 14046#(= main_~i~0 18), 14047#(= main_~i~0 19), 14048#(= main_~i~0 20), 14049#(= main_~i~0 21), 14050#(= main_~i~0 22), 14051#(= main_~i~0 23), 14052#(= main_~i~0 24), 14053#(= main_~i~0 25), 14054#(= main_~i~0 26), 14055#(= main_~i~0 27), 14056#(= main_~i~0 28), 14057#(= main_~i~0 29), 14058#(= main_~i~0 30), 14059#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-02 10:54:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:15,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:54:15,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:54:15,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:54:15,400 INFO L87 Difference]: Start difference. First operand 388 states and 449 transitions. Second operand 34 states. [2018-02-02 10:54:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:17,708 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-02 10:54:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:54:17,708 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2018-02-02 10:54:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:17,709 INFO L225 Difference]: With dead ends: 431 [2018-02-02 10:54:17,709 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 10:54:17,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:54:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 10:54:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 400. [2018-02-02 10:54:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 10:54:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 463 transitions. [2018-02-02 10:54:17,715 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 463 transitions. Word has length 162 [2018-02-02 10:54:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:17,716 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 463 transitions. [2018-02-02 10:54:17,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:54:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 463 transitions. [2018-02-02 10:54:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 10:54:17,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:17,717 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:17,717 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:17,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:18,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:18,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:54:18,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:18,055 INFO L182 omatonBuilderFactory]: Interpolants [14912#(= main_~i~0 17), 14913#(= main_~i~0 18), 14914#(= main_~i~0 19), 14915#(= main_~i~0 20), 14916#(= main_~i~0 21), 14917#(= main_~i~0 22), 14918#(= main_~i~0 23), 14919#(= main_~i~0 24), 14920#(= main_~i~0 25), 14921#(= main_~i~0 26), 14922#(= main_~i~0 27), 14923#(= main_~i~0 28), 14924#(= main_~i~0 29), 14925#(= main_~i~0 30), 14926#(= main_~i~0 31), 14927#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 14891#true, 14892#false, 14895#(= main_~i~0 0), 14896#(= main_~i~0 1), 14897#(= main_~i~0 2), 14898#(= main_~i~0 3), 14899#(= main_~i~0 4), 14900#(= main_~i~0 5), 14901#(= main_~i~0 6), 14902#(= main_~i~0 7), 14903#(= main_~i~0 8), 14904#(= main_~i~0 9), 14905#(= main_~i~0 10), 14906#(= main_~i~0 11), 14907#(= main_~i~0 12), 14908#(= main_~i~0 13), 14909#(= main_~i~0 14), 14910#(= main_~i~0 15), 14911#(= main_~i~0 16)] [2018-02-02 10:54:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:18,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:54:18,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:54:18,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:54:18,057 INFO L87 Difference]: Start difference. First operand 400 states and 463 transitions. Second operand 35 states. [2018-02-02 10:54:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:20,515 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-02 10:54:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:54:20,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-02 10:54:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:20,516 INFO L225 Difference]: With dead ends: 444 [2018-02-02 10:54:20,516 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 10:54:20,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:54:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 10:54:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 412. [2018-02-02 10:54:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 10:54:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 477 transitions. [2018-02-02 10:54:20,520 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 477 transitions. Word has length 167 [2018-02-02 10:54:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:20,520 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 477 transitions. [2018-02-02 10:54:20,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:54:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 477 transitions. [2018-02-02 10:54:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 10:54:20,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:20,521 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:20,521 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:20,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:20,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:20,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:54:20,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:20,860 INFO L182 omatonBuilderFactory]: Interpolants [15808#(= main_~i~0 20), 15809#(= main_~i~0 21), 15810#(= main_~i~0 22), 15811#(= main_~i~0 23), 15812#(= main_~i~0 24), 15813#(= main_~i~0 25), 15814#(= main_~i~0 26), 15815#(= main_~i~0 27), 15816#(= main_~i~0 28), 15817#(= main_~i~0 29), 15818#(= main_~i~0 30), 15819#(= main_~i~0 31), 15820#(= main_~i~0 32), 15821#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 15784#true, 15785#false, 15788#(= main_~i~0 0), 15789#(= main_~i~0 1), 15790#(= main_~i~0 2), 15791#(= main_~i~0 3), 15792#(= main_~i~0 4), 15793#(= main_~i~0 5), 15794#(= main_~i~0 6), 15795#(= main_~i~0 7), 15796#(= main_~i~0 8), 15797#(= main_~i~0 9), 15798#(= main_~i~0 10), 15799#(= main_~i~0 11), 15800#(= main_~i~0 12), 15801#(= main_~i~0 13), 15802#(= main_~i~0 14), 15803#(= main_~i~0 15), 15804#(= main_~i~0 16), 15805#(= main_~i~0 17), 15806#(= main_~i~0 18), 15807#(= main_~i~0 19)] [2018-02-02 10:54:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:20,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:54:20,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:54:20,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:54:20,861 INFO L87 Difference]: Start difference. First operand 412 states and 477 transitions. Second operand 36 states. [2018-02-02 10:54:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:23,576 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-02 10:54:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:54:23,577 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 172 [2018-02-02 10:54:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:23,578 INFO L225 Difference]: With dead ends: 457 [2018-02-02 10:54:23,578 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 10:54:23,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 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-02-02 10:54:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 10:54:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 424. [2018-02-02 10:54:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 10:54:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 491 transitions. [2018-02-02 10:54:23,581 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 491 transitions. Word has length 172 [2018-02-02 10:54:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:23,581 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 491 transitions. [2018-02-02 10:54:23,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:54:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 491 transitions. [2018-02-02 10:54:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 10:54:23,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:23,583 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:23,583 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:23,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:23,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:23,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:54:23,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:23,924 INFO L182 omatonBuilderFactory]: Interpolants [16704#false, 16707#(= main_~i~0 0), 16708#(= main_~i~0 1), 16709#(= main_~i~0 2), 16710#(= main_~i~0 3), 16711#(= main_~i~0 4), 16712#(= main_~i~0 5), 16713#(= main_~i~0 6), 16714#(= main_~i~0 7), 16715#(= main_~i~0 8), 16716#(= main_~i~0 9), 16717#(= main_~i~0 10), 16718#(= main_~i~0 11), 16719#(= main_~i~0 12), 16720#(= main_~i~0 13), 16721#(= main_~i~0 14), 16722#(= main_~i~0 15), 16723#(= main_~i~0 16), 16724#(= main_~i~0 17), 16725#(= main_~i~0 18), 16726#(= main_~i~0 19), 16727#(= main_~i~0 20), 16728#(= main_~i~0 21), 16729#(= main_~i~0 22), 16730#(= main_~i~0 23), 16731#(= main_~i~0 24), 16732#(= main_~i~0 25), 16733#(= main_~i~0 26), 16734#(= main_~i~0 27), 16735#(= main_~i~0 28), 16736#(= main_~i~0 29), 16737#(= main_~i~0 30), 16738#(= main_~i~0 31), 16739#(= main_~i~0 32), 16740#(= main_~i~0 33), 16741#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 16703#true] [2018-02-02 10:54:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:23,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:54:23,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:54:23,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:54:23,925 INFO L87 Difference]: Start difference. First operand 424 states and 491 transitions. Second operand 37 states. [2018-02-02 10:54:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:26,634 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-02 10:54:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:54:26,634 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 177 [2018-02-02 10:54:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:26,635 INFO L225 Difference]: With dead ends: 470 [2018-02-02 10:54:26,635 INFO L226 Difference]: Without dead ends: 470 [2018-02-02 10:54:26,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:54:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-02 10:54:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 436. [2018-02-02 10:54:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 10:54:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 505 transitions. [2018-02-02 10:54:26,639 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 505 transitions. Word has length 177 [2018-02-02 10:54:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:26,640 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 505 transitions. [2018-02-02 10:54:26,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:54:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 505 transitions. [2018-02-02 10:54:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 10:54:26,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:26,641 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:26,641 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:26,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:27,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:27,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:54:27,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:27,044 INFO L182 omatonBuilderFactory]: Interpolants [17664#(= main_~i~0 12), 17665#(= main_~i~0 13), 17666#(= main_~i~0 14), 17667#(= main_~i~0 15), 17668#(= main_~i~0 16), 17669#(= main_~i~0 17), 17670#(= main_~i~0 18), 17671#(= main_~i~0 19), 17672#(= main_~i~0 20), 17673#(= main_~i~0 21), 17674#(= main_~i~0 22), 17675#(= main_~i~0 23), 17676#(= main_~i~0 24), 17677#(= main_~i~0 25), 17678#(= main_~i~0 26), 17679#(= main_~i~0 27), 17680#(= main_~i~0 28), 17681#(= main_~i~0 29), 17682#(= main_~i~0 30), 17683#(= main_~i~0 31), 17684#(= main_~i~0 32), 17685#(= main_~i~0 33), 17686#(= main_~i~0 34), 17687#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 17648#true, 17649#false, 17652#(= main_~i~0 0), 17653#(= main_~i~0 1), 17654#(= main_~i~0 2), 17655#(= main_~i~0 3), 17656#(= main_~i~0 4), 17657#(= main_~i~0 5), 17658#(= main_~i~0 6), 17659#(= main_~i~0 7), 17660#(= main_~i~0 8), 17661#(= main_~i~0 9), 17662#(= main_~i~0 10), 17663#(= main_~i~0 11)] [2018-02-02 10:54:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:27,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:54:27,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:54:27,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:54:27,045 INFO L87 Difference]: Start difference. First operand 436 states and 505 transitions. Second operand 38 states. [2018-02-02 10:54:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:29,891 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-02 10:54:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:54:29,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 182 [2018-02-02 10:54:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:29,892 INFO L225 Difference]: With dead ends: 483 [2018-02-02 10:54:29,892 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 10:54:29,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:54:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 10:54:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 448. [2018-02-02 10:54:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-02 10:54:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 519 transitions. [2018-02-02 10:54:29,896 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 519 transitions. Word has length 182 [2018-02-02 10:54:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:29,896 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 519 transitions. [2018-02-02 10:54:29,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:54:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 519 transitions. [2018-02-02 10:54:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:54:29,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:29,897 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:29,897 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:29,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:30,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:30,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 10:54:30,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:30,260 INFO L182 omatonBuilderFactory]: Interpolants [18624#(= main_~i~0 1), 18625#(= main_~i~0 2), 18626#(= main_~i~0 3), 18627#(= main_~i~0 4), 18628#(= main_~i~0 5), 18629#(= main_~i~0 6), 18630#(= main_~i~0 7), 18631#(= main_~i~0 8), 18632#(= main_~i~0 9), 18633#(= main_~i~0 10), 18634#(= main_~i~0 11), 18635#(= main_~i~0 12), 18636#(= main_~i~0 13), 18637#(= main_~i~0 14), 18638#(= main_~i~0 15), 18639#(= main_~i~0 16), 18640#(= main_~i~0 17), 18641#(= main_~i~0 18), 18642#(= main_~i~0 19), 18643#(= main_~i~0 20), 18644#(= main_~i~0 21), 18645#(= main_~i~0 22), 18646#(= main_~i~0 23), 18647#(= main_~i~0 24), 18648#(= main_~i~0 25), 18649#(= main_~i~0 26), 18650#(= main_~i~0 27), 18651#(= main_~i~0 28), 18652#(= main_~i~0 29), 18653#(= main_~i~0 30), 18654#(= main_~i~0 31), 18655#(= main_~i~0 32), 18656#(= main_~i~0 33), 18657#(= main_~i~0 34), 18658#(= main_~i~0 35), 18659#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 18619#true, 18620#false, 18623#(= main_~i~0 0)] [2018-02-02 10:54:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:30,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 10:54:30,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 10:54:30,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:54:30,261 INFO L87 Difference]: Start difference. First operand 448 states and 519 transitions. Second operand 39 states. [2018-02-02 10:54:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:33,330 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-02 10:54:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:54:33,330 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 187 [2018-02-02 10:54:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:33,331 INFO L225 Difference]: With dead ends: 496 [2018-02-02 10:54:33,332 INFO L226 Difference]: Without dead ends: 496 [2018-02-02 10:54:33,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 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-02-02 10:54:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-02 10:54:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 460. [2018-02-02 10:54:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 10:54:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 533 transitions. [2018-02-02 10:54:33,335 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 533 transitions. Word has length 187 [2018-02-02 10:54:33,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:33,335 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 533 transitions. [2018-02-02 10:54:33,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 10:54:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 533 transitions. [2018-02-02 10:54:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 10:54:33,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:33,336 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:33,336 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:33,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:33,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:33,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 10:54:33,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:33,729 INFO L182 omatonBuilderFactory]: Interpolants [19648#(= main_~i~0 28), 19649#(= main_~i~0 29), 19650#(= main_~i~0 30), 19651#(= main_~i~0 31), 19652#(= main_~i~0 32), 19653#(= main_~i~0 33), 19654#(= main_~i~0 34), 19655#(= main_~i~0 35), 19656#(= main_~i~0 36), 19657#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 19616#true, 19617#false, 19620#(= main_~i~0 0), 19621#(= main_~i~0 1), 19622#(= main_~i~0 2), 19623#(= main_~i~0 3), 19624#(= main_~i~0 4), 19625#(= main_~i~0 5), 19626#(= main_~i~0 6), 19627#(= main_~i~0 7), 19628#(= main_~i~0 8), 19629#(= main_~i~0 9), 19630#(= main_~i~0 10), 19631#(= main_~i~0 11), 19632#(= main_~i~0 12), 19633#(= main_~i~0 13), 19634#(= main_~i~0 14), 19635#(= main_~i~0 15), 19636#(= main_~i~0 16), 19637#(= main_~i~0 17), 19638#(= main_~i~0 18), 19639#(= main_~i~0 19), 19640#(= main_~i~0 20), 19641#(= main_~i~0 21), 19642#(= main_~i~0 22), 19643#(= main_~i~0 23), 19644#(= main_~i~0 24), 19645#(= main_~i~0 25), 19646#(= main_~i~0 26), 19647#(= main_~i~0 27)] [2018-02-02 10:54:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:33,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:54:33,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:54:33,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:54:33,730 INFO L87 Difference]: Start difference. First operand 460 states and 533 transitions. Second operand 40 states. [2018-02-02 10:54:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:36,881 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-02 10:54:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:54:36,881 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2018-02-02 10:54:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:36,882 INFO L225 Difference]: With dead ends: 509 [2018-02-02 10:54:36,882 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 10:54:36,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:54:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 10:54:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 472. [2018-02-02 10:54:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-02 10:54:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 547 transitions. [2018-02-02 10:54:36,886 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 547 transitions. Word has length 192 [2018-02-02 10:54:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:36,887 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 547 transitions. [2018-02-02 10:54:36,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:54:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 547 transitions. [2018-02-02 10:54:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 10:54:36,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:36,888 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:36,888 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:36,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:37,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:37,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 10:54:37,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:37,268 INFO L182 omatonBuilderFactory]: Interpolants [20672#(= main_~i~0 29), 20673#(= main_~i~0 30), 20674#(= main_~i~0 31), 20675#(= main_~i~0 32), 20676#(= main_~i~0 33), 20677#(= main_~i~0 34), 20678#(= main_~i~0 35), 20679#(= main_~i~0 36), 20680#(= main_~i~0 37), 20681#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 20639#true, 20640#false, 20643#(= main_~i~0 0), 20644#(= main_~i~0 1), 20645#(= main_~i~0 2), 20646#(= main_~i~0 3), 20647#(= main_~i~0 4), 20648#(= main_~i~0 5), 20649#(= main_~i~0 6), 20650#(= main_~i~0 7), 20651#(= main_~i~0 8), 20652#(= main_~i~0 9), 20653#(= main_~i~0 10), 20654#(= main_~i~0 11), 20655#(= main_~i~0 12), 20656#(= main_~i~0 13), 20657#(= main_~i~0 14), 20658#(= main_~i~0 15), 20659#(= main_~i~0 16), 20660#(= main_~i~0 17), 20661#(= main_~i~0 18), 20662#(= main_~i~0 19), 20663#(= main_~i~0 20), 20664#(= main_~i~0 21), 20665#(= main_~i~0 22), 20666#(= main_~i~0 23), 20667#(= main_~i~0 24), 20668#(= main_~i~0 25), 20669#(= main_~i~0 26), 20670#(= main_~i~0 27), 20671#(= main_~i~0 28)] [2018-02-02 10:54:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:37,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 10:54:37,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 10:54:37,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:54:37,269 INFO L87 Difference]: Start difference. First operand 472 states and 547 transitions. Second operand 41 states. [2018-02-02 10:54:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:40,555 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-02 10:54:40,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:54:40,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 197 [2018-02-02 10:54:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:40,556 INFO L225 Difference]: With dead ends: 522 [2018-02-02 10:54:40,556 INFO L226 Difference]: Without dead ends: 522 [2018-02-02 10:54:40,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:54:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-02 10:54:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 484. [2018-02-02 10:54:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-02-02 10:54:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 561 transitions. [2018-02-02 10:54:40,560 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 561 transitions. Word has length 197 [2018-02-02 10:54:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:40,560 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 561 transitions. [2018-02-02 10:54:40,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 10:54:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 561 transitions. [2018-02-02 10:54:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 10:54:40,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:40,561 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:40,561 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:40,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:40,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:40,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 10:54:40,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:40,962 INFO L182 omatonBuilderFactory]: Interpolants [21696#(= main_~i~0 4), 21697#(= main_~i~0 5), 21698#(= main_~i~0 6), 21699#(= main_~i~0 7), 21700#(= main_~i~0 8), 21701#(= main_~i~0 9), 21702#(= main_~i~0 10), 21703#(= main_~i~0 11), 21704#(= main_~i~0 12), 21705#(= main_~i~0 13), 21706#(= main_~i~0 14), 21707#(= main_~i~0 15), 21708#(= main_~i~0 16), 21709#(= main_~i~0 17), 21710#(= main_~i~0 18), 21711#(= main_~i~0 19), 21712#(= main_~i~0 20), 21713#(= main_~i~0 21), 21714#(= main_~i~0 22), 21715#(= main_~i~0 23), 21716#(= main_~i~0 24), 21717#(= main_~i~0 25), 21718#(= main_~i~0 26), 21719#(= main_~i~0 27), 21720#(= main_~i~0 28), 21721#(= main_~i~0 29), 21722#(= main_~i~0 30), 21723#(= main_~i~0 31), 21724#(= main_~i~0 32), 21725#(= main_~i~0 33), 21726#(= main_~i~0 34), 21727#(= main_~i~0 35), 21728#(= main_~i~0 36), 21729#(= main_~i~0 37), 21730#(= main_~i~0 38), 21731#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 21688#true, 21689#false, 21692#(= main_~i~0 0), 21693#(= main_~i~0 1), 21694#(= main_~i~0 2), 21695#(= main_~i~0 3)] [2018-02-02 10:54:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:40,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 10:54:40,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 10:54:40,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:54:40,963 INFO L87 Difference]: Start difference. First operand 484 states and 561 transitions. Second operand 42 states. [2018-02-02 10:54:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:44,314 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-02 10:54:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:54:44,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-02-02 10:54:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:44,315 INFO L225 Difference]: With dead ends: 535 [2018-02-02 10:54:44,315 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 10:54:44,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:54:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 10:54:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 496. [2018-02-02 10:54:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-02-02 10:54:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 575 transitions. [2018-02-02 10:54:44,319 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 575 transitions. Word has length 202 [2018-02-02 10:54:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:44,319 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 575 transitions. [2018-02-02 10:54:44,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 10:54:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 575 transitions. [2018-02-02 10:54:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 10:54:44,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:44,320 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:44,320 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:44,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:44,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:44,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:54:44,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:44,748 INFO L182 omatonBuilderFactory]: Interpolants [22784#(= main_~i~0 17), 22785#(= main_~i~0 18), 22786#(= main_~i~0 19), 22787#(= main_~i~0 20), 22788#(= main_~i~0 21), 22789#(= main_~i~0 22), 22790#(= main_~i~0 23), 22791#(= main_~i~0 24), 22792#(= main_~i~0 25), 22793#(= main_~i~0 26), 22794#(= main_~i~0 27), 22795#(= main_~i~0 28), 22796#(= main_~i~0 29), 22797#(= main_~i~0 30), 22798#(= main_~i~0 31), 22799#(= main_~i~0 32), 22800#(= main_~i~0 33), 22801#(= main_~i~0 34), 22802#(= main_~i~0 35), 22803#(= main_~i~0 36), 22804#(= main_~i~0 37), 22805#(= main_~i~0 38), 22806#(= main_~i~0 39), 22807#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 22763#true, 22764#false, 22767#(= main_~i~0 0), 22768#(= main_~i~0 1), 22769#(= main_~i~0 2), 22770#(= main_~i~0 3), 22771#(= main_~i~0 4), 22772#(= main_~i~0 5), 22773#(= main_~i~0 6), 22774#(= main_~i~0 7), 22775#(= main_~i~0 8), 22776#(= main_~i~0 9), 22777#(= main_~i~0 10), 22778#(= main_~i~0 11), 22779#(= main_~i~0 12), 22780#(= main_~i~0 13), 22781#(= main_~i~0 14), 22782#(= main_~i~0 15), 22783#(= main_~i~0 16)] [2018-02-02 10:54:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:44,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 10:54:44,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 10:54:44,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:54:44,749 INFO L87 Difference]: Start difference. First operand 496 states and 575 transitions. Second operand 43 states. [2018-02-02 10:54:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:48,327 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-02 10:54:48,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:54:48,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 207 [2018-02-02 10:54:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:48,328 INFO L225 Difference]: With dead ends: 548 [2018-02-02 10:54:48,328 INFO L226 Difference]: Without dead ends: 548 [2018-02-02 10:54:48,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:54:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-02 10:54:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 508. [2018-02-02 10:54:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 10:54:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 589 transitions. [2018-02-02 10:54:48,332 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 589 transitions. Word has length 207 [2018-02-02 10:54:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:48,332 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 589 transitions. [2018-02-02 10:54:48,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 10:54:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 589 transitions. [2018-02-02 10:54:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 10:54:48,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:48,337 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:48,337 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:54:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:48,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:48,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:48,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 10:54:48,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:48,781 INFO L182 omatonBuilderFactory]: Interpolants [23872#(= main_~i~0 4), 23873#(= main_~i~0 5), 23874#(= main_~i~0 6), 23875#(= main_~i~0 7), 23876#(= main_~i~0 8), 23877#(= main_~i~0 9), 23878#(= main_~i~0 10), 23879#(= main_~i~0 11), 23880#(= main_~i~0 12), 23881#(= main_~i~0 13), 23882#(= main_~i~0 14), 23883#(= main_~i~0 15), 23884#(= main_~i~0 16), 23885#(= main_~i~0 17), 23886#(= main_~i~0 18), 23887#(= main_~i~0 19), 23888#(= main_~i~0 20), 23889#(= main_~i~0 21), 23890#(= main_~i~0 22), 23891#(= main_~i~0 23), 23892#(= main_~i~0 24), 23893#(= main_~i~0 25), 23894#(= main_~i~0 26), 23895#(= main_~i~0 27), 23896#(= main_~i~0 28), 23897#(= main_~i~0 29), 23898#(= main_~i~0 30), 23899#(= main_~i~0 31), 23900#(= main_~i~0 32), 23901#(= main_~i~0 33), 23902#(= main_~i~0 34), 23903#(= main_~i~0 35), 23904#(= main_~i~0 36), 23905#(= main_~i~0 37), 23906#(= main_~i~0 38), 23907#(= main_~i~0 39), 23908#(= main_~i~0 40), 23909#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 23864#true, 23865#false, 23868#(= main_~i~0 0), 23869#(= main_~i~0 1), 23870#(= main_~i~0 2), 23871#(= main_~i~0 3)] [2018-02-02 10:54:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:54:48,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 10:54:48,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 10:54:48,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:54:48,782 INFO L87 Difference]: Start difference. First operand 508 states and 589 transitions. Second operand 44 states. Received shutdown request... [2018-02-02 10:54:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:54:49,428 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:54:49,432 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:54:49,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:54:49 BoogieIcfgContainer [2018-02-02 10:54:49,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:54:49,433 INFO L168 Benchmark]: Toolchain (without parser) took 65684.72 ms. Allocated memory was 396.9 MB in the beginning and 1.2 GB in the end (delta: 836.2 MB). Free memory was 354.6 MB in the beginning and 671.0 MB in the end (delta: -316.4 MB). Peak memory consumption was 519.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:54:49,434 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 396.9 MB. Free memory is still 360.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:54:49,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 115.18 ms. Allocated memory is still 396.9 MB. Free memory was 354.6 MB in the beginning and 346.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:54:49,434 INFO L168 Benchmark]: Boogie Preprocessor took 18.98 ms. Allocated memory is still 396.9 MB. Free memory was 346.5 MB in the beginning and 345.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:54:49,434 INFO L168 Benchmark]: RCFGBuilder took 136.80 ms. Allocated memory is still 396.9 MB. Free memory was 345.2 MB in the beginning and 332.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:54:49,434 INFO L168 Benchmark]: TraceAbstraction took 65410.95 ms. Allocated memory was 396.9 MB in the beginning and 1.2 GB in the end (delta: 836.2 MB). Free memory was 332.0 MB in the beginning and 671.0 MB in the end (delta: -339.1 MB). Peak memory consumption was 497.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:54:49,435 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 396.9 MB. Free memory is still 360.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 115.18 ms. Allocated memory is still 396.9 MB. Free memory was 354.6 MB in the beginning and 346.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.98 ms. Allocated memory is still 396.9 MB. Free memory was 346.5 MB in the beginning and 345.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 136.80 ms. Allocated memory is still 396.9 MB. Free memory was 345.2 MB in the beginning and 332.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65410.95 ms. Allocated memory was 396.9 MB in the beginning and 1.2 GB in the end (delta: 836.2 MB). Free memory was 332.0 MB in the beginning and 671.0 MB in the end (delta: -339.1 MB). Peak memory consumption was 497.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 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 (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 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 (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 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 (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 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 (508states) and interpolant automaton (currently 14 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (90 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 65.3s OverallTime, 42 OverallIterations, 42 TraceHistogramMax, 56.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4596 SDtfs, 8937 SDslu, 65661 SDs, 0 SdLazy, 270356 SolverSat, 3494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1029 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 903 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/59122 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 820 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 4599 NumberOfCodeBlocks, 4599 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4557 ConstructedInterpolants, 0 QuantifiedInterpolants, 1946091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 1 PerfectInterpolantSequences, 0/59122 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-54-49-443.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-54-49-443.csv Completed graceful shutdown