java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:55:36,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:55:36,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:55:36,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:55:36,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:55:36,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:55:36,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:55:36,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:55:36,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:55:36,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:55:36,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:55:36,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:55:36,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:55:36,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:55:36,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:55:36,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:55:36,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:55:36,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:55:36,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:55:36,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:55:36,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:55:36,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:55:36,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:55:36,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:55:36,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:55:36,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:55:36,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:55:36,487 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:55:36,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:55:36,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:55:36,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:55:36,488 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:55:36,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:55:36,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:55:36,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:55:36,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:55:36,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:55:36,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:55:36,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:55:36,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:55:36,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:55:36,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:55:36,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:55:36,501 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:55:36,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:36,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:55:36,541 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:55:36,546 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:55:36,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:55:36,548 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:55:36,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-02-04 20:55:36,643 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:55:36,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:55:36,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:55:36,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:55:36,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:55:36,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648adec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36, skipping insertion in model container [2018-02-04 20:55:36,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:55:36,676 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:55:36,762 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:55:36,770 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:55:36,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36 WrapperNode [2018-02-04 20:55:36,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:55:36,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:55:36,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:55:36,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:55:36,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... [2018-02-04 20:55:36,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:55:36,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:55:36,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:55:36,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:55:36,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:55:36,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:55:36,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:55:36,830 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 20:55:36,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:55:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:55:36,911 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:55:36,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:55:36 BoogieIcfgContainer [2018-02-04 20:55:36,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:55:36,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:55:36,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:55:36,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:55:36,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:55:36" (1/3) ... [2018-02-04 20:55:36,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5e5592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:55:36, skipping insertion in model container [2018-02-04 20:55:36,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:55:36" (2/3) ... [2018-02-04 20:55:36,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5e5592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:55:36, skipping insertion in model container [2018-02-04 20:55:36,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:55:36" (3/3) ... [2018-02-04 20:55:36,916 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-02-04 20:55:36,921 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:55:36,925 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-02-04 20:55:36,947 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:55:36,947 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:55:36,947 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:55:36,947 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:55:36,947 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:55:36,947 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:55:36,947 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:55:36,948 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:55:36,948 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:55:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-04 20:55:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 20:55:36,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:36,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:36,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1213833872, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:36,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:55:37,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:55:37,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,073 INFO L182 omatonBuilderFactory]: Interpolants [34#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 30#true, 31#false] [2018-02-04 20:55:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:55:37,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:55:37,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:55:37,095 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-02-04 20:55:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,160 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-02-04 20:55:37,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:55:37,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 20:55:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,167 INFO L225 Difference]: With dead ends: 32 [2018-02-04 20:55:37,167 INFO L226 Difference]: Without dead ends: 22 [2018-02-04 20:55:37,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:55:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-04 20:55:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-04 20:55:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-04 20:55:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-02-04 20:55:37,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 8 [2018-02-04 20:55:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,190 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-02-04 20:55:37,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:55:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-02-04 20:55:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 20:55:37,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,191 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,191 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1723583497, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:37,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 20:55:37,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,231 INFO L182 omatonBuilderFactory]: Interpolants [89#true, 90#false, 93#(= main_~i~0 0), 94#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:55:37,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:55:37,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 20:55:37,233 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2018-02-04 20:55:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,285 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-04 20:55:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:55:37,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 20:55:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,287 INFO L225 Difference]: With dead ends: 31 [2018-02-04 20:55:37,287 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 20:55:37,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 20:55:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 20:55:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 20:55:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 20:55:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 20:55:37,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-02-04 20:55:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,291 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 20:55:37,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:55:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 20:55:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 20:55:37,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,292 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,292 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -863334142, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:37,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 20:55:37,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,357 INFO L182 omatonBuilderFactory]: Interpolants [161#(= main_~i~0 0), 162#(= main_~i~0 1), 163#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 157#true, 158#false] [2018-02-04 20:55:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 20:55:37,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 20:55:37,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 20:55:37,357 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-02-04 20:55:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,454 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-02-04 20:55:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 20:55:37,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 20:55:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,455 INFO L225 Difference]: With dead ends: 40 [2018-02-04 20:55:37,455 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 20:55:37,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 20:55:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 20:55:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 20:55:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 20:55:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-04 20:55:37,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 16 [2018-02-04 20:55:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,460 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-04 20:55:37,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 20:55:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-04 20:55:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 20:55:37,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,461 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,461 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1930178939, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:37,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 20:55:37,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,513 INFO L182 omatonBuilderFactory]: Interpolants [244#true, 245#false, 248#(= main_~i~0 0), 249#(= main_~i~0 1), 250#(= main_~i~0 2), 251#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 20:55:37,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 20:55:37,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 20:55:37,513 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2018-02-04 20:55:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,572 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 20:55:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 20:55:37,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 20:55:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,573 INFO L225 Difference]: With dead ends: 49 [2018-02-04 20:55:37,573 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 20:55:37,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 20:55:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 20:55:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 20:55:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 20:55:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 20:55:37,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 20 [2018-02-04 20:55:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,577 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 20:55:37,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 20:55:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 20:55:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 20:55:37,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,578 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,578 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash -966333068, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:37,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 20:55:37,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,634 INFO L182 omatonBuilderFactory]: Interpolants [354#(= main_~i~0 0), 355#(= main_~i~0 1), 356#(= main_~i~0 2), 357#(= main_~i~0 3), 358#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 350#true, 351#false] [2018-02-04 20:55:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 20:55:37,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 20:55:37,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 20:55:37,635 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 7 states. [2018-02-04 20:55:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,746 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-02-04 20:55:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:55:37,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 20:55:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,747 INFO L225 Difference]: With dead ends: 58 [2018-02-04 20:55:37,747 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 20:55:37,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 20:55:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 20:55:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 20:55:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 20:55:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-02-04 20:55:37,750 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 24 [2018-02-04 20:55:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,750 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-02-04 20:55:37,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 20:55:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-02-04 20:55:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 20:55:37,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,752 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,752 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash 899745005, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:37,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 20:55:37,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,803 INFO L182 omatonBuilderFactory]: Interpolants [480#(= main_~i~0 1), 481#(= main_~i~0 2), 482#(= main_~i~0 3), 483#(= main_~i~0 4), 484#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 475#true, 476#false, 479#(= main_~i~0 0)] [2018-02-04 20:55:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:37,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 20:55:37,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 20:55:37,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 20:55:37,803 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 8 states. [2018-02-04 20:55:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:37,922 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 20:55:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 20:55:37,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 20:55:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:37,923 INFO L225 Difference]: With dead ends: 67 [2018-02-04 20:55:37,923 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 20:55:37,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 20:55:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 20:55:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 20:55:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 20:55:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-02-04 20:55:37,932 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 28 [2018-02-04 20:55:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:37,932 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-02-04 20:55:37,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 20:55:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-02-04 20:55:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 20:55:37,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:37,933 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:37,933 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1029654554, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:37,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:38,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 20:55:38,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,007 INFO L182 omatonBuilderFactory]: Interpolants [624#(= main_~i~0 1), 625#(= main_~i~0 2), 626#(= main_~i~0 3), 627#(= main_~i~0 4), 628#(= main_~i~0 5), 629#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 619#true, 620#false, 623#(= main_~i~0 0)] [2018-02-04 20:55:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:55:38,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:55:38,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:55:38,008 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 9 states. [2018-02-04 20:55:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:38,147 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-02-04 20:55:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 20:55:38,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 20:55:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:38,148 INFO L225 Difference]: With dead ends: 76 [2018-02-04 20:55:38,148 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 20:55:38,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:55:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 20:55:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 20:55:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 20:55:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 20:55:38,153 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 32 [2018-02-04 20:55:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:38,153 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 20:55:38,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:55:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 20:55:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 20:55:38,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:38,155 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:38,155 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1842592161, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:38,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:38,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 20:55:38,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,233 INFO L182 omatonBuilderFactory]: Interpolants [786#(= main_~i~0 0), 787#(= main_~i~0 1), 788#(= main_~i~0 2), 789#(= main_~i~0 3), 790#(= main_~i~0 4), 791#(= main_~i~0 5), 792#(= main_~i~0 6), 793#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 782#true, 783#false] [2018-02-04 20:55:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 20:55:38,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 20:55:38,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:55:38,234 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 10 states. [2018-02-04 20:55:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:38,338 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-02-04 20:55:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:55:38,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-04 20:55:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:38,340 INFO L225 Difference]: With dead ends: 85 [2018-02-04 20:55:38,340 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 20:55:38,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:55:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 20:55:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 20:55:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 20:55:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 20:55:38,345 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 36 [2018-02-04 20:55:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:38,345 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 20:55:38,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 20:55:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 20:55:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 20:55:38,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:38,346 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:38,346 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2078928984, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:38,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:38,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:55:38,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,417 INFO L182 omatonBuilderFactory]: Interpolants [976#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 964#true, 965#false, 968#(= main_~i~0 0), 969#(= main_~i~0 1), 970#(= main_~i~0 2), 971#(= main_~i~0 3), 972#(= main_~i~0 4), 973#(= main_~i~0 5), 974#(= main_~i~0 6), 975#(= main_~i~0 7)] [2018-02-04 20:55:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:55:38,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:55:38,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:55:38,417 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 11 states. [2018-02-04 20:55:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:38,556 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-02-04 20:55:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 20:55:38,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-04 20:55:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:38,557 INFO L225 Difference]: With dead ends: 94 [2018-02-04 20:55:38,557 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 20:55:38,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:55:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 20:55:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 20:55:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 20:55:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-02-04 20:55:38,560 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 40 [2018-02-04 20:55:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:38,560 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-02-04 20:55:38,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:55:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-02-04 20:55:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 20:55:38,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:38,561 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:38,561 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1704987183, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:38,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:38,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 20:55:38,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,636 INFO L182 omatonBuilderFactory]: Interpolants [1169#(= main_~i~0 0), 1170#(= main_~i~0 1), 1171#(= main_~i~0 2), 1172#(= main_~i~0 3), 1173#(= main_~i~0 4), 1174#(= main_~i~0 5), 1175#(= main_~i~0 6), 1176#(= main_~i~0 7), 1177#(= main_~i~0 8), 1178#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1165#true, 1166#false] [2018-02-04 20:55:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:55:38,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:55:38,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:55:38,637 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-02-04 20:55:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:38,797 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-02-04 20:55:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 20:55:38,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-02-04 20:55:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:38,798 INFO L225 Difference]: With dead ends: 103 [2018-02-04 20:55:38,798 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 20:55:38,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:55:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 20:55:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-04 20:55:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 20:55:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 20:55:38,801 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 44 [2018-02-04 20:55:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:38,801 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 20:55:38,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:55:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 20:55:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 20:55:38,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:38,802 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:38,802 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash -621504822, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:38,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:38,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:55:38,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,871 INFO L182 omatonBuilderFactory]: Interpolants [1385#true, 1386#false, 1389#(= main_~i~0 0), 1390#(= main_~i~0 1), 1391#(= main_~i~0 2), 1392#(= main_~i~0 3), 1393#(= main_~i~0 4), 1394#(= main_~i~0 5), 1395#(= main_~i~0 6), 1396#(= main_~i~0 7), 1397#(= main_~i~0 8), 1398#(= main_~i~0 9), 1399#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:38,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:55:38,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:55:38,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:55:38,872 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 13 states. [2018-02-04 20:55:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:39,156 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-02-04 20:55:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 20:55:39,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 20:55:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:39,157 INFO L225 Difference]: With dead ends: 112 [2018-02-04 20:55:39,157 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 20:55:39,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:55:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 20:55:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 20:55:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 20:55:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-02-04 20:55:39,162 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 48 [2018-02-04 20:55:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:39,162 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-02-04 20:55:39,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:55:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-02-04 20:55:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 20:55:39,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:39,164 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:39,164 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1913777341, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:39,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:39,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:55:39,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,282 INFO L182 omatonBuilderFactory]: Interpolants [1632#(= main_~i~0 4), 1633#(= main_~i~0 5), 1634#(= main_~i~0 6), 1635#(= main_~i~0 7), 1636#(= main_~i~0 8), 1637#(= main_~i~0 9), 1638#(= main_~i~0 10), 1639#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1624#true, 1625#false, 1628#(= main_~i~0 0), 1629#(= main_~i~0 1), 1630#(= main_~i~0 2), 1631#(= main_~i~0 3)] [2018-02-04 20:55:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:55:39,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:55:39,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:55:39,283 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 14 states. [2018-02-04 20:55:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:39,580 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-02-04 20:55:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:55:39,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-04 20:55:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:39,581 INFO L225 Difference]: With dead ends: 121 [2018-02-04 20:55:39,581 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 20:55:39,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:55:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 20:55:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 20:55:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 20:55:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-02-04 20:55:39,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 52 [2018-02-04 20:55:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:39,587 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-02-04 20:55:39,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:55:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-02-04 20:55:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 20:55:39,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:39,588 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:39,591 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash -160257220, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:39,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:39,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:55:39,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,742 INFO L182 omatonBuilderFactory]: Interpolants [1888#(= main_~i~0 2), 1889#(= main_~i~0 3), 1890#(= main_~i~0 4), 1891#(= main_~i~0 5), 1892#(= main_~i~0 6), 1893#(= main_~i~0 7), 1894#(= main_~i~0 8), 1895#(= main_~i~0 9), 1896#(= main_~i~0 10), 1897#(= main_~i~0 11), 1898#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1882#true, 1883#false, 1886#(= main_~i~0 0), 1887#(= main_~i~0 1)] [2018-02-04 20:55:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:39,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:55:39,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:55:39,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:55:39,743 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 15 states. [2018-02-04 20:55:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:40,053 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2018-02-04 20:55:40,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 20:55:40,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 20:55:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:40,054 INFO L225 Difference]: With dead ends: 130 [2018-02-04 20:55:40,054 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 20:55:40,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:55:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 20:55:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-04 20:55:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 20:55:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-02-04 20:55:40,059 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 56 [2018-02-04 20:55:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:40,059 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-02-04 20:55:40,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:55:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-02-04 20:55:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 20:55:40,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:40,060 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:40,060 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash -628580683, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:40,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:40,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:55:40,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,160 INFO L182 omatonBuilderFactory]: Interpolants [2176#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2159#true, 2160#false, 2163#(= main_~i~0 0), 2164#(= main_~i~0 1), 2165#(= main_~i~0 2), 2166#(= main_~i~0 3), 2167#(= main_~i~0 4), 2168#(= main_~i~0 5), 2169#(= main_~i~0 6), 2170#(= main_~i~0 7), 2171#(= main_~i~0 8), 2172#(= main_~i~0 9), 2173#(= main_~i~0 10), 2174#(= main_~i~0 11), 2175#(= main_~i~0 12)] [2018-02-04 20:55:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:55:40,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:55:40,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:55:40,161 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 16 states. [2018-02-04 20:55:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:40,443 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-04 20:55:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:55:40,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-04 20:55:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:40,444 INFO L225 Difference]: With dead ends: 139 [2018-02-04 20:55:40,444 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 20:55:40,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:55:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 20:55:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-04 20:55:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 20:55:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-02-04 20:55:40,448 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 60 [2018-02-04 20:55:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:40,448 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-02-04 20:55:40,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:55:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-02-04 20:55:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 20:55:40,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:40,449 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:40,449 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 320220590, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:40,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:40,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:55:40,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,538 INFO L182 omatonBuilderFactory]: Interpolants [2464#(= main_~i~0 5), 2465#(= main_~i~0 6), 2466#(= main_~i~0 7), 2467#(= main_~i~0 8), 2468#(= main_~i~0 9), 2469#(= main_~i~0 10), 2470#(= main_~i~0 11), 2471#(= main_~i~0 12), 2472#(= main_~i~0 13), 2473#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2455#true, 2456#false, 2459#(= main_~i~0 0), 2460#(= main_~i~0 1), 2461#(= main_~i~0 2), 2462#(= main_~i~0 3), 2463#(= main_~i~0 4)] [2018-02-04 20:55:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:55:40,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:55:40,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:55:40,539 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 17 states. [2018-02-04 20:55:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:40,845 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2018-02-04 20:55:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 20:55:40,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-02-04 20:55:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:40,845 INFO L225 Difference]: With dead ends: 148 [2018-02-04 20:55:40,845 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 20:55:40,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:55:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 20:55:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-04 20:55:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 20:55:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-02-04 20:55:40,848 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 64 [2018-02-04 20:55:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:40,848 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-02-04 20:55:40,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:55:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-02-04 20:55:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 20:55:40,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:40,849 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:40,849 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 467769383, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:40,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:40,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:55:40,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,982 INFO L182 omatonBuilderFactory]: Interpolants [2784#(= main_~i~0 10), 2785#(= main_~i~0 11), 2786#(= main_~i~0 12), 2787#(= main_~i~0 13), 2788#(= main_~i~0 14), 2789#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2770#true, 2771#false, 2774#(= main_~i~0 0), 2775#(= main_~i~0 1), 2776#(= main_~i~0 2), 2777#(= main_~i~0 3), 2778#(= main_~i~0 4), 2779#(= main_~i~0 5), 2780#(= main_~i~0 6), 2781#(= main_~i~0 7), 2782#(= main_~i~0 8), 2783#(= main_~i~0 9)] [2018-02-04 20:55:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:40,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:55:40,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:55:40,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:55:40,983 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 18 states. [2018-02-04 20:55:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:41,380 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-02-04 20:55:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:55:41,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-02-04 20:55:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:41,381 INFO L225 Difference]: With dead ends: 157 [2018-02-04 20:55:41,381 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 20:55:41,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:55:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 20:55:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-02-04 20:55:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 20:55:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-02-04 20:55:41,383 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 68 [2018-02-04 20:55:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:41,384 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-02-04 20:55:41,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:55:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-02-04 20:55:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 20:55:41,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:41,385 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:41,385 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770656, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:41,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:41,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:41,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:55:41,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:41,491 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3108#(= main_~i~0 0), 3109#(= main_~i~0 1), 3110#(= main_~i~0 2), 3111#(= main_~i~0 3), 3112#(= main_~i~0 4), 3113#(= main_~i~0 5), 3114#(= main_~i~0 6), 3115#(= main_~i~0 7), 3116#(= main_~i~0 8), 3117#(= main_~i~0 9), 3118#(= main_~i~0 10), 3119#(= main_~i~0 11), 3120#(= main_~i~0 12), 3121#(= main_~i~0 13), 3122#(= main_~i~0 14), 3123#(= main_~i~0 15), 3124#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:41,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:55:41,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:55:41,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:55:41,492 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 19 states. [2018-02-04 20:55:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:41,901 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2018-02-04 20:55:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:55:41,901 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-02-04 20:55:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:41,902 INFO L225 Difference]: With dead ends: 166 [2018-02-04 20:55:41,902 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 20:55:41,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:55:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 20:55:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 20:55:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 20:55:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-02-04 20:55:41,904 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 72 [2018-02-04 20:55:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:41,904 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-02-04 20:55:41,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:55:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-02-04 20:55:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 20:55:41,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:41,905 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:41,905 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 464191385, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:41,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:42,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:55:42,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,027 INFO L182 omatonBuilderFactory]: Interpolants [3457#true, 3458#false, 3461#(= main_~i~0 0), 3462#(= main_~i~0 1), 3463#(= main_~i~0 2), 3464#(= main_~i~0 3), 3465#(= main_~i~0 4), 3466#(= main_~i~0 5), 3467#(= main_~i~0 6), 3468#(= main_~i~0 7), 3469#(= main_~i~0 8), 3470#(= main_~i~0 9), 3471#(= main_~i~0 10), 3472#(= main_~i~0 11), 3473#(= main_~i~0 12), 3474#(= main_~i~0 13), 3475#(= main_~i~0 14), 3476#(= main_~i~0 15), 3477#(= main_~i~0 16), 3478#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:55:42,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:55:42,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:55:42,028 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 20 states. [2018-02-04 20:55:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:42,489 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-02-04 20:55:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:55:42,490 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2018-02-04 20:55:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:42,490 INFO L225 Difference]: With dead ends: 175 [2018-02-04 20:55:42,490 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 20:55:42,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:55:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 20:55:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-04 20:55:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 20:55:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 20:55:42,492 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 76 [2018-02-04 20:55:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:42,492 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 20:55:42,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:55:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 20:55:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 20:55:42,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:42,493 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:42,493 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1217756306, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:42,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:42,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:55:42,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,606 INFO L182 omatonBuilderFactory]: Interpolants [3840#(= main_~i~0 7), 3841#(= main_~i~0 8), 3842#(= main_~i~0 9), 3843#(= main_~i~0 10), 3844#(= main_~i~0 11), 3845#(= main_~i~0 12), 3846#(= main_~i~0 13), 3847#(= main_~i~0 14), 3848#(= main_~i~0 15), 3849#(= main_~i~0 16), 3850#(= main_~i~0 17), 3851#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 3829#true, 3830#false, 3833#(= main_~i~0 0), 3834#(= main_~i~0 1), 3835#(= main_~i~0 2), 3836#(= main_~i~0 3), 3837#(= main_~i~0 4), 3838#(= main_~i~0 5), 3839#(= main_~i~0 6)] [2018-02-04 20:55:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:42,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:55:42,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:55:42,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:55:42,607 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 21 states. [2018-02-04 20:55:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:43,076 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2018-02-04 20:55:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:55:43,076 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-02-04 20:55:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:43,077 INFO L225 Difference]: With dead ends: 184 [2018-02-04 20:55:43,077 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 20:55:43,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:55:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 20:55:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-02-04 20:55:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 20:55:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-02-04 20:55:43,079 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 80 [2018-02-04 20:55:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:43,079 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-02-04 20:55:43,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:55:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-02-04 20:55:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 20:55:43,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:43,080 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:43,080 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash -778644213, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:43,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:43,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:55:43,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,198 INFO L182 omatonBuilderFactory]: Interpolants [4224#(= main_~i~0 0), 4225#(= main_~i~0 1), 4226#(= main_~i~0 2), 4227#(= main_~i~0 3), 4228#(= main_~i~0 4), 4229#(= main_~i~0 5), 4230#(= main_~i~0 6), 4231#(= main_~i~0 7), 4232#(= main_~i~0 8), 4233#(= main_~i~0 9), 4234#(= main_~i~0 10), 4235#(= main_~i~0 11), 4236#(= main_~i~0 12), 4237#(= main_~i~0 13), 4238#(= main_~i~0 14), 4239#(= main_~i~0 15), 4240#(= main_~i~0 16), 4241#(= main_~i~0 17), 4242#(= main_~i~0 18), 4243#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 4220#true, 4221#false] [2018-02-04 20:55:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:55:43,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:55:43,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:55:43,199 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 22 states. [2018-02-04 20:55:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:43,743 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-02-04 20:55:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:55:43,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-02-04 20:55:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:43,744 INFO L225 Difference]: With dead ends: 193 [2018-02-04 20:55:43,744 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 20:55:43,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:55:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 20:55:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 20:55:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 20:55:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-02-04 20:55:43,747 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 84 [2018-02-04 20:55:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:43,747 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-02-04 20:55:43,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:55:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-02-04 20:55:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 20:55:43,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:43,748 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:43,748 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash -791328508, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:43,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:43,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:55:43,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,904 INFO L182 omatonBuilderFactory]: Interpolants [4640#(= main_~i~0 6), 4641#(= main_~i~0 7), 4642#(= main_~i~0 8), 4643#(= main_~i~0 9), 4644#(= main_~i~0 10), 4645#(= main_~i~0 11), 4646#(= main_~i~0 12), 4647#(= main_~i~0 13), 4648#(= main_~i~0 14), 4649#(= main_~i~0 15), 4650#(= main_~i~0 16), 4651#(= main_~i~0 17), 4652#(= main_~i~0 18), 4653#(= main_~i~0 19), 4654#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 4630#true, 4631#false, 4634#(= main_~i~0 0), 4635#(= main_~i~0 1), 4636#(= main_~i~0 2), 4637#(= main_~i~0 3), 4638#(= main_~i~0 4), 4639#(= main_~i~0 5)] [2018-02-04 20:55:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:43,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 20:55:43,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 20:55:43,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:55:43,905 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 23 states. [2018-02-04 20:55:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:44,574 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-02-04 20:55:44,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:55:44,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-02-04 20:55:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:44,574 INFO L225 Difference]: With dead ends: 202 [2018-02-04 20:55:44,575 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 20:55:44,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:55:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 20:55:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-04 20:55:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 20:55:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-02-04 20:55:44,578 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 88 [2018-02-04 20:55:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:44,578 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-02-04 20:55:44,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 20:55:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-02-04 20:55:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 20:55:44,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:44,579 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:44,579 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1666652285, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:44,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:44,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:44,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 20:55:44,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:44,783 INFO L182 omatonBuilderFactory]: Interpolants [5059#true, 5060#false, 5063#(= main_~i~0 0), 5064#(= main_~i~0 1), 5065#(= main_~i~0 2), 5066#(= main_~i~0 3), 5067#(= main_~i~0 4), 5068#(= main_~i~0 5), 5069#(= main_~i~0 6), 5070#(= main_~i~0 7), 5071#(= main_~i~0 8), 5072#(= main_~i~0 9), 5073#(= main_~i~0 10), 5074#(= main_~i~0 11), 5075#(= main_~i~0 12), 5076#(= main_~i~0 13), 5077#(= main_~i~0 14), 5078#(= main_~i~0 15), 5079#(= main_~i~0 16), 5080#(= main_~i~0 17), 5081#(= main_~i~0 18), 5082#(= main_~i~0 19), 5083#(= main_~i~0 20), 5084#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:44,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 20:55:44,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 20:55:44,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:55:44,785 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 24 states. [2018-02-04 20:55:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:45,482 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-04 20:55:45,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 20:55:45,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 92 [2018-02-04 20:55:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:45,483 INFO L225 Difference]: With dead ends: 211 [2018-02-04 20:55:45,483 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 20:55:45,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:55:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 20:55:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-02-04 20:55:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 20:55:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-02-04 20:55:45,488 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 92 [2018-02-04 20:55:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:45,488 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-02-04 20:55:45,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 20:55:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-02-04 20:55:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 20:55:45,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:45,488 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:45,489 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash 956466038, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:45,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:45,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:45,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 20:55:45,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:45,678 INFO L182 omatonBuilderFactory]: Interpolants [5507#true, 5508#false, 5511#(= main_~i~0 0), 5512#(= main_~i~0 1), 5513#(= main_~i~0 2), 5514#(= main_~i~0 3), 5515#(= main_~i~0 4), 5516#(= main_~i~0 5), 5517#(= main_~i~0 6), 5518#(= main_~i~0 7), 5519#(= main_~i~0 8), 5520#(= main_~i~0 9), 5521#(= main_~i~0 10), 5522#(= main_~i~0 11), 5523#(= main_~i~0 12), 5524#(= main_~i~0 13), 5525#(= main_~i~0 14), 5526#(= main_~i~0 15), 5527#(= main_~i~0 16), 5528#(= main_~i~0 17), 5529#(= main_~i~0 18), 5530#(= main_~i~0 19), 5531#(= main_~i~0 20), 5532#(= main_~i~0 21), 5533#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:45,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 20:55:45,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 20:55:45,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:55:45,679 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 25 states. [2018-02-04 20:55:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:46,447 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2018-02-04 20:55:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:55:46,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2018-02-04 20:55:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:46,447 INFO L225 Difference]: With dead ends: 220 [2018-02-04 20:55:46,447 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 20:55:46,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:55:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 20:55:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-04 20:55:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 20:55:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-02-04 20:55:46,451 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 96 [2018-02-04 20:55:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:46,452 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-02-04 20:55:46,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 20:55:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-02-04 20:55:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 20:55:46,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:46,452 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:46,452 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash 614320623, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:46,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:46,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:46,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 20:55:46,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:46,640 INFO L182 omatonBuilderFactory]: Interpolants [5974#true, 5975#false, 5978#(= main_~i~0 0), 5979#(= main_~i~0 1), 5980#(= main_~i~0 2), 5981#(= main_~i~0 3), 5982#(= main_~i~0 4), 5983#(= main_~i~0 5), 5984#(= main_~i~0 6), 5985#(= main_~i~0 7), 5986#(= main_~i~0 8), 5987#(= main_~i~0 9), 5988#(= main_~i~0 10), 5989#(= main_~i~0 11), 5990#(= main_~i~0 12), 5991#(= main_~i~0 13), 5992#(= main_~i~0 14), 5993#(= main_~i~0 15), 5994#(= main_~i~0 16), 5995#(= main_~i~0 17), 5996#(= main_~i~0 18), 5997#(= main_~i~0 19), 5998#(= main_~i~0 20), 5999#(= main_~i~0 21), 6000#(= main_~i~0 22), 6001#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:46,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 20:55:46,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 20:55:46,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:55:46,641 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 26 states. [2018-02-04 20:55:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:47,465 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-02-04 20:55:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:55:47,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 100 [2018-02-04 20:55:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:47,466 INFO L225 Difference]: With dead ends: 229 [2018-02-04 20:55:47,466 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 20:55:47,467 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-04 20:55:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 20:55:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-02-04 20:55:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 20:55:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-02-04 20:55:47,470 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 100 [2018-02-04 20:55:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:47,471 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-02-04 20:55:47,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 20:55:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-02-04 20:55:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 20:55:47,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:47,472 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:47,472 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1412486168, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:47,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:47,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:47,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 20:55:47,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:47,778 INFO L182 omatonBuilderFactory]: Interpolants [6464#(= main_~i~0 0), 6465#(= main_~i~0 1), 6466#(= main_~i~0 2), 6467#(= main_~i~0 3), 6468#(= main_~i~0 4), 6469#(= main_~i~0 5), 6470#(= main_~i~0 6), 6471#(= main_~i~0 7), 6472#(= main_~i~0 8), 6473#(= main_~i~0 9), 6474#(= main_~i~0 10), 6475#(= main_~i~0 11), 6476#(= main_~i~0 12), 6477#(= main_~i~0 13), 6478#(= main_~i~0 14), 6479#(= main_~i~0 15), 6480#(= main_~i~0 16), 6481#(= main_~i~0 17), 6482#(= main_~i~0 18), 6483#(= main_~i~0 19), 6484#(= main_~i~0 20), 6485#(= main_~i~0 21), 6486#(= main_~i~0 22), 6487#(= main_~i~0 23), 6488#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 6460#true, 6461#false] [2018-02-04 20:55:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:47,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 20:55:47,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 20:55:47,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 20:55:47,779 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 27 states. [2018-02-04 20:55:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:48,678 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2018-02-04 20:55:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:55:48,678 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2018-02-04 20:55:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:48,679 INFO L225 Difference]: With dead ends: 238 [2018-02-04 20:55:48,679 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 20:55:48,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 20:55:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 20:55:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 20:55:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 20:55:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-02-04 20:55:48,681 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 104 [2018-02-04 20:55:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:48,682 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-02-04 20:55:48,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 20:55:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-02-04 20:55:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 20:55:48,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:48,682 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:48,682 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1759712927, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:48,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:48,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:48,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 20:55:48,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:48,940 INFO L182 omatonBuilderFactory]: Interpolants [6976#(= main_~i~0 7), 6977#(= main_~i~0 8), 6978#(= main_~i~0 9), 6979#(= main_~i~0 10), 6980#(= main_~i~0 11), 6981#(= main_~i~0 12), 6982#(= main_~i~0 13), 6983#(= main_~i~0 14), 6984#(= main_~i~0 15), 6985#(= main_~i~0 16), 6986#(= main_~i~0 17), 6987#(= main_~i~0 18), 6988#(= main_~i~0 19), 6989#(= main_~i~0 20), 6990#(= main_~i~0 21), 6991#(= main_~i~0 22), 6992#(= main_~i~0 23), 6993#(= main_~i~0 24), 6994#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 6965#true, 6966#false, 6969#(= main_~i~0 0), 6970#(= main_~i~0 1), 6971#(= main_~i~0 2), 6972#(= main_~i~0 3), 6973#(= main_~i~0 4), 6974#(= main_~i~0 5), 6975#(= main_~i~0 6)] [2018-02-04 20:55:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:48,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 20:55:48,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 20:55:48,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:55:48,941 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 28 states. [2018-02-04 20:55:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:50,259 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-02-04 20:55:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:55:50,259 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2018-02-04 20:55:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:50,260 INFO L225 Difference]: With dead ends: 247 [2018-02-04 20:55:50,260 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 20:55:50,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:55:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 20:55:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-02-04 20:55:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 20:55:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-04 20:55:50,263 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 108 [2018-02-04 20:55:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:50,263 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-04 20:55:50,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 20:55:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-04 20:55:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 20:55:50,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:50,264 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:50,264 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:50,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2115157414, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:50,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:50,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:50,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 20:55:50,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:50,545 INFO L182 omatonBuilderFactory]: Interpolants [7489#true, 7490#false, 7493#(= main_~i~0 0), 7494#(= main_~i~0 1), 7495#(= main_~i~0 2), 7496#(= main_~i~0 3), 7497#(= main_~i~0 4), 7498#(= main_~i~0 5), 7499#(= main_~i~0 6), 7500#(= main_~i~0 7), 7501#(= main_~i~0 8), 7502#(= main_~i~0 9), 7503#(= main_~i~0 10), 7504#(= main_~i~0 11), 7505#(= main_~i~0 12), 7506#(= main_~i~0 13), 7507#(= main_~i~0 14), 7508#(= main_~i~0 15), 7509#(= main_~i~0 16), 7510#(= main_~i~0 17), 7511#(= main_~i~0 18), 7512#(= main_~i~0 19), 7513#(= main_~i~0 20), 7514#(= main_~i~0 21), 7515#(= main_~i~0 22), 7516#(= main_~i~0 23), 7517#(= main_~i~0 24), 7518#(= main_~i~0 25), 7519#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:50,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 20:55:50,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 20:55:50,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 20:55:50,546 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 29 states. [2018-02-04 20:55:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:51,579 INFO L93 Difference]: Finished difference Result 256 states and 257 transitions. [2018-02-04 20:55:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:55:51,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2018-02-04 20:55:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:51,580 INFO L225 Difference]: With dead ends: 256 [2018-02-04 20:55:51,580 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 20:55:51,580 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-04 20:55:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 20:55:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-02-04 20:55:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 20:55:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-02-04 20:55:51,583 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 112 [2018-02-04 20:55:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:51,584 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-02-04 20:55:51,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 20:55:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-02-04 20:55:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 20:55:51,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:51,584 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:51,584 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1787197139, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:51,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:51,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:51,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 20:55:51,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:51,814 INFO L182 omatonBuilderFactory]: Interpolants [8032#true, 8033#false, 8036#(= main_~i~0 0), 8037#(= main_~i~0 1), 8038#(= main_~i~0 2), 8039#(= main_~i~0 3), 8040#(= main_~i~0 4), 8041#(= main_~i~0 5), 8042#(= main_~i~0 6), 8043#(= main_~i~0 7), 8044#(= main_~i~0 8), 8045#(= main_~i~0 9), 8046#(= main_~i~0 10), 8047#(= main_~i~0 11), 8048#(= main_~i~0 12), 8049#(= main_~i~0 13), 8050#(= main_~i~0 14), 8051#(= main_~i~0 15), 8052#(= main_~i~0 16), 8053#(= main_~i~0 17), 8054#(= main_~i~0 18), 8055#(= main_~i~0 19), 8056#(= main_~i~0 20), 8057#(= main_~i~0 21), 8058#(= main_~i~0 22), 8059#(= main_~i~0 23), 8060#(= main_~i~0 24), 8061#(= main_~i~0 25), 8062#(= main_~i~0 26), 8063#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:51,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 20:55:51,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 20:55:51,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:55:51,815 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 30 states. [2018-02-04 20:55:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:52,981 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-02-04 20:55:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:55:52,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 116 [2018-02-04 20:55:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:52,982 INFO L225 Difference]: With dead ends: 265 [2018-02-04 20:55:52,982 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 20:55:52,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:55:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 20:55:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-02-04 20:55:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 20:55:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-02-04 20:55:52,985 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 116 [2018-02-04 20:55:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:52,985 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-02-04 20:55:52,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 20:55:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-02-04 20:55:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 20:55:52,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:52,985 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:52,986 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1108264652, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:52,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:53,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:53,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 20:55:53,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:53,225 INFO L182 omatonBuilderFactory]: Interpolants [8594#true, 8595#false, 8598#(= main_~i~0 0), 8599#(= main_~i~0 1), 8600#(= main_~i~0 2), 8601#(= main_~i~0 3), 8602#(= main_~i~0 4), 8603#(= main_~i~0 5), 8604#(= main_~i~0 6), 8605#(= main_~i~0 7), 8606#(= main_~i~0 8), 8607#(= main_~i~0 9), 8608#(= main_~i~0 10), 8609#(= main_~i~0 11), 8610#(= main_~i~0 12), 8611#(= main_~i~0 13), 8612#(= main_~i~0 14), 8613#(= main_~i~0 15), 8614#(= main_~i~0 16), 8615#(= main_~i~0 17), 8616#(= main_~i~0 18), 8617#(= main_~i~0 19), 8618#(= main_~i~0 20), 8619#(= main_~i~0 21), 8620#(= main_~i~0 22), 8621#(= main_~i~0 23), 8622#(= main_~i~0 24), 8623#(= main_~i~0 25), 8624#(= main_~i~0 26), 8625#(= main_~i~0 27), 8626#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:53,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 20:55:53,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 20:55:53,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 20:55:53,226 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 31 states. [2018-02-04 20:55:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:54,432 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2018-02-04 20:55:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:55:54,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 120 [2018-02-04 20:55:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:54,433 INFO L225 Difference]: With dead ends: 274 [2018-02-04 20:55:54,433 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 20:55:54,435 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-04 20:55:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 20:55:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-02-04 20:55:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 20:55:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-02-04 20:55:54,437 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 120 [2018-02-04 20:55:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:54,437 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-02-04 20:55:54,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 20:55:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-02-04 20:55:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 20:55:54,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:54,438 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:54,438 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2089579077, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:54,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:54,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:54,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 20:55:54,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:54,721 INFO L182 omatonBuilderFactory]: Interpolants [9175#true, 9176#false, 9179#(= main_~i~0 0), 9180#(= main_~i~0 1), 9181#(= main_~i~0 2), 9182#(= main_~i~0 3), 9183#(= main_~i~0 4), 9184#(= main_~i~0 5), 9185#(= main_~i~0 6), 9186#(= main_~i~0 7), 9187#(= main_~i~0 8), 9188#(= main_~i~0 9), 9189#(= main_~i~0 10), 9190#(= main_~i~0 11), 9191#(= main_~i~0 12), 9192#(= main_~i~0 13), 9193#(= main_~i~0 14), 9194#(= main_~i~0 15), 9195#(= main_~i~0 16), 9196#(= main_~i~0 17), 9197#(= main_~i~0 18), 9198#(= main_~i~0 19), 9199#(= main_~i~0 20), 9200#(= main_~i~0 21), 9201#(= main_~i~0 22), 9202#(= main_~i~0 23), 9203#(= main_~i~0 24), 9204#(= main_~i~0 25), 9205#(= main_~i~0 26), 9206#(= main_~i~0 27), 9207#(= main_~i~0 28), 9208#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:54,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 20:55:54,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 20:55:54,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:55:54,722 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 32 states. [2018-02-04 20:55:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:56,039 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-02-04 20:55:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 20:55:56,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 124 [2018-02-04 20:55:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:56,040 INFO L225 Difference]: With dead ends: 283 [2018-02-04 20:55:56,040 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 20:55:56,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:55:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 20:55:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-04 20:55:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 20:55:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-02-04 20:55:56,043 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 124 [2018-02-04 20:55:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:56,044 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-02-04 20:55:56,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 20:55:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-02-04 20:55:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 20:55:56,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:56,045 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:56,045 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1595557570, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:56,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:56,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:56,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 20:55:56,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:56,368 INFO L182 omatonBuilderFactory]: Interpolants [9792#(= main_~i~0 13), 9793#(= main_~i~0 14), 9794#(= main_~i~0 15), 9795#(= main_~i~0 16), 9796#(= main_~i~0 17), 9797#(= main_~i~0 18), 9798#(= main_~i~0 19), 9799#(= main_~i~0 20), 9800#(= main_~i~0 21), 9801#(= main_~i~0 22), 9802#(= main_~i~0 23), 9803#(= main_~i~0 24), 9804#(= main_~i~0 25), 9805#(= main_~i~0 26), 9806#(= main_~i~0 27), 9807#(= main_~i~0 28), 9808#(= main_~i~0 29), 9809#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 9775#true, 9776#false, 9779#(= main_~i~0 0), 9780#(= main_~i~0 1), 9781#(= main_~i~0 2), 9782#(= main_~i~0 3), 9783#(= main_~i~0 4), 9784#(= main_~i~0 5), 9785#(= main_~i~0 6), 9786#(= main_~i~0 7), 9787#(= main_~i~0 8), 9788#(= main_~i~0 9), 9789#(= main_~i~0 10), 9790#(= main_~i~0 11), 9791#(= main_~i~0 12)] [2018-02-04 20:55:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:56,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 20:55:56,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 20:55:56,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:55:56,369 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 33 states. [2018-02-04 20:55:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:57,803 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-02-04 20:55:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 20:55:57,803 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 128 [2018-02-04 20:55:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:57,804 INFO L225 Difference]: With dead ends: 292 [2018-02-04 20:55:57,804 INFO L226 Difference]: Without dead ends: 292 [2018-02-04 20:55:57,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:55:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-04 20:55:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-02-04 20:55:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 20:55:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2018-02-04 20:55:57,807 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 128 [2018-02-04 20:55:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:57,807 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 293 transitions. [2018-02-04 20:55:57,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 20:55:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 293 transitions. [2018-02-04 20:55:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 20:55:57,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:57,808 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:57,808 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash -656352329, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:57,812 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:58,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:58,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 20:55:58,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:58,110 INFO L182 omatonBuilderFactory]: Interpolants [10394#true, 10395#false, 10398#(= main_~i~0 0), 10399#(= main_~i~0 1), 10400#(= main_~i~0 2), 10401#(= main_~i~0 3), 10402#(= main_~i~0 4), 10403#(= main_~i~0 5), 10404#(= main_~i~0 6), 10405#(= main_~i~0 7), 10406#(= main_~i~0 8), 10407#(= main_~i~0 9), 10408#(= main_~i~0 10), 10409#(= main_~i~0 11), 10410#(= main_~i~0 12), 10411#(= main_~i~0 13), 10412#(= main_~i~0 14), 10413#(= main_~i~0 15), 10414#(= main_~i~0 16), 10415#(= main_~i~0 17), 10416#(= main_~i~0 18), 10417#(= main_~i~0 19), 10418#(= main_~i~0 20), 10419#(= main_~i~0 21), 10420#(= main_~i~0 22), 10421#(= main_~i~0 23), 10422#(= main_~i~0 24), 10423#(= main_~i~0 25), 10424#(= main_~i~0 26), 10425#(= main_~i~0 27), 10426#(= main_~i~0 28), 10427#(= main_~i~0 29), 10428#(= main_~i~0 30), 10429#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:58,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 20:55:58,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 20:55:58,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:55:58,111 INFO L87 Difference]: Start difference. First operand 292 states and 293 transitions. Second operand 34 states. [2018-02-04 20:55:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:55:59,560 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-02-04 20:55:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 20:55:59,560 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-02-04 20:55:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:55:59,561 INFO L225 Difference]: With dead ends: 301 [2018-02-04 20:55:59,561 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 20:55:59,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:55:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 20:55:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-02-04 20:55:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-04 20:55:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-02-04 20:55:59,564 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 132 [2018-02-04 20:55:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:55:59,564 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-02-04 20:55:59,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 20:55:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-02-04 20:55:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 20:55:59,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:55:59,565 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 20:55:59,565 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:55:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2128340560, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:55:59,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:55:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:55:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:59,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:55:59,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 20:55:59,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:55:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:59,892 INFO L182 omatonBuilderFactory]: Interpolants [11032#true, 11033#false, 11036#(= main_~i~0 0), 11037#(= main_~i~0 1), 11038#(= main_~i~0 2), 11039#(= main_~i~0 3), 11040#(= main_~i~0 4), 11041#(= main_~i~0 5), 11042#(= main_~i~0 6), 11043#(= main_~i~0 7), 11044#(= main_~i~0 8), 11045#(= main_~i~0 9), 11046#(= main_~i~0 10), 11047#(= main_~i~0 11), 11048#(= main_~i~0 12), 11049#(= main_~i~0 13), 11050#(= main_~i~0 14), 11051#(= main_~i~0 15), 11052#(= main_~i~0 16), 11053#(= main_~i~0 17), 11054#(= main_~i~0 18), 11055#(= main_~i~0 19), 11056#(= main_~i~0 20), 11057#(= main_~i~0 21), 11058#(= main_~i~0 22), 11059#(= main_~i~0 23), 11060#(= main_~i~0 24), 11061#(= main_~i~0 25), 11062#(= main_~i~0 26), 11063#(= main_~i~0 27), 11064#(= main_~i~0 28), 11065#(= main_~i~0 29), 11066#(= main_~i~0 30), 11067#(= main_~i~0 31), 11068#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:55:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:55:59,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 20:55:59,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 20:55:59,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:55:59,893 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 35 states. [2018-02-04 20:56:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:01,459 INFO L93 Difference]: Finished difference Result 310 states and 311 transitions. [2018-02-04 20:56:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 20:56:01,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-02-04 20:56:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:01,460 INFO L225 Difference]: With dead ends: 310 [2018-02-04 20:56:01,460 INFO L226 Difference]: Without dead ends: 310 [2018-02-04 20:56:01,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:56:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-04 20:56:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-02-04 20:56:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 20:56:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-02-04 20:56:01,464 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 136 [2018-02-04 20:56:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:01,464 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-02-04 20:56:01,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 20:56:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-02-04 20:56:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-04 20:56:01,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:01,464 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:01,465 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1187663063, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:01,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:01,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:01,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 20:56:01,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:01,996 INFO L182 omatonBuilderFactory]: Interpolants [11712#(= main_~i~0 19), 11713#(= main_~i~0 20), 11714#(= main_~i~0 21), 11715#(= main_~i~0 22), 11716#(= main_~i~0 23), 11717#(= main_~i~0 24), 11718#(= main_~i~0 25), 11719#(= main_~i~0 26), 11720#(= main_~i~0 27), 11721#(= main_~i~0 28), 11722#(= main_~i~0 29), 11723#(= main_~i~0 30), 11724#(= main_~i~0 31), 11725#(= main_~i~0 32), 11726#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 11689#true, 11690#false, 11693#(= main_~i~0 0), 11694#(= main_~i~0 1), 11695#(= main_~i~0 2), 11696#(= main_~i~0 3), 11697#(= main_~i~0 4), 11698#(= main_~i~0 5), 11699#(= main_~i~0 6), 11700#(= main_~i~0 7), 11701#(= main_~i~0 8), 11702#(= main_~i~0 9), 11703#(= main_~i~0 10), 11704#(= main_~i~0 11), 11705#(= main_~i~0 12), 11706#(= main_~i~0 13), 11707#(= main_~i~0 14), 11708#(= main_~i~0 15), 11709#(= main_~i~0 16), 11710#(= main_~i~0 17), 11711#(= main_~i~0 18)] [2018-02-04 20:56:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:01,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 20:56:01,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 20:56:01,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 20:56:01,998 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 36 states. [2018-02-04 20:56:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:03,982 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-02-04 20:56:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 20:56:03,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-02-04 20:56:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:03,983 INFO L225 Difference]: With dead ends: 319 [2018-02-04 20:56:03,983 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 20:56:03,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 20:56:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 20:56:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-02-04 20:56:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 20:56:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-02-04 20:56:03,985 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 140 [2018-02-04 20:56:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:03,986 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-02-04 20:56:03,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 20:56:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-02-04 20:56:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 20:56:03,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:03,986 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:03,986 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash -209983454, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:03,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:04,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:04,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 20:56:04,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:04,332 INFO L182 omatonBuilderFactory]: Interpolants [12365#true, 12366#false, 12369#(= main_~i~0 0), 12370#(= main_~i~0 1), 12371#(= main_~i~0 2), 12372#(= main_~i~0 3), 12373#(= main_~i~0 4), 12374#(= main_~i~0 5), 12375#(= main_~i~0 6), 12376#(= main_~i~0 7), 12377#(= main_~i~0 8), 12378#(= main_~i~0 9), 12379#(= main_~i~0 10), 12380#(= main_~i~0 11), 12381#(= main_~i~0 12), 12382#(= main_~i~0 13), 12383#(= main_~i~0 14), 12384#(= main_~i~0 15), 12385#(= main_~i~0 16), 12386#(= main_~i~0 17), 12387#(= main_~i~0 18), 12388#(= main_~i~0 19), 12389#(= main_~i~0 20), 12390#(= main_~i~0 21), 12391#(= main_~i~0 22), 12392#(= main_~i~0 23), 12393#(= main_~i~0 24), 12394#(= main_~i~0 25), 12395#(= main_~i~0 26), 12396#(= main_~i~0 27), 12397#(= main_~i~0 28), 12398#(= main_~i~0 29), 12399#(= main_~i~0 30), 12400#(= main_~i~0 31), 12401#(= main_~i~0 32), 12402#(= main_~i~0 33), 12403#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:04,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 20:56:04,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 20:56:04,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 20:56:04,333 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 37 states. [2018-02-04 20:56:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:06,154 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-02-04 20:56:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 20:56:06,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-02-04 20:56:06,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:06,155 INFO L225 Difference]: With dead ends: 328 [2018-02-04 20:56:06,155 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 20:56:06,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 20:56:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 20:56:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 20:56:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 20:56:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2018-02-04 20:56:06,159 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 144 [2018-02-04 20:56:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:06,160 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2018-02-04 20:56:06,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 20:56:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2018-02-04 20:56:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 20:56:06,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:06,160 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:06,160 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2059601765, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:06,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:06,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:06,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 20:56:06,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:06,541 INFO L182 omatonBuilderFactory]: Interpolants [13060#true, 13061#false, 13064#(= main_~i~0 0), 13065#(= main_~i~0 1), 13066#(= main_~i~0 2), 13067#(= main_~i~0 3), 13068#(= main_~i~0 4), 13069#(= main_~i~0 5), 13070#(= main_~i~0 6), 13071#(= main_~i~0 7), 13072#(= main_~i~0 8), 13073#(= main_~i~0 9), 13074#(= main_~i~0 10), 13075#(= main_~i~0 11), 13076#(= main_~i~0 12), 13077#(= main_~i~0 13), 13078#(= main_~i~0 14), 13079#(= main_~i~0 15), 13080#(= main_~i~0 16), 13081#(= main_~i~0 17), 13082#(= main_~i~0 18), 13083#(= main_~i~0 19), 13084#(= main_~i~0 20), 13085#(= main_~i~0 21), 13086#(= main_~i~0 22), 13087#(= main_~i~0 23), 13088#(= main_~i~0 24), 13089#(= main_~i~0 25), 13090#(= main_~i~0 26), 13091#(= main_~i~0 27), 13092#(= main_~i~0 28), 13093#(= main_~i~0 29), 13094#(= main_~i~0 30), 13095#(= main_~i~0 31), 13096#(= main_~i~0 32), 13097#(= main_~i~0 33), 13098#(= main_~i~0 34), 13099#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:06,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 20:56:06,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 20:56:06,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 20:56:06,542 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 38 states. [2018-02-04 20:56:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:08,439 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-02-04 20:56:08,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 20:56:08,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-02-04 20:56:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:08,440 INFO L225 Difference]: With dead ends: 337 [2018-02-04 20:56:08,440 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 20:56:08,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 20:56:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 20:56:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-02-04 20:56:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 20:56:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-02-04 20:56:08,442 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 148 [2018-02-04 20:56:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:08,442 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-02-04 20:56:08,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 20:56:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-02-04 20:56:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 20:56:08,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:08,443 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:08,443 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash 916399252, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:08,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:08,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:08,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 20:56:08,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:08,830 INFO L182 omatonBuilderFactory]: Interpolants [13774#true, 13775#false, 13778#(= main_~i~0 0), 13779#(= main_~i~0 1), 13780#(= main_~i~0 2), 13781#(= main_~i~0 3), 13782#(= main_~i~0 4), 13783#(= main_~i~0 5), 13784#(= main_~i~0 6), 13785#(= main_~i~0 7), 13786#(= main_~i~0 8), 13787#(= main_~i~0 9), 13788#(= main_~i~0 10), 13789#(= main_~i~0 11), 13790#(= main_~i~0 12), 13791#(= main_~i~0 13), 13792#(= main_~i~0 14), 13793#(= main_~i~0 15), 13794#(= main_~i~0 16), 13795#(= main_~i~0 17), 13796#(= main_~i~0 18), 13797#(= main_~i~0 19), 13798#(= main_~i~0 20), 13799#(= main_~i~0 21), 13800#(= main_~i~0 22), 13801#(= main_~i~0 23), 13802#(= main_~i~0 24), 13803#(= main_~i~0 25), 13804#(= main_~i~0 26), 13805#(= main_~i~0 27), 13806#(= main_~i~0 28), 13807#(= main_~i~0 29), 13808#(= main_~i~0 30), 13809#(= main_~i~0 31), 13810#(= main_~i~0 32), 13811#(= main_~i~0 33), 13812#(= main_~i~0 34), 13813#(= main_~i~0 35), 13814#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:08,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 20:56:08,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 20:56:08,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 20:56:08,831 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 39 states. [2018-02-04 20:56:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:10,852 INFO L93 Difference]: Finished difference Result 346 states and 347 transitions. [2018-02-04 20:56:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 20:56:10,852 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 152 [2018-02-04 20:56:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:10,853 INFO L225 Difference]: With dead ends: 346 [2018-02-04 20:56:10,853 INFO L226 Difference]: Without dead ends: 346 [2018-02-04 20:56:10,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 20:56:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-04 20:56:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-02-04 20:56:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-04 20:56:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2018-02-04 20:56:10,857 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 152 [2018-02-04 20:56:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:10,857 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2018-02-04 20:56:10,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 20:56:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2018-02-04 20:56:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-02-04 20:56:10,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:10,858 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:10,858 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash -760697843, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:10,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:11,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:11,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 20:56:11,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:11,347 INFO L182 omatonBuilderFactory]: Interpolants [14528#(= main_~i~0 17), 14529#(= main_~i~0 18), 14530#(= main_~i~0 19), 14531#(= main_~i~0 20), 14532#(= main_~i~0 21), 14533#(= main_~i~0 22), 14534#(= main_~i~0 23), 14535#(= main_~i~0 24), 14536#(= main_~i~0 25), 14537#(= main_~i~0 26), 14538#(= main_~i~0 27), 14539#(= main_~i~0 28), 14540#(= main_~i~0 29), 14541#(= main_~i~0 30), 14542#(= main_~i~0 31), 14543#(= main_~i~0 32), 14544#(= main_~i~0 33), 14545#(= main_~i~0 34), 14546#(= main_~i~0 35), 14547#(= main_~i~0 36), 14548#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 14507#true, 14508#false, 14511#(= main_~i~0 0), 14512#(= main_~i~0 1), 14513#(= main_~i~0 2), 14514#(= main_~i~0 3), 14515#(= main_~i~0 4), 14516#(= main_~i~0 5), 14517#(= main_~i~0 6), 14518#(= main_~i~0 7), 14519#(= main_~i~0 8), 14520#(= main_~i~0 9), 14521#(= main_~i~0 10), 14522#(= main_~i~0 11), 14523#(= main_~i~0 12), 14524#(= main_~i~0 13), 14525#(= main_~i~0 14), 14526#(= main_~i~0 15), 14527#(= main_~i~0 16)] [2018-02-04 20:56:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:11,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 20:56:11,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 20:56:11,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 20:56:11,348 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 40 states. [2018-02-04 20:56:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:13,360 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-02-04 20:56:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 20:56:13,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 156 [2018-02-04 20:56:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:13,361 INFO L225 Difference]: With dead ends: 355 [2018-02-04 20:56:13,361 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 20:56:13,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 20:56:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 20:56:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-02-04 20:56:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-04 20:56:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-02-04 20:56:13,363 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 156 [2018-02-04 20:56:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:13,364 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-02-04 20:56:13,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 20:56:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-02-04 20:56:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 20:56:13,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:13,364 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:13,364 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1220555002, 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-04 20:56:13,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:13,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:13,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 20:56:13,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:13,784 INFO L182 omatonBuilderFactory]: Interpolants [15296#(= main_~i~0 33), 15297#(= main_~i~0 34), 15298#(= main_~i~0 35), 15299#(= main_~i~0 36), 15300#(= main_~i~0 37), 15301#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 15259#true, 15260#false, 15263#(= main_~i~0 0), 15264#(= main_~i~0 1), 15265#(= main_~i~0 2), 15266#(= main_~i~0 3), 15267#(= main_~i~0 4), 15268#(= main_~i~0 5), 15269#(= main_~i~0 6), 15270#(= main_~i~0 7), 15271#(= main_~i~0 8), 15272#(= main_~i~0 9), 15273#(= main_~i~0 10), 15274#(= main_~i~0 11), 15275#(= main_~i~0 12), 15276#(= main_~i~0 13), 15277#(= main_~i~0 14), 15278#(= main_~i~0 15), 15279#(= main_~i~0 16), 15280#(= main_~i~0 17), 15281#(= main_~i~0 18), 15282#(= main_~i~0 19), 15283#(= main_~i~0 20), 15284#(= main_~i~0 21), 15285#(= main_~i~0 22), 15286#(= main_~i~0 23), 15287#(= main_~i~0 24), 15288#(= main_~i~0 25), 15289#(= main_~i~0 26), 15290#(= main_~i~0 27), 15291#(= main_~i~0 28), 15292#(= main_~i~0 29), 15293#(= main_~i~0 30), 15294#(= main_~i~0 31), 15295#(= main_~i~0 32)] [2018-02-04 20:56:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:13,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 20:56:13,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 20:56:13,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 20:56:13,785 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 41 states. [2018-02-04 20:56:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:15,959 INFO L93 Difference]: Finished difference Result 364 states and 365 transitions. [2018-02-04 20:56:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 20:56:15,959 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-02-04 20:56:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:15,960 INFO L225 Difference]: With dead ends: 364 [2018-02-04 20:56:15,960 INFO L226 Difference]: Without dead ends: 364 [2018-02-04 20:56:15,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 20:56:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-04 20:56:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2018-02-04 20:56:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-04 20:56:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-02-04 20:56:15,963 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 160 [2018-02-04 20:56:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:15,963 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-02-04 20:56:15,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 20:56:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-02-04 20:56:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 20:56:15,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:15,964 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:15,964 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1697303935, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:15,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:16,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:16,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 20:56:16,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:16,411 INFO L182 omatonBuilderFactory]: Interpolants [16064#(= main_~i~0 30), 16065#(= main_~i~0 31), 16066#(= main_~i~0 32), 16067#(= main_~i~0 33), 16068#(= main_~i~0 34), 16069#(= main_~i~0 35), 16070#(= main_~i~0 36), 16071#(= main_~i~0 37), 16072#(= main_~i~0 38), 16073#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 16030#true, 16031#false, 16034#(= main_~i~0 0), 16035#(= main_~i~0 1), 16036#(= main_~i~0 2), 16037#(= main_~i~0 3), 16038#(= main_~i~0 4), 16039#(= main_~i~0 5), 16040#(= main_~i~0 6), 16041#(= main_~i~0 7), 16042#(= main_~i~0 8), 16043#(= main_~i~0 9), 16044#(= main_~i~0 10), 16045#(= main_~i~0 11), 16046#(= main_~i~0 12), 16047#(= main_~i~0 13), 16048#(= main_~i~0 14), 16049#(= main_~i~0 15), 16050#(= main_~i~0 16), 16051#(= main_~i~0 17), 16052#(= main_~i~0 18), 16053#(= main_~i~0 19), 16054#(= main_~i~0 20), 16055#(= main_~i~0 21), 16056#(= main_~i~0 22), 16057#(= main_~i~0 23), 16058#(= main_~i~0 24), 16059#(= main_~i~0 25), 16060#(= main_~i~0 26), 16061#(= main_~i~0 27), 16062#(= main_~i~0 28), 16063#(= main_~i~0 29)] [2018-02-04 20:56:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:16,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 20:56:16,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 20:56:16,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 20:56:16,412 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 42 states. [2018-02-04 20:56:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:18,672 INFO L93 Difference]: Finished difference Result 373 states and 374 transitions. [2018-02-04 20:56:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 20:56:18,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 164 [2018-02-04 20:56:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:18,673 INFO L225 Difference]: With dead ends: 373 [2018-02-04 20:56:18,673 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 20:56:18,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 20:56:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 20:56:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-04 20:56:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 20:56:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-02-04 20:56:18,677 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 164 [2018-02-04 20:56:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:18,677 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-02-04 20:56:18,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 20:56:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-02-04 20:56:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 20:56:18,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:18,678 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:18,678 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash 269477752, 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) [2018-02-04 20:56:18,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:19,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:19,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 20:56:19,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:19,111 INFO L182 omatonBuilderFactory]: Interpolants [16832#(= main_~i~0 8), 16833#(= main_~i~0 9), 16834#(= main_~i~0 10), 16835#(= main_~i~0 11), 16836#(= main_~i~0 12), 16837#(= main_~i~0 13), 16838#(= main_~i~0 14), 16839#(= main_~i~0 15), 16840#(= main_~i~0 16), 16841#(= main_~i~0 17), 16842#(= main_~i~0 18), 16843#(= main_~i~0 19), 16844#(= main_~i~0 20), 16845#(= main_~i~0 21), 16846#(= main_~i~0 22), 16847#(= main_~i~0 23), 16848#(= main_~i~0 24), 16849#(= main_~i~0 25), 16850#(= main_~i~0 26), 16851#(= main_~i~0 27), 16852#(= main_~i~0 28), 16853#(= main_~i~0 29), 16854#(= main_~i~0 30), 16855#(= main_~i~0 31), 16856#(= main_~i~0 32), 16857#(= main_~i~0 33), 16858#(= main_~i~0 34), 16859#(= main_~i~0 35), 16860#(= main_~i~0 36), 16861#(= main_~i~0 37), 16862#(= main_~i~0 38), 16863#(= main_~i~0 39), 16864#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 16820#true, 16821#false, 16824#(= main_~i~0 0), 16825#(= main_~i~0 1), 16826#(= main_~i~0 2), 16827#(= main_~i~0 3), 16828#(= main_~i~0 4), 16829#(= main_~i~0 5), 16830#(= main_~i~0 6), 16831#(= main_~i~0 7)] [2018-02-04 20:56:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:19,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 20:56:19,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 20:56:19,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 20:56:19,111 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 43 states. [2018-02-04 20:56:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:21,546 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2018-02-04 20:56:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 20:56:21,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 168 [2018-02-04 20:56:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:21,547 INFO L225 Difference]: With dead ends: 382 [2018-02-04 20:56:21,547 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 20:56:21,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 20:56:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 20:56:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-02-04 20:56:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 20:56:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2018-02-04 20:56:21,550 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 168 [2018-02-04 20:56:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:21,550 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2018-02-04 20:56:21,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 20:56:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2018-02-04 20:56:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 20:56:21,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:21,550 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:21,550 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 779443441, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:21,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:22,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:22,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 20:56:22,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:22,054 INFO L182 omatonBuilderFactory]: Interpolants [17664#(= main_~i~0 31), 17665#(= main_~i~0 32), 17666#(= main_~i~0 33), 17667#(= main_~i~0 34), 17668#(= main_~i~0 35), 17669#(= main_~i~0 36), 17670#(= main_~i~0 37), 17671#(= main_~i~0 38), 17672#(= main_~i~0 39), 17673#(= main_~i~0 40), 17674#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 17629#true, 17630#false, 17633#(= main_~i~0 0), 17634#(= main_~i~0 1), 17635#(= main_~i~0 2), 17636#(= main_~i~0 3), 17637#(= main_~i~0 4), 17638#(= main_~i~0 5), 17639#(= main_~i~0 6), 17640#(= main_~i~0 7), 17641#(= main_~i~0 8), 17642#(= main_~i~0 9), 17643#(= main_~i~0 10), 17644#(= main_~i~0 11), 17645#(= main_~i~0 12), 17646#(= main_~i~0 13), 17647#(= main_~i~0 14), 17648#(= main_~i~0 15), 17649#(= main_~i~0 16), 17650#(= main_~i~0 17), 17651#(= main_~i~0 18), 17652#(= main_~i~0 19), 17653#(= main_~i~0 20), 17654#(= main_~i~0 21), 17655#(= main_~i~0 22), 17656#(= main_~i~0 23), 17657#(= main_~i~0 24), 17658#(= main_~i~0 25), 17659#(= main_~i~0 26), 17660#(= main_~i~0 27), 17661#(= main_~i~0 28), 17662#(= main_~i~0 29), 17663#(= main_~i~0 30)] [2018-02-04 20:56:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:22,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 20:56:22,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 20:56:22,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:56:22,055 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 44 states. [2018-02-04 20:56:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:24,545 INFO L93 Difference]: Finished difference Result 391 states and 392 transitions. [2018-02-04 20:56:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 20:56:24,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 172 [2018-02-04 20:56:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:24,546 INFO L225 Difference]: With dead ends: 391 [2018-02-04 20:56:24,546 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 20:56:24,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:56:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 20:56:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-02-04 20:56:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 20:56:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-02-04 20:56:24,549 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 172 [2018-02-04 20:56:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:24,549 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-02-04 20:56:24,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 20:56:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-02-04 20:56:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-04 20:56:24,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:24,549 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:24,549 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 163671530, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:24,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:25,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:25,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 20:56:25,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:25,073 INFO L182 omatonBuilderFactory]: Interpolants [18496#(= main_~i~0 35), 18497#(= main_~i~0 36), 18498#(= main_~i~0 37), 18499#(= main_~i~0 38), 18500#(= main_~i~0 39), 18501#(= main_~i~0 40), 18502#(= main_~i~0 41), 18503#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 18457#true, 18458#false, 18461#(= main_~i~0 0), 18462#(= main_~i~0 1), 18463#(= main_~i~0 2), 18464#(= main_~i~0 3), 18465#(= main_~i~0 4), 18466#(= main_~i~0 5), 18467#(= main_~i~0 6), 18468#(= main_~i~0 7), 18469#(= main_~i~0 8), 18470#(= main_~i~0 9), 18471#(= main_~i~0 10), 18472#(= main_~i~0 11), 18473#(= main_~i~0 12), 18474#(= main_~i~0 13), 18475#(= main_~i~0 14), 18476#(= main_~i~0 15), 18477#(= main_~i~0 16), 18478#(= main_~i~0 17), 18479#(= main_~i~0 18), 18480#(= main_~i~0 19), 18481#(= main_~i~0 20), 18482#(= main_~i~0 21), 18483#(= main_~i~0 22), 18484#(= main_~i~0 23), 18485#(= main_~i~0 24), 18486#(= main_~i~0 25), 18487#(= main_~i~0 26), 18488#(= main_~i~0 27), 18489#(= main_~i~0 28), 18490#(= main_~i~0 29), 18491#(= main_~i~0 30), 18492#(= main_~i~0 31), 18493#(= main_~i~0 32), 18494#(= main_~i~0 33), 18495#(= main_~i~0 34)] [2018-02-04 20:56:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:25,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 20:56:25,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 20:56:25,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 20:56:25,074 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 45 states. [2018-02-04 20:56:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:27,614 INFO L93 Difference]: Finished difference Result 400 states and 401 transitions. [2018-02-04 20:56:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 20:56:27,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 176 [2018-02-04 20:56:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:27,615 INFO L225 Difference]: With dead ends: 400 [2018-02-04 20:56:27,615 INFO L226 Difference]: Without dead ends: 400 [2018-02-04 20:56:27,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 20:56:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-04 20:56:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-02-04 20:56:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 20:56:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-02-04 20:56:27,669 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 176 [2018-02-04 20:56:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:27,669 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-02-04 20:56:27,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 20:56:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-02-04 20:56:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 20:56:27,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:27,670 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:27,670 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1312447075, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:27,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:28,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:28,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 20:56:28,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:28,230 INFO L182 omatonBuilderFactory]: Interpolants [19328#(= main_~i~0 20), 19329#(= main_~i~0 21), 19330#(= main_~i~0 22), 19331#(= main_~i~0 23), 19332#(= main_~i~0 24), 19333#(= main_~i~0 25), 19334#(= main_~i~0 26), 19335#(= main_~i~0 27), 19336#(= main_~i~0 28), 19337#(= main_~i~0 29), 19338#(= main_~i~0 30), 19339#(= main_~i~0 31), 19340#(= main_~i~0 32), 19341#(= main_~i~0 33), 19342#(= main_~i~0 34), 19343#(= main_~i~0 35), 19344#(= main_~i~0 36), 19345#(= main_~i~0 37), 19346#(= main_~i~0 38), 19347#(= main_~i~0 39), 19348#(= main_~i~0 40), 19349#(= main_~i~0 41), 19350#(= main_~i~0 42), 19351#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 19304#true, 19305#false, 19308#(= main_~i~0 0), 19309#(= main_~i~0 1), 19310#(= main_~i~0 2), 19311#(= main_~i~0 3), 19312#(= main_~i~0 4), 19313#(= main_~i~0 5), 19314#(= main_~i~0 6), 19315#(= main_~i~0 7), 19316#(= main_~i~0 8), 19317#(= main_~i~0 9), 19318#(= main_~i~0 10), 19319#(= main_~i~0 11), 19320#(= main_~i~0 12), 19321#(= main_~i~0 13), 19322#(= main_~i~0 14), 19323#(= main_~i~0 15), 19324#(= main_~i~0 16), 19325#(= main_~i~0 17), 19326#(= main_~i~0 18), 19327#(= main_~i~0 19)] [2018-02-04 20:56:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:28,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 20:56:28,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 20:56:28,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 20:56:28,231 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 46 states. [2018-02-04 20:56:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:30,983 INFO L93 Difference]: Finished difference Result 409 states and 410 transitions. [2018-02-04 20:56:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 20:56:30,983 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-02-04 20:56:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:30,984 INFO L225 Difference]: With dead ends: 409 [2018-02-04 20:56:30,984 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 20:56:30,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 20:56:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 20:56:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-02-04 20:56:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-04 20:56:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-02-04 20:56:30,987 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 180 [2018-02-04 20:56:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:30,987 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-02-04 20:56:30,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 20:56:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-02-04 20:56:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 20:56:30,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:30,988 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:30,988 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1694080420, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:30,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:31,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:31,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 20:56:31,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:31,493 INFO L182 omatonBuilderFactory]: Interpolants [20170#true, 20171#false, 20174#(= main_~i~0 0), 20175#(= main_~i~0 1), 20176#(= main_~i~0 2), 20177#(= main_~i~0 3), 20178#(= main_~i~0 4), 20179#(= main_~i~0 5), 20180#(= main_~i~0 6), 20181#(= main_~i~0 7), 20182#(= main_~i~0 8), 20183#(= main_~i~0 9), 20184#(= main_~i~0 10), 20185#(= main_~i~0 11), 20186#(= main_~i~0 12), 20187#(= main_~i~0 13), 20188#(= main_~i~0 14), 20189#(= main_~i~0 15), 20190#(= main_~i~0 16), 20191#(= main_~i~0 17), 20192#(= main_~i~0 18), 20193#(= main_~i~0 19), 20194#(= main_~i~0 20), 20195#(= main_~i~0 21), 20196#(= main_~i~0 22), 20197#(= main_~i~0 23), 20198#(= main_~i~0 24), 20199#(= main_~i~0 25), 20200#(= main_~i~0 26), 20201#(= main_~i~0 27), 20202#(= main_~i~0 28), 20203#(= main_~i~0 29), 20204#(= main_~i~0 30), 20205#(= main_~i~0 31), 20206#(= main_~i~0 32), 20207#(= main_~i~0 33), 20208#(= main_~i~0 34), 20209#(= main_~i~0 35), 20210#(= main_~i~0 36), 20211#(= main_~i~0 37), 20212#(= main_~i~0 38), 20213#(= main_~i~0 39), 20214#(= main_~i~0 40), 20215#(= main_~i~0 41), 20216#(= main_~i~0 42), 20217#(= main_~i~0 43), 20218#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:31,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 20:56:31,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 20:56:31,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 20:56:31,494 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 47 states. [2018-02-04 20:56:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:34,504 INFO L93 Difference]: Finished difference Result 418 states and 419 transitions. [2018-02-04 20:56:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 20:56:34,504 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-02-04 20:56:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:34,505 INFO L225 Difference]: With dead ends: 418 [2018-02-04 20:56:34,505 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 20:56:34,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 20:56:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 20:56:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-02-04 20:56:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-04 20:56:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 419 transitions. [2018-02-04 20:56:34,508 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 419 transitions. Word has length 184 [2018-02-04 20:56:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:34,508 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 419 transitions. [2018-02-04 20:56:34,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 20:56:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 419 transitions. [2018-02-04 20:56:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 20:56:34,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:34,509 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:34,509 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 304858581, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:34,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:35,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:35,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 20:56:35,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:35,074 INFO L182 omatonBuilderFactory]: Interpolants [21056#false, 21059#(= main_~i~0 0), 21060#(= main_~i~0 1), 21061#(= main_~i~0 2), 21062#(= main_~i~0 3), 21063#(= main_~i~0 4), 21064#(= main_~i~0 5), 21065#(= main_~i~0 6), 21066#(= main_~i~0 7), 21067#(= main_~i~0 8), 21068#(= main_~i~0 9), 21069#(= main_~i~0 10), 21070#(= main_~i~0 11), 21071#(= main_~i~0 12), 21072#(= main_~i~0 13), 21073#(= main_~i~0 14), 21074#(= main_~i~0 15), 21075#(= main_~i~0 16), 21076#(= main_~i~0 17), 21077#(= main_~i~0 18), 21078#(= main_~i~0 19), 21079#(= main_~i~0 20), 21080#(= main_~i~0 21), 21081#(= main_~i~0 22), 21082#(= main_~i~0 23), 21083#(= main_~i~0 24), 21084#(= main_~i~0 25), 21085#(= main_~i~0 26), 21086#(= main_~i~0 27), 21087#(= main_~i~0 28), 21088#(= main_~i~0 29), 21089#(= main_~i~0 30), 21090#(= main_~i~0 31), 21091#(= main_~i~0 32), 21092#(= main_~i~0 33), 21093#(= main_~i~0 34), 21094#(= main_~i~0 35), 21095#(= main_~i~0 36), 21096#(= main_~i~0 37), 21097#(= main_~i~0 38), 21098#(= main_~i~0 39), 21099#(= main_~i~0 40), 21100#(= main_~i~0 41), 21101#(= main_~i~0 42), 21102#(= main_~i~0 43), 21103#(= main_~i~0 44), 21104#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 21055#true] [2018-02-04 20:56:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:35,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 20:56:35,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 20:56:35,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 20:56:35,075 INFO L87 Difference]: Start difference. First operand 418 states and 419 transitions. Second operand 48 states. [2018-02-04 20:56:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:38,043 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-02-04 20:56:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 20:56:38,044 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 188 [2018-02-04 20:56:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:38,044 INFO L225 Difference]: With dead ends: 427 [2018-02-04 20:56:38,044 INFO L226 Difference]: Without dead ends: 427 [2018-02-04 20:56:38,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 20:56:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-04 20:56:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-02-04 20:56:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-04 20:56:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-02-04 20:56:38,047 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 188 [2018-02-04 20:56:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:38,047 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-02-04 20:56:38,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 20:56:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-02-04 20:56:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 20:56:38,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:38,048 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:38,048 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash -393165618, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:38,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:38,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:38,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 20:56:38,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:38,689 INFO L182 omatonBuilderFactory]: Interpolants [21959#true, 21960#false, 21963#(= main_~i~0 0), 21964#(= main_~i~0 1), 21965#(= main_~i~0 2), 21966#(= main_~i~0 3), 21967#(= main_~i~0 4), 21968#(= main_~i~0 5), 21969#(= main_~i~0 6), 21970#(= main_~i~0 7), 21971#(= main_~i~0 8), 21972#(= main_~i~0 9), 21973#(= main_~i~0 10), 21974#(= main_~i~0 11), 21975#(= main_~i~0 12), 21976#(= main_~i~0 13), 21977#(= main_~i~0 14), 21978#(= main_~i~0 15), 21979#(= main_~i~0 16), 21980#(= main_~i~0 17), 21981#(= main_~i~0 18), 21982#(= main_~i~0 19), 21983#(= main_~i~0 20), 21984#(= main_~i~0 21), 21985#(= main_~i~0 22), 21986#(= main_~i~0 23), 21987#(= main_~i~0 24), 21988#(= main_~i~0 25), 21989#(= main_~i~0 26), 21990#(= main_~i~0 27), 21991#(= main_~i~0 28), 21992#(= main_~i~0 29), 21993#(= main_~i~0 30), 21994#(= main_~i~0 31), 21995#(= main_~i~0 32), 21996#(= main_~i~0 33), 21997#(= main_~i~0 34), 21998#(= main_~i~0 35), 21999#(= main_~i~0 36), 22000#(= main_~i~0 37), 22001#(= main_~i~0 38), 22002#(= main_~i~0 39), 22003#(= main_~i~0 40), 22004#(= main_~i~0 41), 22005#(= main_~i~0 42), 22006#(= main_~i~0 43), 22007#(= main_~i~0 44), 22008#(= main_~i~0 45), 22009#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:38,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 20:56:38,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 20:56:38,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 20:56:38,690 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 49 states. [2018-02-04 20:56:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:41,453 INFO L93 Difference]: Finished difference Result 436 states and 437 transitions. [2018-02-04 20:56:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 20:56:41,453 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 192 [2018-02-04 20:56:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:41,454 INFO L225 Difference]: With dead ends: 436 [2018-02-04 20:56:41,454 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 20:56:41,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 20:56:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 20:56:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-02-04 20:56:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 20:56:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 437 transitions. [2018-02-04 20:56:41,457 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 437 transitions. Word has length 192 [2018-02-04 20:56:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:41,457 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 437 transitions. [2018-02-04 20:56:41,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 20:56:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 437 transitions. [2018-02-04 20:56:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-04 20:56:41,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:41,458 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:41,458 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash -168059065, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:41,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:42,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:42,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 20:56:42,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:42,008 INFO L182 omatonBuilderFactory]: Interpolants [22912#(= main_~i~0 26), 22913#(= main_~i~0 27), 22914#(= main_~i~0 28), 22915#(= main_~i~0 29), 22916#(= main_~i~0 30), 22917#(= main_~i~0 31), 22918#(= main_~i~0 32), 22919#(= main_~i~0 33), 22920#(= main_~i~0 34), 22921#(= main_~i~0 35), 22922#(= main_~i~0 36), 22923#(= main_~i~0 37), 22924#(= main_~i~0 38), 22925#(= main_~i~0 39), 22926#(= main_~i~0 40), 22927#(= main_~i~0 41), 22928#(= main_~i~0 42), 22929#(= main_~i~0 43), 22930#(= main_~i~0 44), 22931#(= main_~i~0 45), 22932#(= main_~i~0 46), 22933#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 22882#true, 22883#false, 22886#(= main_~i~0 0), 22887#(= main_~i~0 1), 22888#(= main_~i~0 2), 22889#(= main_~i~0 3), 22890#(= main_~i~0 4), 22891#(= main_~i~0 5), 22892#(= main_~i~0 6), 22893#(= main_~i~0 7), 22894#(= main_~i~0 8), 22895#(= main_~i~0 9), 22896#(= main_~i~0 10), 22897#(= main_~i~0 11), 22898#(= main_~i~0 12), 22899#(= main_~i~0 13), 22900#(= main_~i~0 14), 22901#(= main_~i~0 15), 22902#(= main_~i~0 16), 22903#(= main_~i~0 17), 22904#(= main_~i~0 18), 22905#(= main_~i~0 19), 22906#(= main_~i~0 20), 22907#(= main_~i~0 21), 22908#(= main_~i~0 22), 22909#(= main_~i~0 23), 22910#(= main_~i~0 24), 22911#(= main_~i~0 25)] [2018-02-04 20:56:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:42,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 20:56:42,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 20:56:42,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 20:56:42,008 INFO L87 Difference]: Start difference. First operand 436 states and 437 transitions. Second operand 50 states. [2018-02-04 20:56:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:44,874 INFO L93 Difference]: Finished difference Result 445 states and 446 transitions. [2018-02-04 20:56:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 20:56:44,875 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 196 [2018-02-04 20:56:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:44,875 INFO L225 Difference]: With dead ends: 445 [2018-02-04 20:56:44,875 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 20:56:44,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 20:56:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 20:56:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-02-04 20:56:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 20:56:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-02-04 20:56:44,879 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 196 [2018-02-04 20:56:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:44,879 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-02-04 20:56:44,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 20:56:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-02-04 20:56:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-04 20:56:44,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:44,879 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:44,879 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1158845760, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:44,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:45,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:45,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 20:56:45,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:45,531 INFO L182 omatonBuilderFactory]: Interpolants [23824#true, 23825#false, 23828#(= main_~i~0 0), 23829#(= main_~i~0 1), 23830#(= main_~i~0 2), 23831#(= main_~i~0 3), 23832#(= main_~i~0 4), 23833#(= main_~i~0 5), 23834#(= main_~i~0 6), 23835#(= main_~i~0 7), 23836#(= main_~i~0 8), 23837#(= main_~i~0 9), 23838#(= main_~i~0 10), 23839#(= main_~i~0 11), 23840#(= main_~i~0 12), 23841#(= main_~i~0 13), 23842#(= main_~i~0 14), 23843#(= main_~i~0 15), 23844#(= main_~i~0 16), 23845#(= main_~i~0 17), 23846#(= main_~i~0 18), 23847#(= main_~i~0 19), 23848#(= main_~i~0 20), 23849#(= main_~i~0 21), 23850#(= main_~i~0 22), 23851#(= main_~i~0 23), 23852#(= main_~i~0 24), 23853#(= main_~i~0 25), 23854#(= main_~i~0 26), 23855#(= main_~i~0 27), 23856#(= main_~i~0 28), 23857#(= main_~i~0 29), 23858#(= main_~i~0 30), 23859#(= main_~i~0 31), 23860#(= main_~i~0 32), 23861#(= main_~i~0 33), 23862#(= main_~i~0 34), 23863#(= main_~i~0 35), 23864#(= main_~i~0 36), 23865#(= main_~i~0 37), 23866#(= main_~i~0 38), 23867#(= main_~i~0 39), 23868#(= main_~i~0 40), 23869#(= main_~i~0 41), 23870#(= main_~i~0 42), 23871#(= main_~i~0 43), 23872#(= main_~i~0 44), 23873#(= main_~i~0 45), 23874#(= main_~i~0 46), 23875#(= main_~i~0 47), 23876#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:45,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 20:56:45,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 20:56:45,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 20:56:45,532 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 51 states. [2018-02-04 20:56:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:48,540 INFO L93 Difference]: Finished difference Result 454 states and 455 transitions. [2018-02-04 20:56:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 20:56:48,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 200 [2018-02-04 20:56:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:48,541 INFO L225 Difference]: With dead ends: 454 [2018-02-04 20:56:48,541 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 20:56:48,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 20:56:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 20:56:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2018-02-04 20:56:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-04 20:56:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 455 transitions. [2018-02-04 20:56:48,544 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 455 transitions. Word has length 200 [2018-02-04 20:56:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:48,544 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 455 transitions. [2018-02-04 20:56:48,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 20:56:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 455 transitions. [2018-02-04 20:56:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 20:56:48,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:48,545 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:48,545 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1554258247, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:48,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:49,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:49,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 20:56:49,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:49,138 INFO L182 omatonBuilderFactory]: Interpolants [24832#(= main_~i~0 43), 24833#(= main_~i~0 44), 24834#(= main_~i~0 45), 24835#(= main_~i~0 46), 24836#(= main_~i~0 47), 24837#(= main_~i~0 48), 24838#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 24785#true, 24786#false, 24789#(= main_~i~0 0), 24790#(= main_~i~0 1), 24791#(= main_~i~0 2), 24792#(= main_~i~0 3), 24793#(= main_~i~0 4), 24794#(= main_~i~0 5), 24795#(= main_~i~0 6), 24796#(= main_~i~0 7), 24797#(= main_~i~0 8), 24798#(= main_~i~0 9), 24799#(= main_~i~0 10), 24800#(= main_~i~0 11), 24801#(= main_~i~0 12), 24802#(= main_~i~0 13), 24803#(= main_~i~0 14), 24804#(= main_~i~0 15), 24805#(= main_~i~0 16), 24806#(= main_~i~0 17), 24807#(= main_~i~0 18), 24808#(= main_~i~0 19), 24809#(= main_~i~0 20), 24810#(= main_~i~0 21), 24811#(= main_~i~0 22), 24812#(= main_~i~0 23), 24813#(= main_~i~0 24), 24814#(= main_~i~0 25), 24815#(= main_~i~0 26), 24816#(= main_~i~0 27), 24817#(= main_~i~0 28), 24818#(= main_~i~0 29), 24819#(= main_~i~0 30), 24820#(= main_~i~0 31), 24821#(= main_~i~0 32), 24822#(= main_~i~0 33), 24823#(= main_~i~0 34), 24824#(= main_~i~0 35), 24825#(= main_~i~0 36), 24826#(= main_~i~0 37), 24827#(= main_~i~0 38), 24828#(= main_~i~0 39), 24829#(= main_~i~0 40), 24830#(= main_~i~0 41), 24831#(= main_~i~0 42)] [2018-02-04 20:56:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:49,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 20:56:49,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 20:56:49,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 20:56:49,139 INFO L87 Difference]: Start difference. First operand 454 states and 455 transitions. Second operand 52 states. [2018-02-04 20:56:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:52,155 INFO L93 Difference]: Finished difference Result 463 states and 464 transitions. [2018-02-04 20:56:52,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 20:56:52,155 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 204 [2018-02-04 20:56:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:52,156 INFO L225 Difference]: With dead ends: 463 [2018-02-04 20:56:52,156 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 20:56:52,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 20:56:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 20:56:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-02-04 20:56:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-04 20:56:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-02-04 20:56:52,159 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 204 [2018-02-04 20:56:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:52,159 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-02-04 20:56:52,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 20:56:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-02-04 20:56:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 20:56:52,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:52,159 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:52,159 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 826135474, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:52,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:52,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:52,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 20:56:52,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:52,763 INFO L182 omatonBuilderFactory]: Interpolants [25765#true, 25766#false, 25769#(= main_~i~0 0), 25770#(= main_~i~0 1), 25771#(= main_~i~0 2), 25772#(= main_~i~0 3), 25773#(= main_~i~0 4), 25774#(= main_~i~0 5), 25775#(= main_~i~0 6), 25776#(= main_~i~0 7), 25777#(= main_~i~0 8), 25778#(= main_~i~0 9), 25779#(= main_~i~0 10), 25780#(= main_~i~0 11), 25781#(= main_~i~0 12), 25782#(= main_~i~0 13), 25783#(= main_~i~0 14), 25784#(= main_~i~0 15), 25785#(= main_~i~0 16), 25786#(= main_~i~0 17), 25787#(= main_~i~0 18), 25788#(= main_~i~0 19), 25789#(= main_~i~0 20), 25790#(= main_~i~0 21), 25791#(= main_~i~0 22), 25792#(= main_~i~0 23), 25793#(= main_~i~0 24), 25794#(= main_~i~0 25), 25795#(= main_~i~0 26), 25796#(= main_~i~0 27), 25797#(= main_~i~0 28), 25798#(= main_~i~0 29), 25799#(= main_~i~0 30), 25800#(= main_~i~0 31), 25801#(= main_~i~0 32), 25802#(= main_~i~0 33), 25803#(= main_~i~0 34), 25804#(= main_~i~0 35), 25805#(= main_~i~0 36), 25806#(= main_~i~0 37), 25807#(= main_~i~0 38), 25808#(= main_~i~0 39), 25809#(= main_~i~0 40), 25810#(= main_~i~0 41), 25811#(= main_~i~0 42), 25812#(= main_~i~0 43), 25813#(= main_~i~0 44), 25814#(= main_~i~0 45), 25815#(= main_~i~0 46), 25816#(= main_~i~0 47), 25817#(= main_~i~0 48), 25818#(= main_~i~0 49), 25819#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:52,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 20:56:52,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 20:56:52,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 20:56:52,764 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 53 states. [2018-02-04 20:56:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:56:56,015 INFO L93 Difference]: Finished difference Result 472 states and 473 transitions. [2018-02-04 20:56:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 20:56:56,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-02-04 20:56:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:56:56,061 INFO L225 Difference]: With dead ends: 472 [2018-02-04 20:56:56,061 INFO L226 Difference]: Without dead ends: 472 [2018-02-04 20:56:56,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 20:56:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-02-04 20:56:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2018-02-04 20:56:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-04 20:56:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2018-02-04 20:56:56,064 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 208 [2018-02-04 20:56:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:56:56,064 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2018-02-04 20:56:56,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 20:56:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2018-02-04 20:56:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 20:56:56,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:56:56,065 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 20:56:56,065 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:56:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash -234972117, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:56:56,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:56:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:56:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:56,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:56:56,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 20:56:56,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:56:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:56,687 INFO L182 omatonBuilderFactory]: Interpolants [26764#true, 26765#false, 26768#(= main_~i~0 0), 26769#(= main_~i~0 1), 26770#(= main_~i~0 2), 26771#(= main_~i~0 3), 26772#(= main_~i~0 4), 26773#(= main_~i~0 5), 26774#(= main_~i~0 6), 26775#(= main_~i~0 7), 26776#(= main_~i~0 8), 26777#(= main_~i~0 9), 26778#(= main_~i~0 10), 26779#(= main_~i~0 11), 26780#(= main_~i~0 12), 26781#(= main_~i~0 13), 26782#(= main_~i~0 14), 26783#(= main_~i~0 15), 26784#(= main_~i~0 16), 26785#(= main_~i~0 17), 26786#(= main_~i~0 18), 26787#(= main_~i~0 19), 26788#(= main_~i~0 20), 26789#(= main_~i~0 21), 26790#(= main_~i~0 22), 26791#(= main_~i~0 23), 26792#(= main_~i~0 24), 26793#(= main_~i~0 25), 26794#(= main_~i~0 26), 26795#(= main_~i~0 27), 26796#(= main_~i~0 28), 26797#(= main_~i~0 29), 26798#(= main_~i~0 30), 26799#(= main_~i~0 31), 26800#(= main_~i~0 32), 26801#(= main_~i~0 33), 26802#(= main_~i~0 34), 26803#(= main_~i~0 35), 26804#(= main_~i~0 36), 26805#(= main_~i~0 37), 26806#(= main_~i~0 38), 26807#(= main_~i~0 39), 26808#(= main_~i~0 40), 26809#(= main_~i~0 41), 26810#(= main_~i~0 42), 26811#(= main_~i~0 43), 26812#(= main_~i~0 44), 26813#(= main_~i~0 45), 26814#(= main_~i~0 46), 26815#(= main_~i~0 47), 26816#(= main_~i~0 48), 26817#(= main_~i~0 49), 26818#(= main_~i~0 50), 26819#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:56:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:56:56,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 20:56:56,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 20:56:56,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 20:56:56,688 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 54 states. [2018-02-04 20:57:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:00,065 INFO L93 Difference]: Finished difference Result 481 states and 482 transitions. [2018-02-04 20:57:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 20:57:00,065 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 212 [2018-02-04 20:57:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:00,066 INFO L225 Difference]: With dead ends: 481 [2018-02-04 20:57:00,066 INFO L226 Difference]: Without dead ends: 481 [2018-02-04 20:57:00,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 20:57:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-02-04 20:57:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2018-02-04 20:57:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-02-04 20:57:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2018-02-04 20:57:00,068 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 212 [2018-02-04 20:57:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:00,069 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2018-02-04 20:57:00,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 20:57:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2018-02-04 20:57:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-02-04 20:57:00,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:00,069 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:00,069 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:00,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1539604516, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:00,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:00,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:00,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 20:57:00,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:00,726 INFO L182 omatonBuilderFactory]: Interpolants [27782#true, 27783#false, 27786#(= main_~i~0 0), 27787#(= main_~i~0 1), 27788#(= main_~i~0 2), 27789#(= main_~i~0 3), 27790#(= main_~i~0 4), 27791#(= main_~i~0 5), 27792#(= main_~i~0 6), 27793#(= main_~i~0 7), 27794#(= main_~i~0 8), 27795#(= main_~i~0 9), 27796#(= main_~i~0 10), 27797#(= main_~i~0 11), 27798#(= main_~i~0 12), 27799#(= main_~i~0 13), 27800#(= main_~i~0 14), 27801#(= main_~i~0 15), 27802#(= main_~i~0 16), 27803#(= main_~i~0 17), 27804#(= main_~i~0 18), 27805#(= main_~i~0 19), 27806#(= main_~i~0 20), 27807#(= main_~i~0 21), 27808#(= main_~i~0 22), 27809#(= main_~i~0 23), 27810#(= main_~i~0 24), 27811#(= main_~i~0 25), 27812#(= main_~i~0 26), 27813#(= main_~i~0 27), 27814#(= main_~i~0 28), 27815#(= main_~i~0 29), 27816#(= main_~i~0 30), 27817#(= main_~i~0 31), 27818#(= main_~i~0 32), 27819#(= main_~i~0 33), 27820#(= main_~i~0 34), 27821#(= main_~i~0 35), 27822#(= main_~i~0 36), 27823#(= main_~i~0 37), 27824#(= main_~i~0 38), 27825#(= main_~i~0 39), 27826#(= main_~i~0 40), 27827#(= main_~i~0 41), 27828#(= main_~i~0 42), 27829#(= main_~i~0 43), 27830#(= main_~i~0 44), 27831#(= main_~i~0 45), 27832#(= main_~i~0 46), 27833#(= main_~i~0 47), 27834#(= main_~i~0 48), 27835#(= main_~i~0 49), 27836#(= main_~i~0 50), 27837#(= main_~i~0 51), 27838#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:00,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 20:57:00,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 20:57:00,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 20:57:00,727 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 55 states. [2018-02-04 20:57:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:04,423 INFO L93 Difference]: Finished difference Result 490 states and 491 transitions. [2018-02-04 20:57:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 20:57:04,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 216 [2018-02-04 20:57:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:04,424 INFO L225 Difference]: With dead ends: 490 [2018-02-04 20:57:04,424 INFO L226 Difference]: Without dead ends: 490 [2018-02-04 20:57:04,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 20:57:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-04 20:57:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2018-02-04 20:57:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-04 20:57:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 491 transitions. [2018-02-04 20:57:04,428 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 491 transitions. Word has length 216 [2018-02-04 20:57:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:04,428 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 491 transitions. [2018-02-04 20:57:04,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 20:57:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 491 transitions. [2018-02-04 20:57:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-04 20:57:04,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:04,430 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:04,430 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash -409616483, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:04,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:05,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:05,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 20:57:05,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:05,098 INFO L182 omatonBuilderFactory]: Interpolants [28819#true, 28820#false, 28823#(= main_~i~0 0), 28824#(= main_~i~0 1), 28825#(= main_~i~0 2), 28826#(= main_~i~0 3), 28827#(= main_~i~0 4), 28828#(= main_~i~0 5), 28829#(= main_~i~0 6), 28830#(= main_~i~0 7), 28831#(= main_~i~0 8), 28832#(= main_~i~0 9), 28833#(= main_~i~0 10), 28834#(= main_~i~0 11), 28835#(= main_~i~0 12), 28836#(= main_~i~0 13), 28837#(= main_~i~0 14), 28838#(= main_~i~0 15), 28839#(= main_~i~0 16), 28840#(= main_~i~0 17), 28841#(= main_~i~0 18), 28842#(= main_~i~0 19), 28843#(= main_~i~0 20), 28844#(= main_~i~0 21), 28845#(= main_~i~0 22), 28846#(= main_~i~0 23), 28847#(= main_~i~0 24), 28848#(= main_~i~0 25), 28849#(= main_~i~0 26), 28850#(= main_~i~0 27), 28851#(= main_~i~0 28), 28852#(= main_~i~0 29), 28853#(= main_~i~0 30), 28854#(= main_~i~0 31), 28855#(= main_~i~0 32), 28856#(= main_~i~0 33), 28857#(= main_~i~0 34), 28858#(= main_~i~0 35), 28859#(= main_~i~0 36), 28860#(= main_~i~0 37), 28861#(= main_~i~0 38), 28862#(= main_~i~0 39), 28863#(= main_~i~0 40), 28864#(= main_~i~0 41), 28865#(= main_~i~0 42), 28866#(= main_~i~0 43), 28867#(= main_~i~0 44), 28868#(= main_~i~0 45), 28869#(= main_~i~0 46), 28870#(= main_~i~0 47), 28871#(= main_~i~0 48), 28872#(= main_~i~0 49), 28873#(= main_~i~0 50), 28874#(= main_~i~0 51), 28875#(= main_~i~0 52), 28876#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:05,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 20:57:05,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 20:57:05,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 20:57:05,099 INFO L87 Difference]: Start difference. First operand 490 states and 491 transitions. Second operand 56 states. [2018-02-04 20:57:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:08,712 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-02-04 20:57:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 20:57:08,713 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 220 [2018-02-04 20:57:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:08,713 INFO L225 Difference]: With dead ends: 499 [2018-02-04 20:57:08,714 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 20:57:08,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 20:57:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 20:57:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-02-04 20:57:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 20:57:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 500 transitions. [2018-02-04 20:57:08,716 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 500 transitions. Word has length 220 [2018-02-04 20:57:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:08,716 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 500 transitions. [2018-02-04 20:57:08,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 20:57:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 500 transitions. [2018-02-04 20:57:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-04 20:57:08,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:08,717 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:08,717 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1588028778, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:08,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:09,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:09,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 20:57:09,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:09,394 INFO L182 omatonBuilderFactory]: Interpolants [29875#true, 29876#false, 29879#(= main_~i~0 0), 29880#(= main_~i~0 1), 29881#(= main_~i~0 2), 29882#(= main_~i~0 3), 29883#(= main_~i~0 4), 29884#(= main_~i~0 5), 29885#(= main_~i~0 6), 29886#(= main_~i~0 7), 29887#(= main_~i~0 8), 29888#(= main_~i~0 9), 29889#(= main_~i~0 10), 29890#(= main_~i~0 11), 29891#(= main_~i~0 12), 29892#(= main_~i~0 13), 29893#(= main_~i~0 14), 29894#(= main_~i~0 15), 29895#(= main_~i~0 16), 29896#(= main_~i~0 17), 29897#(= main_~i~0 18), 29898#(= main_~i~0 19), 29899#(= main_~i~0 20), 29900#(= main_~i~0 21), 29901#(= main_~i~0 22), 29902#(= main_~i~0 23), 29903#(= main_~i~0 24), 29904#(= main_~i~0 25), 29905#(= main_~i~0 26), 29906#(= main_~i~0 27), 29907#(= main_~i~0 28), 29908#(= main_~i~0 29), 29909#(= main_~i~0 30), 29910#(= main_~i~0 31), 29911#(= main_~i~0 32), 29912#(= main_~i~0 33), 29913#(= main_~i~0 34), 29914#(= main_~i~0 35), 29915#(= main_~i~0 36), 29916#(= main_~i~0 37), 29917#(= main_~i~0 38), 29918#(= main_~i~0 39), 29919#(= main_~i~0 40), 29920#(= main_~i~0 41), 29921#(= main_~i~0 42), 29922#(= main_~i~0 43), 29923#(= main_~i~0 44), 29924#(= main_~i~0 45), 29925#(= main_~i~0 46), 29926#(= main_~i~0 47), 29927#(= main_~i~0 48), 29928#(= main_~i~0 49), 29929#(= main_~i~0 50), 29930#(= main_~i~0 51), 29931#(= main_~i~0 52), 29932#(= main_~i~0 53), 29933#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:09,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 20:57:09,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 20:57:09,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 20:57:09,395 INFO L87 Difference]: Start difference. First operand 499 states and 500 transitions. Second operand 57 states. [2018-02-04 20:57:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:13,153 INFO L93 Difference]: Finished difference Result 508 states and 509 transitions. [2018-02-04 20:57:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 20:57:13,153 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 224 [2018-02-04 20:57:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:13,154 INFO L225 Difference]: With dead ends: 508 [2018-02-04 20:57:13,154 INFO L226 Difference]: Without dead ends: 508 [2018-02-04 20:57:13,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 20:57:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-04 20:57:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-02-04 20:57:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 20:57:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2018-02-04 20:57:13,157 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 224 [2018-02-04 20:57:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:13,157 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2018-02-04 20:57:13,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 20:57:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2018-02-04 20:57:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-04 20:57:13,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:13,158 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:13,158 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1210887921, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:13,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:13,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:13,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 20:57:13,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:13,878 INFO L182 omatonBuilderFactory]: Interpolants [30976#(= main_~i~0 22), 30977#(= main_~i~0 23), 30978#(= main_~i~0 24), 30979#(= main_~i~0 25), 30980#(= main_~i~0 26), 30981#(= main_~i~0 27), 30982#(= main_~i~0 28), 30983#(= main_~i~0 29), 30984#(= main_~i~0 30), 30985#(= main_~i~0 31), 30986#(= main_~i~0 32), 30987#(= main_~i~0 33), 30988#(= main_~i~0 34), 30989#(= main_~i~0 35), 30990#(= main_~i~0 36), 30991#(= main_~i~0 37), 30992#(= main_~i~0 38), 30993#(= main_~i~0 39), 30994#(= main_~i~0 40), 30995#(= main_~i~0 41), 30996#(= main_~i~0 42), 30997#(= main_~i~0 43), 30998#(= main_~i~0 44), 30999#(= main_~i~0 45), 31000#(= main_~i~0 46), 31001#(= main_~i~0 47), 31002#(= main_~i~0 48), 31003#(= main_~i~0 49), 31004#(= main_~i~0 50), 31005#(= main_~i~0 51), 31006#(= main_~i~0 52), 31007#(= main_~i~0 53), 31008#(= main_~i~0 54), 31009#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 30950#true, 30951#false, 30954#(= main_~i~0 0), 30955#(= main_~i~0 1), 30956#(= main_~i~0 2), 30957#(= main_~i~0 3), 30958#(= main_~i~0 4), 30959#(= main_~i~0 5), 30960#(= main_~i~0 6), 30961#(= main_~i~0 7), 30962#(= main_~i~0 8), 30963#(= main_~i~0 9), 30964#(= main_~i~0 10), 30965#(= main_~i~0 11), 30966#(= main_~i~0 12), 30967#(= main_~i~0 13), 30968#(= main_~i~0 14), 30969#(= main_~i~0 15), 30970#(= main_~i~0 16), 30971#(= main_~i~0 17), 30972#(= main_~i~0 18), 30973#(= main_~i~0 19), 30974#(= main_~i~0 20), 30975#(= main_~i~0 21)] [2018-02-04 20:57:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:13,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 20:57:13,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 20:57:13,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 20:57:13,878 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 58 states. [2018-02-04 20:57:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:17,779 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-02-04 20:57:17,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 20:57:17,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 228 [2018-02-04 20:57:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:17,780 INFO L225 Difference]: With dead ends: 517 [2018-02-04 20:57:17,780 INFO L226 Difference]: Without dead ends: 517 [2018-02-04 20:57:17,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 20:57:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-04 20:57:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2018-02-04 20:57:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-02-04 20:57:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 518 transitions. [2018-02-04 20:57:17,783 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 518 transitions. Word has length 228 [2018-02-04 20:57:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:17,783 INFO L432 AbstractCegarLoop]: Abstraction has 517 states and 518 transitions. [2018-02-04 20:57:17,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 20:57:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 518 transitions. [2018-02-04 20:57:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 20:57:17,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:17,784 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:17,784 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 212607752, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:17,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:18,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:18,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 20:57:18,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:18,551 INFO L182 omatonBuilderFactory]: Interpolants [32044#true, 32045#false, 32048#(= main_~i~0 0), 32049#(= main_~i~0 1), 32050#(= main_~i~0 2), 32051#(= main_~i~0 3), 32052#(= main_~i~0 4), 32053#(= main_~i~0 5), 32054#(= main_~i~0 6), 32055#(= main_~i~0 7), 32056#(= main_~i~0 8), 32057#(= main_~i~0 9), 32058#(= main_~i~0 10), 32059#(= main_~i~0 11), 32060#(= main_~i~0 12), 32061#(= main_~i~0 13), 32062#(= main_~i~0 14), 32063#(= main_~i~0 15), 32064#(= main_~i~0 16), 32065#(= main_~i~0 17), 32066#(= main_~i~0 18), 32067#(= main_~i~0 19), 32068#(= main_~i~0 20), 32069#(= main_~i~0 21), 32070#(= main_~i~0 22), 32071#(= main_~i~0 23), 32072#(= main_~i~0 24), 32073#(= main_~i~0 25), 32074#(= main_~i~0 26), 32075#(= main_~i~0 27), 32076#(= main_~i~0 28), 32077#(= main_~i~0 29), 32078#(= main_~i~0 30), 32079#(= main_~i~0 31), 32080#(= main_~i~0 32), 32081#(= main_~i~0 33), 32082#(= main_~i~0 34), 32083#(= main_~i~0 35), 32084#(= main_~i~0 36), 32085#(= main_~i~0 37), 32086#(= main_~i~0 38), 32087#(= main_~i~0 39), 32088#(= main_~i~0 40), 32089#(= main_~i~0 41), 32090#(= main_~i~0 42), 32091#(= main_~i~0 43), 32092#(= main_~i~0 44), 32093#(= main_~i~0 45), 32094#(= main_~i~0 46), 32095#(= main_~i~0 47), 32096#(= main_~i~0 48), 32097#(= main_~i~0 49), 32098#(= main_~i~0 50), 32099#(= main_~i~0 51), 32100#(= main_~i~0 52), 32101#(= main_~i~0 53), 32102#(= main_~i~0 54), 32103#(= main_~i~0 55), 32104#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:18,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 20:57:18,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 20:57:18,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 20:57:18,552 INFO L87 Difference]: Start difference. First operand 517 states and 518 transitions. Second operand 59 states. [2018-02-04 20:57:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:22,542 INFO L93 Difference]: Finished difference Result 526 states and 527 transitions. [2018-02-04 20:57:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 20:57:22,542 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 232 [2018-02-04 20:57:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:22,543 INFO L225 Difference]: With dead ends: 526 [2018-02-04 20:57:22,543 INFO L226 Difference]: Without dead ends: 526 [2018-02-04 20:57:22,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 20:57:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-02-04 20:57:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2018-02-04 20:57:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-04 20:57:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 527 transitions. [2018-02-04 20:57:22,546 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 527 transitions. Word has length 232 [2018-02-04 20:57:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:22,546 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 527 transitions. [2018-02-04 20:57:22,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 20:57:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 527 transitions. [2018-02-04 20:57:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-04 20:57:22,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:22,547 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:22,547 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -999731071, now seen corresponding path program 57 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:22,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:23,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:23,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 20:57:23,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:23,320 INFO L182 omatonBuilderFactory]: Interpolants [33157#true, 33158#false, 33161#(= main_~i~0 0), 33162#(= main_~i~0 1), 33163#(= main_~i~0 2), 33164#(= main_~i~0 3), 33165#(= main_~i~0 4), 33166#(= main_~i~0 5), 33167#(= main_~i~0 6), 33168#(= main_~i~0 7), 33169#(= main_~i~0 8), 33170#(= main_~i~0 9), 33171#(= main_~i~0 10), 33172#(= main_~i~0 11), 33173#(= main_~i~0 12), 33174#(= main_~i~0 13), 33175#(= main_~i~0 14), 33176#(= main_~i~0 15), 33177#(= main_~i~0 16), 33178#(= main_~i~0 17), 33179#(= main_~i~0 18), 33180#(= main_~i~0 19), 33181#(= main_~i~0 20), 33182#(= main_~i~0 21), 33183#(= main_~i~0 22), 33184#(= main_~i~0 23), 33185#(= main_~i~0 24), 33186#(= main_~i~0 25), 33187#(= main_~i~0 26), 33188#(= main_~i~0 27), 33189#(= main_~i~0 28), 33190#(= main_~i~0 29), 33191#(= main_~i~0 30), 33192#(= main_~i~0 31), 33193#(= main_~i~0 32), 33194#(= main_~i~0 33), 33195#(= main_~i~0 34), 33196#(= main_~i~0 35), 33197#(= main_~i~0 36), 33198#(= main_~i~0 37), 33199#(= main_~i~0 38), 33200#(= main_~i~0 39), 33201#(= main_~i~0 40), 33202#(= main_~i~0 41), 33203#(= main_~i~0 42), 33204#(= main_~i~0 43), 33205#(= main_~i~0 44), 33206#(= main_~i~0 45), 33207#(= main_~i~0 46), 33208#(= main_~i~0 47), 33209#(= main_~i~0 48), 33210#(= main_~i~0 49), 33211#(= main_~i~0 50), 33212#(= main_~i~0 51), 33213#(= main_~i~0 52), 33214#(= main_~i~0 53), 33215#(= main_~i~0 54), 33216#(= main_~i~0 55), 33217#(= main_~i~0 56), 33218#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:23,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 20:57:23,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 20:57:23,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 20:57:23,321 INFO L87 Difference]: Start difference. First operand 526 states and 527 transitions. Second operand 60 states. [2018-02-04 20:57:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:27,472 INFO L93 Difference]: Finished difference Result 535 states and 536 transitions. [2018-02-04 20:57:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 20:57:27,472 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 236 [2018-02-04 20:57:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:27,473 INFO L225 Difference]: With dead ends: 535 [2018-02-04 20:57:27,473 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 20:57:27,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 20:57:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 20:57:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-02-04 20:57:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-02-04 20:57:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-02-04 20:57:27,475 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 236 [2018-02-04 20:57:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:27,476 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-02-04 20:57:27,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 20:57:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-02-04 20:57:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-04 20:57:27,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:27,476 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:27,476 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:27,476 INFO L82 PathProgramCache]: Analyzing trace with hash -697230982, now seen corresponding path program 58 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:27,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:28,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:28,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 20:57:28,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:28,250 INFO L182 omatonBuilderFactory]: Interpolants [34304#(= main_~i~0 11), 34305#(= main_~i~0 12), 34306#(= main_~i~0 13), 34307#(= main_~i~0 14), 34308#(= main_~i~0 15), 34309#(= main_~i~0 16), 34310#(= main_~i~0 17), 34311#(= main_~i~0 18), 34312#(= main_~i~0 19), 34313#(= main_~i~0 20), 34314#(= main_~i~0 21), 34315#(= main_~i~0 22), 34316#(= main_~i~0 23), 34317#(= main_~i~0 24), 34318#(= main_~i~0 25), 34319#(= main_~i~0 26), 34320#(= main_~i~0 27), 34321#(= main_~i~0 28), 34322#(= main_~i~0 29), 34323#(= main_~i~0 30), 34324#(= main_~i~0 31), 34325#(= main_~i~0 32), 34326#(= main_~i~0 33), 34327#(= main_~i~0 34), 34328#(= main_~i~0 35), 34329#(= main_~i~0 36), 34330#(= main_~i~0 37), 34331#(= main_~i~0 38), 34332#(= main_~i~0 39), 34333#(= main_~i~0 40), 34334#(= main_~i~0 41), 34335#(= main_~i~0 42), 34336#(= main_~i~0 43), 34337#(= main_~i~0 44), 34338#(= main_~i~0 45), 34339#(= main_~i~0 46), 34340#(= main_~i~0 47), 34341#(= main_~i~0 48), 34342#(= main_~i~0 49), 34343#(= main_~i~0 50), 34344#(= main_~i~0 51), 34345#(= main_~i~0 52), 34346#(= main_~i~0 53), 34347#(= main_~i~0 54), 34348#(= main_~i~0 55), 34349#(= main_~i~0 56), 34350#(= main_~i~0 57), 34351#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 34289#true, 34290#false, 34293#(= main_~i~0 0), 34294#(= main_~i~0 1), 34295#(= main_~i~0 2), 34296#(= main_~i~0 3), 34297#(= main_~i~0 4), 34298#(= main_~i~0 5), 34299#(= main_~i~0 6), 34300#(= main_~i~0 7), 34301#(= main_~i~0 8), 34302#(= main_~i~0 9), 34303#(= main_~i~0 10)] [2018-02-04 20:57:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:28,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 20:57:28,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 20:57:28,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 20:57:28,251 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 61 states. [2018-02-04 20:57:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:32,630 INFO L93 Difference]: Finished difference Result 544 states and 545 transitions. [2018-02-04 20:57:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 20:57:32,630 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 240 [2018-02-04 20:57:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:32,631 INFO L225 Difference]: With dead ends: 544 [2018-02-04 20:57:32,631 INFO L226 Difference]: Without dead ends: 544 [2018-02-04 20:57:32,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 20:57:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-02-04 20:57:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2018-02-04 20:57:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-04 20:57:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2018-02-04 20:57:32,634 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 240 [2018-02-04 20:57:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:32,634 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2018-02-04 20:57:32,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 20:57:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2018-02-04 20:57:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-02-04 20:57:32,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:32,635 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:32,635 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1660305933, now seen corresponding path program 59 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:32,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:33,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:33,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 20:57:33,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:33,446 INFO L182 omatonBuilderFactory]: Interpolants [35456#(= main_~i~0 12), 35457#(= main_~i~0 13), 35458#(= main_~i~0 14), 35459#(= main_~i~0 15), 35460#(= main_~i~0 16), 35461#(= main_~i~0 17), 35462#(= main_~i~0 18), 35463#(= main_~i~0 19), 35464#(= main_~i~0 20), 35465#(= main_~i~0 21), 35466#(= main_~i~0 22), 35467#(= main_~i~0 23), 35468#(= main_~i~0 24), 35469#(= main_~i~0 25), 35470#(= main_~i~0 26), 35471#(= main_~i~0 27), 35472#(= main_~i~0 28), 35473#(= main_~i~0 29), 35474#(= main_~i~0 30), 35475#(= main_~i~0 31), 35476#(= main_~i~0 32), 35477#(= main_~i~0 33), 35478#(= main_~i~0 34), 35479#(= main_~i~0 35), 35480#(= main_~i~0 36), 35481#(= main_~i~0 37), 35482#(= main_~i~0 38), 35483#(= main_~i~0 39), 35484#(= main_~i~0 40), 35485#(= main_~i~0 41), 35486#(= main_~i~0 42), 35487#(= main_~i~0 43), 35488#(= main_~i~0 44), 35489#(= main_~i~0 45), 35490#(= main_~i~0 46), 35491#(= main_~i~0 47), 35492#(= main_~i~0 48), 35493#(= main_~i~0 49), 35494#(= main_~i~0 50), 35495#(= main_~i~0 51), 35496#(= main_~i~0 52), 35497#(= main_~i~0 53), 35498#(= main_~i~0 54), 35499#(= main_~i~0 55), 35500#(= main_~i~0 56), 35501#(= main_~i~0 57), 35502#(= main_~i~0 58), 35503#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 35440#true, 35441#false, 35444#(= main_~i~0 0), 35445#(= main_~i~0 1), 35446#(= main_~i~0 2), 35447#(= main_~i~0 3), 35448#(= main_~i~0 4), 35449#(= main_~i~0 5), 35450#(= main_~i~0 6), 35451#(= main_~i~0 7), 35452#(= main_~i~0 8), 35453#(= main_~i~0 9), 35454#(= main_~i~0 10), 35455#(= main_~i~0 11)] [2018-02-04 20:57:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:33,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 20:57:33,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 20:57:33,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 20:57:33,447 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 62 states. [2018-02-04 20:57:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:37,910 INFO L93 Difference]: Finished difference Result 553 states and 554 transitions. [2018-02-04 20:57:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 20:57:37,911 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 244 [2018-02-04 20:57:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:37,912 INFO L225 Difference]: With dead ends: 553 [2018-02-04 20:57:37,912 INFO L226 Difference]: Without dead ends: 553 [2018-02-04 20:57:37,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 20:57:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-02-04 20:57:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-02-04 20:57:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-02-04 20:57:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 554 transitions. [2018-02-04 20:57:37,914 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 554 transitions. Word has length 244 [2018-02-04 20:57:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:37,914 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 554 transitions. [2018-02-04 20:57:37,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 20:57:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 554 transitions. [2018-02-04 20:57:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-04 20:57:37,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:37,915 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:37,915 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1700363756, now seen corresponding path program 60 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:37,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:38,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:38,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 20:57:38,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:38,736 INFO L182 omatonBuilderFactory]: Interpolants [36610#true, 36611#false, 36614#(= main_~i~0 0), 36615#(= main_~i~0 1), 36616#(= main_~i~0 2), 36617#(= main_~i~0 3), 36618#(= main_~i~0 4), 36619#(= main_~i~0 5), 36620#(= main_~i~0 6), 36621#(= main_~i~0 7), 36622#(= main_~i~0 8), 36623#(= main_~i~0 9), 36624#(= main_~i~0 10), 36625#(= main_~i~0 11), 36626#(= main_~i~0 12), 36627#(= main_~i~0 13), 36628#(= main_~i~0 14), 36629#(= main_~i~0 15), 36630#(= main_~i~0 16), 36631#(= main_~i~0 17), 36632#(= main_~i~0 18), 36633#(= main_~i~0 19), 36634#(= main_~i~0 20), 36635#(= main_~i~0 21), 36636#(= main_~i~0 22), 36637#(= main_~i~0 23), 36638#(= main_~i~0 24), 36639#(= main_~i~0 25), 36640#(= main_~i~0 26), 36641#(= main_~i~0 27), 36642#(= main_~i~0 28), 36643#(= main_~i~0 29), 36644#(= main_~i~0 30), 36645#(= main_~i~0 31), 36646#(= main_~i~0 32), 36647#(= main_~i~0 33), 36648#(= main_~i~0 34), 36649#(= main_~i~0 35), 36650#(= main_~i~0 36), 36651#(= main_~i~0 37), 36652#(= main_~i~0 38), 36653#(= main_~i~0 39), 36654#(= main_~i~0 40), 36655#(= main_~i~0 41), 36656#(= main_~i~0 42), 36657#(= main_~i~0 43), 36658#(= main_~i~0 44), 36659#(= main_~i~0 45), 36660#(= main_~i~0 46), 36661#(= main_~i~0 47), 36662#(= main_~i~0 48), 36663#(= main_~i~0 49), 36664#(= main_~i~0 50), 36665#(= main_~i~0 51), 36666#(= main_~i~0 52), 36667#(= main_~i~0 53), 36668#(= main_~i~0 54), 36669#(= main_~i~0 55), 36670#(= main_~i~0 56), 36671#(= main_~i~0 57), 36672#(= main_~i~0 58), 36673#(= main_~i~0 59), 36674#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:38,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 20:57:38,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 20:57:38,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 20:57:38,737 INFO L87 Difference]: Start difference. First operand 553 states and 554 transitions. Second operand 63 states. [2018-02-04 20:57:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:43,690 INFO L93 Difference]: Finished difference Result 562 states and 563 transitions. [2018-02-04 20:57:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 20:57:43,691 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2018-02-04 20:57:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:43,692 INFO L225 Difference]: With dead ends: 562 [2018-02-04 20:57:43,692 INFO L226 Difference]: Without dead ends: 562 [2018-02-04 20:57:43,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 20:57:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-04 20:57:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-02-04 20:57:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-02-04 20:57:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 563 transitions. [2018-02-04 20:57:43,694 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 563 transitions. Word has length 248 [2018-02-04 20:57:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:43,695 INFO L432 AbstractCegarLoop]: Abstraction has 562 states and 563 transitions. [2018-02-04 20:57:43,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 20:57:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 563 transitions. [2018-02-04 20:57:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 20:57:43,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:43,695 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:43,695 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -10053275, now seen corresponding path program 61 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:43,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:44,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:44,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 20:57:44,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:44,557 INFO L182 omatonBuilderFactory]: Interpolants [37799#true, 37800#false, 37803#(= main_~i~0 0), 37804#(= main_~i~0 1), 37805#(= main_~i~0 2), 37806#(= main_~i~0 3), 37807#(= main_~i~0 4), 37808#(= main_~i~0 5), 37809#(= main_~i~0 6), 37810#(= main_~i~0 7), 37811#(= main_~i~0 8), 37812#(= main_~i~0 9), 37813#(= main_~i~0 10), 37814#(= main_~i~0 11), 37815#(= main_~i~0 12), 37816#(= main_~i~0 13), 37817#(= main_~i~0 14), 37818#(= main_~i~0 15), 37819#(= main_~i~0 16), 37820#(= main_~i~0 17), 37821#(= main_~i~0 18), 37822#(= main_~i~0 19), 37823#(= main_~i~0 20), 37824#(= main_~i~0 21), 37825#(= main_~i~0 22), 37826#(= main_~i~0 23), 37827#(= main_~i~0 24), 37828#(= main_~i~0 25), 37829#(= main_~i~0 26), 37830#(= main_~i~0 27), 37831#(= main_~i~0 28), 37832#(= main_~i~0 29), 37833#(= main_~i~0 30), 37834#(= main_~i~0 31), 37835#(= main_~i~0 32), 37836#(= main_~i~0 33), 37837#(= main_~i~0 34), 37838#(= main_~i~0 35), 37839#(= main_~i~0 36), 37840#(= main_~i~0 37), 37841#(= main_~i~0 38), 37842#(= main_~i~0 39), 37843#(= main_~i~0 40), 37844#(= main_~i~0 41), 37845#(= main_~i~0 42), 37846#(= main_~i~0 43), 37847#(= main_~i~0 44), 37848#(= main_~i~0 45), 37849#(= main_~i~0 46), 37850#(= main_~i~0 47), 37851#(= main_~i~0 48), 37852#(= main_~i~0 49), 37853#(= main_~i~0 50), 37854#(= main_~i~0 51), 37855#(= main_~i~0 52), 37856#(= main_~i~0 53), 37857#(= main_~i~0 54), 37858#(= main_~i~0 55), 37859#(= main_~i~0 56), 37860#(= main_~i~0 57), 37861#(= main_~i~0 58), 37862#(= main_~i~0 59), 37863#(= main_~i~0 60), 37864#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:44,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 20:57:44,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 20:57:44,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 20:57:44,559 INFO L87 Difference]: Start difference. First operand 562 states and 563 transitions. Second operand 64 states. [2018-02-04 20:57:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:49,345 INFO L93 Difference]: Finished difference Result 571 states and 572 transitions. [2018-02-04 20:57:49,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 20:57:49,346 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 252 [2018-02-04 20:57:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:49,347 INFO L225 Difference]: With dead ends: 571 [2018-02-04 20:57:49,347 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 20:57:49,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 20:57:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 20:57:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2018-02-04 20:57:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-02-04 20:57:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 572 transitions. [2018-02-04 20:57:49,349 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 572 transitions. Word has length 252 [2018-02-04 20:57:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:49,349 INFO L432 AbstractCegarLoop]: Abstraction has 571 states and 572 transitions. [2018-02-04 20:57:49,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 20:57:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 572 transitions. [2018-02-04 20:57:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-02-04 20:57:49,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:49,350 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:49,350 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1310150750, now seen corresponding path program 62 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:49,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:50,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:50,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 20:57:50,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:50,232 INFO L182 omatonBuilderFactory]: Interpolants [39040#(= main_~i~0 29), 39041#(= main_~i~0 30), 39042#(= main_~i~0 31), 39043#(= main_~i~0 32), 39044#(= main_~i~0 33), 39045#(= main_~i~0 34), 39046#(= main_~i~0 35), 39047#(= main_~i~0 36), 39048#(= main_~i~0 37), 39049#(= main_~i~0 38), 39050#(= main_~i~0 39), 39051#(= main_~i~0 40), 39052#(= main_~i~0 41), 39053#(= main_~i~0 42), 39054#(= main_~i~0 43), 39055#(= main_~i~0 44), 39056#(= main_~i~0 45), 39057#(= main_~i~0 46), 39058#(= main_~i~0 47), 39059#(= main_~i~0 48), 39060#(= main_~i~0 49), 39061#(= main_~i~0 50), 39062#(= main_~i~0 51), 39063#(= main_~i~0 52), 39064#(= main_~i~0 53), 39065#(= main_~i~0 54), 39066#(= main_~i~0 55), 39067#(= main_~i~0 56), 39068#(= main_~i~0 57), 39069#(= main_~i~0 58), 39070#(= main_~i~0 59), 39071#(= main_~i~0 60), 39072#(= main_~i~0 61), 39073#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 39007#true, 39008#false, 39011#(= main_~i~0 0), 39012#(= main_~i~0 1), 39013#(= main_~i~0 2), 39014#(= main_~i~0 3), 39015#(= main_~i~0 4), 39016#(= main_~i~0 5), 39017#(= main_~i~0 6), 39018#(= main_~i~0 7), 39019#(= main_~i~0 8), 39020#(= main_~i~0 9), 39021#(= main_~i~0 10), 39022#(= main_~i~0 11), 39023#(= main_~i~0 12), 39024#(= main_~i~0 13), 39025#(= main_~i~0 14), 39026#(= main_~i~0 15), 39027#(= main_~i~0 16), 39028#(= main_~i~0 17), 39029#(= main_~i~0 18), 39030#(= main_~i~0 19), 39031#(= main_~i~0 20), 39032#(= main_~i~0 21), 39033#(= main_~i~0 22), 39034#(= main_~i~0 23), 39035#(= main_~i~0 24), 39036#(= main_~i~0 25), 39037#(= main_~i~0 26), 39038#(= main_~i~0 27), 39039#(= main_~i~0 28)] [2018-02-04 20:57:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:50,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 20:57:50,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 20:57:50,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 20:57:50,233 INFO L87 Difference]: Start difference. First operand 571 states and 572 transitions. Second operand 65 states. [2018-02-04 20:57:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:57:55,112 INFO L93 Difference]: Finished difference Result 580 states and 581 transitions. [2018-02-04 20:57:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 20:57:55,112 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2018-02-04 20:57:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:57:55,113 INFO L225 Difference]: With dead ends: 580 [2018-02-04 20:57:55,113 INFO L226 Difference]: Without dead ends: 580 [2018-02-04 20:57:55,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 20:57:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-02-04 20:57:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2018-02-04 20:57:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-02-04 20:57:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 581 transitions. [2018-02-04 20:57:55,116 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 581 transitions. Word has length 256 [2018-02-04 20:57:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:57:55,116 INFO L432 AbstractCegarLoop]: Abstraction has 580 states and 581 transitions. [2018-02-04 20:57:55,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 20:57:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 581 transitions. [2018-02-04 20:57:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-02-04 20:57:55,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:57:55,117 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 20:57:55,117 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:57:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash -684596521, now seen corresponding path program 63 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:57:55,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:57:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:57:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:56,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:57:56,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 20:57:56,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:57:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:56,040 INFO L182 omatonBuilderFactory]: Interpolants [40234#true, 40235#false, 40238#(= main_~i~0 0), 40239#(= main_~i~0 1), 40240#(= main_~i~0 2), 40241#(= main_~i~0 3), 40242#(= main_~i~0 4), 40243#(= main_~i~0 5), 40244#(= main_~i~0 6), 40245#(= main_~i~0 7), 40246#(= main_~i~0 8), 40247#(= main_~i~0 9), 40248#(= main_~i~0 10), 40249#(= main_~i~0 11), 40250#(= main_~i~0 12), 40251#(= main_~i~0 13), 40252#(= main_~i~0 14), 40253#(= main_~i~0 15), 40254#(= main_~i~0 16), 40255#(= main_~i~0 17), 40256#(= main_~i~0 18), 40257#(= main_~i~0 19), 40258#(= main_~i~0 20), 40259#(= main_~i~0 21), 40260#(= main_~i~0 22), 40261#(= main_~i~0 23), 40262#(= main_~i~0 24), 40263#(= main_~i~0 25), 40264#(= main_~i~0 26), 40265#(= main_~i~0 27), 40266#(= main_~i~0 28), 40267#(= main_~i~0 29), 40268#(= main_~i~0 30), 40269#(= main_~i~0 31), 40270#(= main_~i~0 32), 40271#(= main_~i~0 33), 40272#(= main_~i~0 34), 40273#(= main_~i~0 35), 40274#(= main_~i~0 36), 40275#(= main_~i~0 37), 40276#(= main_~i~0 38), 40277#(= main_~i~0 39), 40278#(= main_~i~0 40), 40279#(= main_~i~0 41), 40280#(= main_~i~0 42), 40281#(= main_~i~0 43), 40282#(= main_~i~0 44), 40283#(= main_~i~0 45), 40284#(= main_~i~0 46), 40285#(= main_~i~0 47), 40286#(= main_~i~0 48), 40287#(= main_~i~0 49), 40288#(= main_~i~0 50), 40289#(= main_~i~0 51), 40290#(= main_~i~0 52), 40291#(= main_~i~0 53), 40292#(= main_~i~0 54), 40293#(= main_~i~0 55), 40294#(= main_~i~0 56), 40295#(= main_~i~0 57), 40296#(= main_~i~0 58), 40297#(= main_~i~0 59), 40298#(= main_~i~0 60), 40299#(= main_~i~0 61), 40300#(= main_~i~0 62), 40301#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:57:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:57:56,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 20:57:56,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 20:57:56,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 20:57:56,041 INFO L87 Difference]: Start difference. First operand 580 states and 581 transitions. Second operand 66 states. [2018-02-04 20:58:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:01,173 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-02-04 20:58:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 20:58:01,173 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 260 [2018-02-04 20:58:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:01,174 INFO L225 Difference]: With dead ends: 589 [2018-02-04 20:58:01,174 INFO L226 Difference]: Without dead ends: 589 [2018-02-04 20:58:01,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 20:58:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-02-04 20:58:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2018-02-04 20:58:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-02-04 20:58:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 590 transitions. [2018-02-04 20:58:01,178 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 590 transitions. Word has length 260 [2018-02-04 20:58:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:01,178 INFO L432 AbstractCegarLoop]: Abstraction has 589 states and 590 transitions. [2018-02-04 20:58:01,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 20:58:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 590 transitions. [2018-02-04 20:58:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-02-04 20:58:01,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:01,179 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:01,179 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1398575312, now seen corresponding path program 64 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:01,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:02,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:02,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 20:58:02,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:02,253 INFO L182 omatonBuilderFactory]: Interpolants [41480#true, 41481#false, 41484#(= main_~i~0 0), 41485#(= main_~i~0 1), 41486#(= main_~i~0 2), 41487#(= main_~i~0 3), 41488#(= main_~i~0 4), 41489#(= main_~i~0 5), 41490#(= main_~i~0 6), 41491#(= main_~i~0 7), 41492#(= main_~i~0 8), 41493#(= main_~i~0 9), 41494#(= main_~i~0 10), 41495#(= main_~i~0 11), 41496#(= main_~i~0 12), 41497#(= main_~i~0 13), 41498#(= main_~i~0 14), 41499#(= main_~i~0 15), 41500#(= main_~i~0 16), 41501#(= main_~i~0 17), 41502#(= main_~i~0 18), 41503#(= main_~i~0 19), 41504#(= main_~i~0 20), 41505#(= main_~i~0 21), 41506#(= main_~i~0 22), 41507#(= main_~i~0 23), 41508#(= main_~i~0 24), 41509#(= main_~i~0 25), 41510#(= main_~i~0 26), 41511#(= main_~i~0 27), 41512#(= main_~i~0 28), 41513#(= main_~i~0 29), 41514#(= main_~i~0 30), 41515#(= main_~i~0 31), 41516#(= main_~i~0 32), 41517#(= main_~i~0 33), 41518#(= main_~i~0 34), 41519#(= main_~i~0 35), 41520#(= main_~i~0 36), 41521#(= main_~i~0 37), 41522#(= main_~i~0 38), 41523#(= main_~i~0 39), 41524#(= main_~i~0 40), 41525#(= main_~i~0 41), 41526#(= main_~i~0 42), 41527#(= main_~i~0 43), 41528#(= main_~i~0 44), 41529#(= main_~i~0 45), 41530#(= main_~i~0 46), 41531#(= main_~i~0 47), 41532#(= main_~i~0 48), 41533#(= main_~i~0 49), 41534#(= main_~i~0 50), 41535#(= main_~i~0 51), 41536#(= main_~i~0 52), 41537#(= main_~i~0 53), 41538#(= main_~i~0 54), 41539#(= main_~i~0 55), 41540#(= main_~i~0 56), 41541#(= main_~i~0 57), 41542#(= main_~i~0 58), 41543#(= main_~i~0 59), 41544#(= main_~i~0 60), 41545#(= main_~i~0 61), 41546#(= main_~i~0 62), 41547#(= main_~i~0 63), 41548#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:58:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:02,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 20:58:02,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 20:58:02,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 20:58:02,254 INFO L87 Difference]: Start difference. First operand 589 states and 590 transitions. Second operand 67 states. [2018-02-04 20:58:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:07,540 INFO L93 Difference]: Finished difference Result 598 states and 599 transitions. [2018-02-04 20:58:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 20:58:07,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 264 [2018-02-04 20:58:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:07,541 INFO L225 Difference]: With dead ends: 598 [2018-02-04 20:58:07,542 INFO L226 Difference]: Without dead ends: 598 [2018-02-04 20:58:07,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 20:58:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-02-04 20:58:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-02-04 20:58:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-02-04 20:58:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 599 transitions. [2018-02-04 20:58:07,544 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 599 transitions. Word has length 264 [2018-02-04 20:58:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:07,545 INFO L432 AbstractCegarLoop]: Abstraction has 598 states and 599 transitions. [2018-02-04 20:58:07,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 20:58:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 599 transitions. [2018-02-04 20:58:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-02-04 20:58:07,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:07,545 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:07,545 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1042127433, now seen corresponding path program 65 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:07,548 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:08,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:08,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 20:58:08,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:08,511 INFO L182 omatonBuilderFactory]: Interpolants [42752#(= main_~i~0 3), 42753#(= main_~i~0 4), 42754#(= main_~i~0 5), 42755#(= main_~i~0 6), 42756#(= main_~i~0 7), 42757#(= main_~i~0 8), 42758#(= main_~i~0 9), 42759#(= main_~i~0 10), 42760#(= main_~i~0 11), 42761#(= main_~i~0 12), 42762#(= main_~i~0 13), 42763#(= main_~i~0 14), 42764#(= main_~i~0 15), 42765#(= main_~i~0 16), 42766#(= main_~i~0 17), 42767#(= main_~i~0 18), 42768#(= main_~i~0 19), 42769#(= main_~i~0 20), 42770#(= main_~i~0 21), 42771#(= main_~i~0 22), 42772#(= main_~i~0 23), 42773#(= main_~i~0 24), 42774#(= main_~i~0 25), 42775#(= main_~i~0 26), 42776#(= main_~i~0 27), 42777#(= main_~i~0 28), 42778#(= main_~i~0 29), 42779#(= main_~i~0 30), 42780#(= main_~i~0 31), 42781#(= main_~i~0 32), 42782#(= main_~i~0 33), 42783#(= main_~i~0 34), 42784#(= main_~i~0 35), 42785#(= main_~i~0 36), 42786#(= main_~i~0 37), 42787#(= main_~i~0 38), 42788#(= main_~i~0 39), 42789#(= main_~i~0 40), 42790#(= main_~i~0 41), 42791#(= main_~i~0 42), 42792#(= main_~i~0 43), 42793#(= main_~i~0 44), 42794#(= main_~i~0 45), 42795#(= main_~i~0 46), 42796#(= main_~i~0 47), 42797#(= main_~i~0 48), 42798#(= main_~i~0 49), 42799#(= main_~i~0 50), 42800#(= main_~i~0 51), 42801#(= main_~i~0 52), 42802#(= main_~i~0 53), 42803#(= main_~i~0 54), 42804#(= main_~i~0 55), 42805#(= main_~i~0 56), 42806#(= main_~i~0 57), 42807#(= main_~i~0 58), 42808#(= main_~i~0 59), 42809#(= main_~i~0 60), 42810#(= main_~i~0 61), 42811#(= main_~i~0 62), 42812#(= main_~i~0 63), 42813#(= main_~i~0 64), 42814#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 42745#true, 42746#false, 42749#(= main_~i~0 0), 42750#(= main_~i~0 1), 42751#(= main_~i~0 2)] [2018-02-04 20:58:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:08,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 20:58:08,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 20:58:08,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 20:58:08,512 INFO L87 Difference]: Start difference. First operand 598 states and 599 transitions. Second operand 68 states. [2018-02-04 20:58:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:13,938 INFO L93 Difference]: Finished difference Result 607 states and 608 transitions. [2018-02-04 20:58:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 20:58:13,938 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 268 [2018-02-04 20:58:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:13,940 INFO L225 Difference]: With dead ends: 607 [2018-02-04 20:58:13,940 INFO L226 Difference]: Without dead ends: 607 [2018-02-04 20:58:13,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 20:58:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-02-04 20:58:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-02-04 20:58:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-02-04 20:58:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-02-04 20:58:13,943 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 268 [2018-02-04 20:58:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:13,943 INFO L432 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-02-04 20:58:13,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 20:58:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-02-04 20:58:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 20:58:13,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:13,944 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:13,945 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1708867394, now seen corresponding path program 66 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:13,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:14,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:14,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 20:58:14,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:14,935 INFO L182 omatonBuilderFactory]: Interpolants [44033#(= main_~i~0 0), 44034#(= main_~i~0 1), 44035#(= main_~i~0 2), 44036#(= main_~i~0 3), 44037#(= main_~i~0 4), 44038#(= main_~i~0 5), 44039#(= main_~i~0 6), 44040#(= main_~i~0 7), 44041#(= main_~i~0 8), 44042#(= main_~i~0 9), 44043#(= main_~i~0 10), 44044#(= main_~i~0 11), 44045#(= main_~i~0 12), 44046#(= main_~i~0 13), 44047#(= main_~i~0 14), 44048#(= main_~i~0 15), 44049#(= main_~i~0 16), 44050#(= main_~i~0 17), 44051#(= main_~i~0 18), 44052#(= main_~i~0 19), 44053#(= main_~i~0 20), 44054#(= main_~i~0 21), 44055#(= main_~i~0 22), 44056#(= main_~i~0 23), 44057#(= main_~i~0 24), 44058#(= main_~i~0 25), 44059#(= main_~i~0 26), 44060#(= main_~i~0 27), 44061#(= main_~i~0 28), 44062#(= main_~i~0 29), 44063#(= main_~i~0 30), 44064#(= main_~i~0 31), 44065#(= main_~i~0 32), 44066#(= main_~i~0 33), 44067#(= main_~i~0 34), 44068#(= main_~i~0 35), 44069#(= main_~i~0 36), 44070#(= main_~i~0 37), 44071#(= main_~i~0 38), 44072#(= main_~i~0 39), 44073#(= main_~i~0 40), 44074#(= main_~i~0 41), 44075#(= main_~i~0 42), 44076#(= main_~i~0 43), 44077#(= main_~i~0 44), 44078#(= main_~i~0 45), 44079#(= main_~i~0 46), 44080#(= main_~i~0 47), 44081#(= main_~i~0 48), 44082#(= main_~i~0 49), 44083#(= main_~i~0 50), 44084#(= main_~i~0 51), 44085#(= main_~i~0 52), 44086#(= main_~i~0 53), 44087#(= main_~i~0 54), 44088#(= main_~i~0 55), 44089#(= main_~i~0 56), 44090#(= main_~i~0 57), 44091#(= main_~i~0 58), 44092#(= main_~i~0 59), 44093#(= main_~i~0 60), 44094#(= main_~i~0 61), 44095#(= main_~i~0 62), 44096#(= main_~i~0 63), 44097#(= main_~i~0 64), 44098#(= main_~i~0 65), 44099#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 44029#true, 44030#false] [2018-02-04 20:58:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:14,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 20:58:14,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 20:58:14,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 20:58:14,936 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 69 states. [2018-02-04 20:58:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:20,502 INFO L93 Difference]: Finished difference Result 616 states and 617 transitions. [2018-02-04 20:58:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 20:58:20,502 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 272 [2018-02-04 20:58:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:20,503 INFO L225 Difference]: With dead ends: 616 [2018-02-04 20:58:20,503 INFO L226 Difference]: Without dead ends: 616 [2018-02-04 20:58:20,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 20:58:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-04 20:58:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2018-02-04 20:58:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-02-04 20:58:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 617 transitions. [2018-02-04 20:58:20,506 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 617 transitions. Word has length 272 [2018-02-04 20:58:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:20,506 INFO L432 AbstractCegarLoop]: Abstraction has 616 states and 617 transitions. [2018-02-04 20:58:20,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 20:58:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 617 transitions. [2018-02-04 20:58:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-02-04 20:58:20,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:20,507 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:20,507 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2077999035, now seen corresponding path program 67 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:20,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:21,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:21,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 20:58:21,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:21,627 INFO L182 omatonBuilderFactory]: Interpolants [45332#true, 45333#false, 45336#(= main_~i~0 0), 45337#(= main_~i~0 1), 45338#(= main_~i~0 2), 45339#(= main_~i~0 3), 45340#(= main_~i~0 4), 45341#(= main_~i~0 5), 45342#(= main_~i~0 6), 45343#(= main_~i~0 7), 45344#(= main_~i~0 8), 45345#(= main_~i~0 9), 45346#(= main_~i~0 10), 45347#(= main_~i~0 11), 45348#(= main_~i~0 12), 45349#(= main_~i~0 13), 45350#(= main_~i~0 14), 45351#(= main_~i~0 15), 45352#(= main_~i~0 16), 45353#(= main_~i~0 17), 45354#(= main_~i~0 18), 45355#(= main_~i~0 19), 45356#(= main_~i~0 20), 45357#(= main_~i~0 21), 45358#(= main_~i~0 22), 45359#(= main_~i~0 23), 45360#(= main_~i~0 24), 45361#(= main_~i~0 25), 45362#(= main_~i~0 26), 45363#(= main_~i~0 27), 45364#(= main_~i~0 28), 45365#(= main_~i~0 29), 45366#(= main_~i~0 30), 45367#(= main_~i~0 31), 45368#(= main_~i~0 32), 45369#(= main_~i~0 33), 45370#(= main_~i~0 34), 45371#(= main_~i~0 35), 45372#(= main_~i~0 36), 45373#(= main_~i~0 37), 45374#(= main_~i~0 38), 45375#(= main_~i~0 39), 45376#(= main_~i~0 40), 45377#(= main_~i~0 41), 45378#(= main_~i~0 42), 45379#(= main_~i~0 43), 45380#(= main_~i~0 44), 45381#(= main_~i~0 45), 45382#(= main_~i~0 46), 45383#(= main_~i~0 47), 45384#(= main_~i~0 48), 45385#(= main_~i~0 49), 45386#(= main_~i~0 50), 45387#(= main_~i~0 51), 45388#(= main_~i~0 52), 45389#(= main_~i~0 53), 45390#(= main_~i~0 54), 45391#(= main_~i~0 55), 45392#(= main_~i~0 56), 45393#(= main_~i~0 57), 45394#(= main_~i~0 58), 45395#(= main_~i~0 59), 45396#(= main_~i~0 60), 45397#(= main_~i~0 61), 45398#(= main_~i~0 62), 45399#(= main_~i~0 63), 45400#(= main_~i~0 64), 45401#(= main_~i~0 65), 45402#(= main_~i~0 66), 45403#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:58:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:21,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 20:58:21,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 20:58:21,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 20:58:21,628 INFO L87 Difference]: Start difference. First operand 616 states and 617 transitions. Second operand 70 states. [2018-02-04 20:58:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:27,321 INFO L93 Difference]: Finished difference Result 625 states and 626 transitions. [2018-02-04 20:58:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 20:58:27,322 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 276 [2018-02-04 20:58:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:27,323 INFO L225 Difference]: With dead ends: 625 [2018-02-04 20:58:27,323 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 20:58:27,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 20:58:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 20:58:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2018-02-04 20:58:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-02-04 20:58:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2018-02-04 20:58:27,325 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 276 [2018-02-04 20:58:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:27,326 INFO L432 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2018-02-04 20:58:27,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 20:58:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2018-02-04 20:58:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-02-04 20:58:27,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:27,326 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:27,326 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:27,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1538958412, now seen corresponding path program 68 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:27,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:28,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:28,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 20:58:28,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:28,407 INFO L182 omatonBuilderFactory]: Interpolants [46720#(= main_~i~0 62), 46721#(= main_~i~0 63), 46722#(= main_~i~0 64), 46723#(= main_~i~0 65), 46724#(= main_~i~0 66), 46725#(= main_~i~0 67), 46726#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 46654#true, 46655#false, 46658#(= main_~i~0 0), 46659#(= main_~i~0 1), 46660#(= main_~i~0 2), 46661#(= main_~i~0 3), 46662#(= main_~i~0 4), 46663#(= main_~i~0 5), 46664#(= main_~i~0 6), 46665#(= main_~i~0 7), 46666#(= main_~i~0 8), 46667#(= main_~i~0 9), 46668#(= main_~i~0 10), 46669#(= main_~i~0 11), 46670#(= main_~i~0 12), 46671#(= main_~i~0 13), 46672#(= main_~i~0 14), 46673#(= main_~i~0 15), 46674#(= main_~i~0 16), 46675#(= main_~i~0 17), 46676#(= main_~i~0 18), 46677#(= main_~i~0 19), 46678#(= main_~i~0 20), 46679#(= main_~i~0 21), 46680#(= main_~i~0 22), 46681#(= main_~i~0 23), 46682#(= main_~i~0 24), 46683#(= main_~i~0 25), 46684#(= main_~i~0 26), 46685#(= main_~i~0 27), 46686#(= main_~i~0 28), 46687#(= main_~i~0 29), 46688#(= main_~i~0 30), 46689#(= main_~i~0 31), 46690#(= main_~i~0 32), 46691#(= main_~i~0 33), 46692#(= main_~i~0 34), 46693#(= main_~i~0 35), 46694#(= main_~i~0 36), 46695#(= main_~i~0 37), 46696#(= main_~i~0 38), 46697#(= main_~i~0 39), 46698#(= main_~i~0 40), 46699#(= main_~i~0 41), 46700#(= main_~i~0 42), 46701#(= main_~i~0 43), 46702#(= main_~i~0 44), 46703#(= main_~i~0 45), 46704#(= main_~i~0 46), 46705#(= main_~i~0 47), 46706#(= main_~i~0 48), 46707#(= main_~i~0 49), 46708#(= main_~i~0 50), 46709#(= main_~i~0 51), 46710#(= main_~i~0 52), 46711#(= main_~i~0 53), 46712#(= main_~i~0 54), 46713#(= main_~i~0 55), 46714#(= main_~i~0 56), 46715#(= main_~i~0 57), 46716#(= main_~i~0 58), 46717#(= main_~i~0 59), 46718#(= main_~i~0 60), 46719#(= main_~i~0 61)] [2018-02-04 20:58:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:28,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 20:58:28,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 20:58:28,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 20:58:28,408 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand 71 states. [2018-02-04 20:58:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:34,313 INFO L93 Difference]: Finished difference Result 634 states and 635 transitions. [2018-02-04 20:58:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 20:58:34,314 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 280 [2018-02-04 20:58:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:34,315 INFO L225 Difference]: With dead ends: 634 [2018-02-04 20:58:34,315 INFO L226 Difference]: Without dead ends: 634 [2018-02-04 20:58:34,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 20:58:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-04 20:58:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2018-02-04 20:58:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-04 20:58:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 635 transitions. [2018-02-04 20:58:34,318 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 635 transitions. Word has length 280 [2018-02-04 20:58:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:34,318 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 635 transitions. [2018-02-04 20:58:34,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 20:58:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 635 transitions. [2018-02-04 20:58:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-02-04 20:58:34,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:34,319 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:34,319 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 102650669, now seen corresponding path program 69 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:34,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:35,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:35,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 20:58:35,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:35,408 INFO L182 omatonBuilderFactory]: Interpolants [48000#(= main_~i~0 1), 48001#(= main_~i~0 2), 48002#(= main_~i~0 3), 48003#(= main_~i~0 4), 48004#(= main_~i~0 5), 48005#(= main_~i~0 6), 48006#(= main_~i~0 7), 48007#(= main_~i~0 8), 48008#(= main_~i~0 9), 48009#(= main_~i~0 10), 48010#(= main_~i~0 11), 48011#(= main_~i~0 12), 48012#(= main_~i~0 13), 48013#(= main_~i~0 14), 48014#(= main_~i~0 15), 48015#(= main_~i~0 16), 48016#(= main_~i~0 17), 48017#(= main_~i~0 18), 48018#(= main_~i~0 19), 48019#(= main_~i~0 20), 48020#(= main_~i~0 21), 48021#(= main_~i~0 22), 48022#(= main_~i~0 23), 48023#(= main_~i~0 24), 48024#(= main_~i~0 25), 48025#(= main_~i~0 26), 48026#(= main_~i~0 27), 48027#(= main_~i~0 28), 48028#(= main_~i~0 29), 48029#(= main_~i~0 30), 48030#(= main_~i~0 31), 48031#(= main_~i~0 32), 48032#(= main_~i~0 33), 48033#(= main_~i~0 34), 48034#(= main_~i~0 35), 48035#(= main_~i~0 36), 48036#(= main_~i~0 37), 48037#(= main_~i~0 38), 48038#(= main_~i~0 39), 48039#(= main_~i~0 40), 48040#(= main_~i~0 41), 48041#(= main_~i~0 42), 48042#(= main_~i~0 43), 48043#(= main_~i~0 44), 48044#(= main_~i~0 45), 48045#(= main_~i~0 46), 48046#(= main_~i~0 47), 48047#(= main_~i~0 48), 48048#(= main_~i~0 49), 48049#(= main_~i~0 50), 48050#(= main_~i~0 51), 48051#(= main_~i~0 52), 48052#(= main_~i~0 53), 48053#(= main_~i~0 54), 48054#(= main_~i~0 55), 48055#(= main_~i~0 56), 48056#(= main_~i~0 57), 48057#(= main_~i~0 58), 48058#(= main_~i~0 59), 48059#(= main_~i~0 60), 48060#(= main_~i~0 61), 48061#(= main_~i~0 62), 48062#(= main_~i~0 63), 48063#(= main_~i~0 64), 48064#(= main_~i~0 65), 48065#(= main_~i~0 66), 48066#(= main_~i~0 67), 48067#(= main_~i~0 68), 48068#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 47995#true, 47996#false, 47999#(= main_~i~0 0)] [2018-02-04 20:58:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:35,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 20:58:35,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 20:58:35,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 20:58:35,409 INFO L87 Difference]: Start difference. First operand 634 states and 635 transitions. Second operand 72 states. [2018-02-04 20:58:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:41,390 INFO L93 Difference]: Finished difference Result 643 states and 644 transitions. [2018-02-04 20:58:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 20:58:41,390 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 284 [2018-02-04 20:58:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:41,391 INFO L225 Difference]: With dead ends: 643 [2018-02-04 20:58:41,391 INFO L226 Difference]: Without dead ends: 643 [2018-02-04 20:58:41,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 20:58:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-04 20:58:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2018-02-04 20:58:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-02-04 20:58:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 644 transitions. [2018-02-04 20:58:41,394 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 644 transitions. Word has length 284 [2018-02-04 20:58:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:41,394 INFO L432 AbstractCegarLoop]: Abstraction has 643 states and 644 transitions. [2018-02-04 20:58:41,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 20:58:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 644 transitions. [2018-02-04 20:58:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-04 20:58:41,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:41,395 INFO L351 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:41,395 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1531766310, now seen corresponding path program 70 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:41,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:42,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:42,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 20:58:42,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:42,531 INFO L182 omatonBuilderFactory]: Interpolants [49408#(= main_~i~0 49), 49409#(= main_~i~0 50), 49410#(= main_~i~0 51), 49411#(= main_~i~0 52), 49412#(= main_~i~0 53), 49413#(= main_~i~0 54), 49414#(= main_~i~0 55), 49415#(= main_~i~0 56), 49416#(= main_~i~0 57), 49417#(= main_~i~0 58), 49418#(= main_~i~0 59), 49419#(= main_~i~0 60), 49420#(= main_~i~0 61), 49421#(= main_~i~0 62), 49422#(= main_~i~0 63), 49423#(= main_~i~0 64), 49424#(= main_~i~0 65), 49425#(= main_~i~0 66), 49426#(= main_~i~0 67), 49427#(= main_~i~0 68), 49428#(= main_~i~0 69), 49429#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 49355#true, 49356#false, 49359#(= main_~i~0 0), 49360#(= main_~i~0 1), 49361#(= main_~i~0 2), 49362#(= main_~i~0 3), 49363#(= main_~i~0 4), 49364#(= main_~i~0 5), 49365#(= main_~i~0 6), 49366#(= main_~i~0 7), 49367#(= main_~i~0 8), 49368#(= main_~i~0 9), 49369#(= main_~i~0 10), 49370#(= main_~i~0 11), 49371#(= main_~i~0 12), 49372#(= main_~i~0 13), 49373#(= main_~i~0 14), 49374#(= main_~i~0 15), 49375#(= main_~i~0 16), 49376#(= main_~i~0 17), 49377#(= main_~i~0 18), 49378#(= main_~i~0 19), 49379#(= main_~i~0 20), 49380#(= main_~i~0 21), 49381#(= main_~i~0 22), 49382#(= main_~i~0 23), 49383#(= main_~i~0 24), 49384#(= main_~i~0 25), 49385#(= main_~i~0 26), 49386#(= main_~i~0 27), 49387#(= main_~i~0 28), 49388#(= main_~i~0 29), 49389#(= main_~i~0 30), 49390#(= main_~i~0 31), 49391#(= main_~i~0 32), 49392#(= main_~i~0 33), 49393#(= main_~i~0 34), 49394#(= main_~i~0 35), 49395#(= main_~i~0 36), 49396#(= main_~i~0 37), 49397#(= main_~i~0 38), 49398#(= main_~i~0 39), 49399#(= main_~i~0 40), 49400#(= main_~i~0 41), 49401#(= main_~i~0 42), 49402#(= main_~i~0 43), 49403#(= main_~i~0 44), 49404#(= main_~i~0 45), 49405#(= main_~i~0 46), 49406#(= main_~i~0 47), 49407#(= main_~i~0 48)] [2018-02-04 20:58:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:42,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 20:58:42,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 20:58:42,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 20:58:42,532 INFO L87 Difference]: Start difference. First operand 643 states and 644 transitions. Second operand 73 states. [2018-02-04 20:58:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:58:48,716 INFO L93 Difference]: Finished difference Result 652 states and 653 transitions. [2018-02-04 20:58:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 20:58:48,716 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 288 [2018-02-04 20:58:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:58:48,717 INFO L225 Difference]: With dead ends: 652 [2018-02-04 20:58:48,718 INFO L226 Difference]: Without dead ends: 652 [2018-02-04 20:58:48,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 20:58:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-02-04 20:58:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2018-02-04 20:58:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-02-04 20:58:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 653 transitions. [2018-02-04 20:58:48,720 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 653 transitions. Word has length 288 [2018-02-04 20:58:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:58:48,720 INFO L432 AbstractCegarLoop]: Abstraction has 652 states and 653 transitions. [2018-02-04 20:58:48,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 20:58:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 653 transitions. [2018-02-04 20:58:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 20:58:48,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:58:48,721 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1, 1, 1] [2018-02-04 20:58:48,721 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 20:58:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2137566049, now seen corresponding path program 71 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:58:48,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:58:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:58:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:49,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:58:49,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 20:58:49,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:58:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:49,864 INFO L182 omatonBuilderFactory]: Interpolants [50734#true, 50735#false, 50738#(= main_~i~0 0), 50739#(= main_~i~0 1), 50740#(= main_~i~0 2), 50741#(= main_~i~0 3), 50742#(= main_~i~0 4), 50743#(= main_~i~0 5), 50744#(= main_~i~0 6), 50745#(= main_~i~0 7), 50746#(= main_~i~0 8), 50747#(= main_~i~0 9), 50748#(= main_~i~0 10), 50749#(= main_~i~0 11), 50750#(= main_~i~0 12), 50751#(= main_~i~0 13), 50752#(= main_~i~0 14), 50753#(= main_~i~0 15), 50754#(= main_~i~0 16), 50755#(= main_~i~0 17), 50756#(= main_~i~0 18), 50757#(= main_~i~0 19), 50758#(= main_~i~0 20), 50759#(= main_~i~0 21), 50760#(= main_~i~0 22), 50761#(= main_~i~0 23), 50762#(= main_~i~0 24), 50763#(= main_~i~0 25), 50764#(= main_~i~0 26), 50765#(= main_~i~0 27), 50766#(= main_~i~0 28), 50767#(= main_~i~0 29), 50768#(= main_~i~0 30), 50769#(= main_~i~0 31), 50770#(= main_~i~0 32), 50771#(= main_~i~0 33), 50772#(= main_~i~0 34), 50773#(= main_~i~0 35), 50774#(= main_~i~0 36), 50775#(= main_~i~0 37), 50776#(= main_~i~0 38), 50777#(= main_~i~0 39), 50778#(= main_~i~0 40), 50779#(= main_~i~0 41), 50780#(= main_~i~0 42), 50781#(= main_~i~0 43), 50782#(= main_~i~0 44), 50783#(= main_~i~0 45), 50784#(= main_~i~0 46), 50785#(= main_~i~0 47), 50786#(= main_~i~0 48), 50787#(= main_~i~0 49), 50788#(= main_~i~0 50), 50789#(= main_~i~0 51), 50790#(= main_~i~0 52), 50791#(= main_~i~0 53), 50792#(= main_~i~0 54), 50793#(= main_~i~0 55), 50794#(= main_~i~0 56), 50795#(= main_~i~0 57), 50796#(= main_~i~0 58), 50797#(= main_~i~0 59), 50798#(= main_~i~0 60), 50799#(= main_~i~0 61), 50800#(= main_~i~0 62), 50801#(= main_~i~0 63), 50802#(= main_~i~0 64), 50803#(= main_~i~0 65), 50804#(= main_~i~0 66), 50805#(= main_~i~0 67), 50806#(= main_~i~0 68), 50807#(= main_~i~0 69), 50808#(= main_~i~0 70), 50809#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-04 20:58:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:58:49,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 20:58:49,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 20:58:49,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 20:58:49,865 INFO L87 Difference]: Start difference. First operand 652 states and 653 transitions. Second operand 74 states. Received shutdown request... [2018-02-04 20:58:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 20:58:50,325 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 20:58:50,329 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 20:58:50,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:58:50 BoogieIcfgContainer [2018-02-04 20:58:50,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:58:50,330 INFO L168 Benchmark]: Toolchain (without parser) took 193686.43 ms. Allocated memory was 402.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 360.3 MB in the beginning and 562.9 MB in the end (delta: -202.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-02-04 20:58:50,330 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:58:50,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.80 ms. Allocated memory is still 402.1 MB. Free memory was 360.3 MB in the beginning and 352.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 20:58:50,331 INFO L168 Benchmark]: Boogie Preprocessor took 17.70 ms. Allocated memory is still 402.1 MB. Free memory was 352.2 MB in the beginning and 350.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:58:50,331 INFO L168 Benchmark]: RCFGBuilder took 121.16 ms. Allocated memory is still 402.1 MB. Free memory was 350.8 MB in the beginning and 338.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-04 20:58:50,331 INFO L168 Benchmark]: TraceAbstraction took 193417.09 ms. Allocated memory was 402.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 338.1 MB in the beginning and 562.9 MB in the end (delta: -224.8 MB). Peak memory consumption was 984.8 MB. Max. memory is 5.3 GB. [2018-02-04 20:58:50,332 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.17 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 127.80 ms. Allocated memory is still 402.1 MB. Free memory was 360.3 MB in the beginning and 352.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.70 ms. Allocated memory is still 402.1 MB. Free memory was 352.2 MB in the beginning and 350.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 121.16 ms. Allocated memory is still 402.1 MB. Free memory was 350.8 MB in the beginning and 338.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 193417.09 ms. Allocated memory was 402.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 338.1 MB in the beginning and 562.9 MB in the end (delta: -224.8 MB). Peak memory consumption was 984.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (652states) and interpolant automaton (currently 15 states, 74 states before enhancement), while ReachableStatesComputation was computing reachable states (53 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (652states) and interpolant automaton (currently 15 states, 74 states before enhancement), while ReachableStatesComputation was computing reachable states (53 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 193.3s OverallTime, 72 OverallIterations, 72 TraceHistogramMax, 160.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5637 SDtfs, 14942 SDslu, 237975 SDs, 0 SdLazy, 831444 SolverSat, 5876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2844 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 2628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/246228 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 10800 NumberOfCodeBlocks, 10800 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 10728 ConstructedInterpolants, 0 QuantifiedInterpolants, 6331032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 72 InterpolantComputations, 1 PerfectInterpolantSequences, 0/246228 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/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-58-50-336.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-58-50-336.csv Completed graceful shutdown