java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:50:50,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:50:50,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:50:50,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:50:50,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:50:50,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:50:50,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:50:50,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:50:50,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:50:50,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:50:50,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:50:50,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:50:50,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:50:50,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:50:50,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:50:50,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:50:50,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:50:50,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:50:50,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:50:50,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:50:50,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:50:50,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:50:50,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:50:50,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:50:50,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:50:50,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:50:50,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:50:50,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:50:50,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:50:50,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:50:50,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:50:50,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:50:50,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:50:50,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:50:50,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:50:50,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:50:50,867 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:50:50,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:50:50,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:50:50,877 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:50:50,877 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:50:50,877 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:50:50,877 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:50:50,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:50:50,878 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:50:50,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:50:50,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:50:50,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:50:50,879 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:50:50,879 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:50:50,880 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:50:50,880 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:50:50,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:50:50,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:50:50,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:50:50,971 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:50:50,971 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:50:50,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl [2018-10-14 16:50:50,972 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl' [2018-10-14 16:50:51,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:50:51,051 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:50:51,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:50:51,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:50:51,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:50:51,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... [2018-10-14 16:50:51,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:50:51,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:50:51,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:50:51,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:50:51,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:50:51,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:50:51,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:50:51,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:50:52,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:50:52,124 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:50:52 BoogieIcfgContainer [2018-10-14 16:50:52,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:50:52,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:50:52,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:50:52,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:50:52,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:50:51" (1/2) ... [2018-10-14 16:50:52,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d181e2 and model type optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:50:52, skipping insertion in model container [2018-10-14 16:50:52,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:50:52" (2/2) ... [2018-10-14 16:50:52,133 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i_32.bpl [2018-10-14 16:50:52,144 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:50:52,153 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:50:52,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:50:52,202 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:50:52,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:50:52,203 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:50:52,203 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:50:52,203 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:50:52,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:50:52,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:50:52,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:50:52,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:50:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-10-14 16:50:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-14 16:50:52,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:52,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:52,242 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:52,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 266737070, now seen corresponding path program 1 times [2018-10-14 16:50:52,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:52,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:50:52,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-14 16:50:52,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 16:50:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 16:50:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 16:50:52,687 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-10-14 16:50:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:52,797 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-14 16:50:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 16:50:52,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-10-14 16:50:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:52,819 INFO L225 Difference]: With dead ends: 146 [2018-10-14 16:50:52,819 INFO L226 Difference]: Without dead ends: 146 [2018-10-14 16:50:52,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-14 16:50:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-14 16:50:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 125. [2018-10-14 16:50:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-14 16:50:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-14 16:50:52,878 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 101 [2018-10-14 16:50:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:52,879 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-14 16:50:52,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 16:50:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-14 16:50:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-14 16:50:52,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:52,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:52,885 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1125583718, now seen corresponding path program 1 times [2018-10-14 16:50:52,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:50:53,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:50:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:50:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:50:53,098 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 5 states. [2018-10-14 16:50:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:53,324 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 16:50:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:50:53,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-14 16:50:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:53,327 INFO L225 Difference]: With dead ends: 169 [2018-10-14 16:50:53,328 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 16:50:53,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:50:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 16:50:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 148. [2018-10-14 16:50:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-14 16:50:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-14 16:50:53,342 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 124 [2018-10-14 16:50:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:53,343 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-14 16:50:53,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:50:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-14 16:50:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-14 16:50:53,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:53,347 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:53,347 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:53,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 956042286, now seen corresponding path program 2 times [2018-10-14 16:50:53,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:50:53,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:50:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:50:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:50:53,576 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 7 states. [2018-10-14 16:50:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:53,836 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-14 16:50:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:50:53,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2018-10-14 16:50:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:53,839 INFO L225 Difference]: With dead ends: 192 [2018-10-14 16:50:53,840 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 16:50:53,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:50:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 16:50:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2018-10-14 16:50:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 16:50:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-14 16:50:53,858 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 147 [2018-10-14 16:50:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:53,858 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-14 16:50:53,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:50:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-14 16:50:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 16:50:53,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:53,867 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:53,868 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:53,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1404719590, now seen corresponding path program 3 times [2018-10-14 16:50:53,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:54,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:50:54,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:50:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:50:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:50:54,291 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 9 states. [2018-10-14 16:50:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:54,711 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-14 16:50:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:50:54,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2018-10-14 16:50:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:54,714 INFO L225 Difference]: With dead ends: 215 [2018-10-14 16:50:54,714 INFO L226 Difference]: Without dead ends: 215 [2018-10-14 16:50:54,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:50:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-14 16:50:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-10-14 16:50:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-14 16:50:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-14 16:50:54,726 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 170 [2018-10-14 16:50:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:54,727 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-14 16:50:54,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:50:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-14 16:50:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-14 16:50:54,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:54,731 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:54,731 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:54,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash -484007250, now seen corresponding path program 4 times [2018-10-14 16:50:54,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:55,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:55,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:50:55,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:50:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:50:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:50:55,066 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 11 states. [2018-10-14 16:50:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:55,359 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-14 16:50:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:50:55,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2018-10-14 16:50:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:55,363 INFO L225 Difference]: With dead ends: 238 [2018-10-14 16:50:55,363 INFO L226 Difference]: Without dead ends: 238 [2018-10-14 16:50:55,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:50:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-14 16:50:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 217. [2018-10-14 16:50:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-14 16:50:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-14 16:50:55,376 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 193 [2018-10-14 16:50:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:55,377 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-14 16:50:55,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:50:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-14 16:50:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-14 16:50:55,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:55,381 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:55,381 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:55,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash 492423066, now seen corresponding path program 5 times [2018-10-14 16:50:55,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:55,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:55,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:50:55,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:50:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:50:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:50:55,950 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 13 states. [2018-10-14 16:50:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:56,359 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-14 16:50:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:50:56,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 216 [2018-10-14 16:50:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:56,363 INFO L225 Difference]: With dead ends: 261 [2018-10-14 16:50:56,363 INFO L226 Difference]: Without dead ends: 261 [2018-10-14 16:50:56,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:50:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-14 16:50:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2018-10-14 16:50:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-14 16:50:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-14 16:50:56,374 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 216 [2018-10-14 16:50:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:56,375 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-14 16:50:56,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:50:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-14 16:50:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-14 16:50:56,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:56,380 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:56,380 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:56,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1555179218, now seen corresponding path program 6 times [2018-10-14 16:50:56,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:57,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:50:57,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:50:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:50:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:50:57,365 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 15 states. [2018-10-14 16:50:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:57,855 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-14 16:50:57,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:50:57,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 239 [2018-10-14 16:50:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:57,859 INFO L225 Difference]: With dead ends: 284 [2018-10-14 16:50:57,859 INFO L226 Difference]: Without dead ends: 284 [2018-10-14 16:50:57,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:50:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-14 16:50:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-10-14 16:50:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-14 16:50:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-14 16:50:57,866 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 239 [2018-10-14 16:50:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:57,866 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-14 16:50:57,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:50:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-14 16:50:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-14 16:50:57,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:57,870 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:57,871 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:57,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1983725850, now seen corresponding path program 7 times [2018-10-14 16:50:57,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:58,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:58,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:50:58,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:50:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:50:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:50:58,798 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 17 states. [2018-10-14 16:50:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:50:59,118 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-14 16:50:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:50:59,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 262 [2018-10-14 16:50:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:50:59,121 INFO L225 Difference]: With dead ends: 307 [2018-10-14 16:50:59,122 INFO L226 Difference]: Without dead ends: 307 [2018-10-14 16:50:59,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:50:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-14 16:50:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 286. [2018-10-14 16:50:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-14 16:50:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-14 16:50:59,128 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 262 [2018-10-14 16:50:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:50:59,129 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-14 16:50:59,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:50:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-14 16:50:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-14 16:50:59,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:50:59,133 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:50:59,133 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:50:59,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:50:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1202081874, now seen corresponding path program 8 times [2018-10-14 16:50:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:50:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:50:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:50:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:50:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:50:59,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:50:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:50:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:50:59,595 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 19 states. [2018-10-14 16:51:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:00,449 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-14 16:51:00,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:51:00,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-10-14 16:51:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:00,452 INFO L225 Difference]: With dead ends: 330 [2018-10-14 16:51:00,453 INFO L226 Difference]: Without dead ends: 330 [2018-10-14 16:51:00,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:51:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-14 16:51:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 309. [2018-10-14 16:51:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-14 16:51:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-14 16:51:00,460 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 285 [2018-10-14 16:51:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:00,461 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-14 16:51:00,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:51:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-14 16:51:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-14 16:51:00,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:00,463 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:00,463 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:00,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 856169114, now seen corresponding path program 9 times [2018-10-14 16:51:00,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:51:00,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:51:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:51:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:51:00,974 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 21 states. [2018-10-14 16:51:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:01,382 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-14 16:51:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:51:01,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 308 [2018-10-14 16:51:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:01,387 INFO L225 Difference]: With dead ends: 353 [2018-10-14 16:51:01,387 INFO L226 Difference]: Without dead ends: 353 [2018-10-14 16:51:01,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:51:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-14 16:51:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 332. [2018-10-14 16:51:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-14 16:51:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-14 16:51:01,394 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 308 [2018-10-14 16:51:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:01,395 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-14 16:51:01,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:51:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-14 16:51:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-14 16:51:01,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:01,397 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:01,398 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:01,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1959647698, now seen corresponding path program 10 times [2018-10-14 16:51:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 1045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:51:03,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:51:03,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:51:03,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:51:03,005 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 23 states. [2018-10-14 16:51:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:03,420 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2018-10-14 16:51:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:51:03,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 331 [2018-10-14 16:51:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:03,427 INFO L225 Difference]: With dead ends: 376 [2018-10-14 16:51:03,428 INFO L226 Difference]: Without dead ends: 376 [2018-10-14 16:51:03,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:51:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-14 16:51:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 355. [2018-10-14 16:51:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-14 16:51:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-14 16:51:03,435 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 331 [2018-10-14 16:51:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:03,437 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-14 16:51:03,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:51:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-14 16:51:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-14 16:51:03,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:03,441 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:03,441 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:03,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1708282906, now seen corresponding path program 11 times [2018-10-14 16:51:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:06,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:06,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:51:06,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:51:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:51:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:51:06,307 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 25 states. [2018-10-14 16:51:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:07,162 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-10-14 16:51:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:51:07,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 354 [2018-10-14 16:51:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:07,165 INFO L225 Difference]: With dead ends: 399 [2018-10-14 16:51:07,165 INFO L226 Difference]: Without dead ends: 399 [2018-10-14 16:51:07,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:51:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-14 16:51:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 378. [2018-10-14 16:51:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-14 16:51:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-10-14 16:51:07,172 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 354 [2018-10-14 16:51:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:07,173 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-10-14 16:51:07,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:51:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-10-14 16:51:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-14 16:51:07,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:07,176 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:07,176 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:07,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash 784284846, now seen corresponding path program 12 times [2018-10-14 16:51:07,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:08,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:51:08,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:51:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:51:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:51:08,377 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 27 states. [2018-10-14 16:51:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:09,304 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2018-10-14 16:51:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:51:09,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 377 [2018-10-14 16:51:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:09,308 INFO L225 Difference]: With dead ends: 422 [2018-10-14 16:51:09,308 INFO L226 Difference]: Without dead ends: 422 [2018-10-14 16:51:09,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:51:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-14 16:51:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 401. [2018-10-14 16:51:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-14 16:51:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-14 16:51:09,317 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 377 [2018-10-14 16:51:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:09,318 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-14 16:51:09,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:51:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-14 16:51:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-14 16:51:09,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:09,320 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:09,321 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:09,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 917761434, now seen corresponding path program 13 times [2018-10-14 16:51:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 0 proven. 1807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:11,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:11,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:51:11,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:51:11,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:51:11,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:51:11,977 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 29 states. [2018-10-14 16:51:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:13,068 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-14 16:51:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:51:13,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 400 [2018-10-14 16:51:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:13,070 INFO L225 Difference]: With dead ends: 445 [2018-10-14 16:51:13,071 INFO L226 Difference]: Without dead ends: 445 [2018-10-14 16:51:13,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:51:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-14 16:51:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-10-14 16:51:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-14 16:51:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 424 transitions. [2018-10-14 16:51:13,079 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 424 transitions. Word has length 400 [2018-10-14 16:51:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:13,080 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 424 transitions. [2018-10-14 16:51:13,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:51:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 424 transitions. [2018-10-14 16:51:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-14 16:51:13,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:13,083 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:13,084 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:13,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash -538381522, now seen corresponding path program 14 times [2018-10-14 16:51:13,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2107 backedges. 0 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:13,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:13,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:51:13,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:51:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:51:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:51:13,726 INFO L87 Difference]: Start difference. First operand 424 states and 424 transitions. Second operand 31 states. [2018-10-14 16:51:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:14,381 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-14 16:51:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:51:14,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 423 [2018-10-14 16:51:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:14,384 INFO L225 Difference]: With dead ends: 468 [2018-10-14 16:51:14,385 INFO L226 Difference]: Without dead ends: 468 [2018-10-14 16:51:14,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:51:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-14 16:51:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 447. [2018-10-14 16:51:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-14 16:51:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-14 16:51:14,393 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 423 [2018-10-14 16:51:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:14,393 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-14 16:51:14,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:51:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-14 16:51:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-14 16:51:14,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:14,396 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:14,397 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:14,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1673848602, now seen corresponding path program 15 times [2018-10-14 16:51:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2430 backedges. 0 proven. 2430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:17,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:17,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:51:17,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:51:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:51:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:51:17,232 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 33 states. [2018-10-14 16:51:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:17,956 INFO L93 Difference]: Finished difference Result 491 states and 491 transitions. [2018-10-14 16:51:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:51:17,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 446 [2018-10-14 16:51:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:17,961 INFO L225 Difference]: With dead ends: 491 [2018-10-14 16:51:17,961 INFO L226 Difference]: Without dead ends: 491 [2018-10-14 16:51:17,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:51:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-14 16:51:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 470. [2018-10-14 16:51:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-14 16:51:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-14 16:51:17,969 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 446 [2018-10-14 16:51:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:17,969 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-14 16:51:17,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:51:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-14 16:51:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-14 16:51:17,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:17,973 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:17,973 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:17,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2053682770, now seen corresponding path program 16 times [2018-10-14 16:51:17,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 0 proven. 2776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:18,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:18,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:51:18,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:51:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:51:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:51:18,728 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 35 states. [2018-10-14 16:51:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:19,561 INFO L93 Difference]: Finished difference Result 514 states and 514 transitions. [2018-10-14 16:51:19,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:51:19,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 469 [2018-10-14 16:51:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:19,564 INFO L225 Difference]: With dead ends: 514 [2018-10-14 16:51:19,564 INFO L226 Difference]: Without dead ends: 514 [2018-10-14 16:51:19,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:51:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-14 16:51:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 493. [2018-10-14 16:51:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-14 16:51:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 493 transitions. [2018-10-14 16:51:19,572 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 493 transitions. Word has length 469 [2018-10-14 16:51:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:19,573 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 493 transitions. [2018-10-14 16:51:19,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:51:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 493 transitions. [2018-10-14 16:51:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-14 16:51:19,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:19,576 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:19,577 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:19,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1055047526, now seen corresponding path program 17 times [2018-10-14 16:51:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3145 backedges. 0 proven. 3145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:20,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:20,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:51:20,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:51:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:51:20,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:51:20,553 INFO L87 Difference]: Start difference. First operand 493 states and 493 transitions. Second operand 37 states. [2018-10-14 16:51:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:21,477 INFO L93 Difference]: Finished difference Result 537 states and 537 transitions. [2018-10-14 16:51:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:51:21,478 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 492 [2018-10-14 16:51:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:21,481 INFO L225 Difference]: With dead ends: 537 [2018-10-14 16:51:21,481 INFO L226 Difference]: Without dead ends: 537 [2018-10-14 16:51:21,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:51:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-14 16:51:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 516. [2018-10-14 16:51:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-10-14 16:51:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 516 transitions. [2018-10-14 16:51:21,490 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 516 transitions. Word has length 492 [2018-10-14 16:51:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:21,490 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 516 transitions. [2018-10-14 16:51:21,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:51:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 516 transitions. [2018-10-14 16:51:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-14 16:51:21,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:21,494 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:21,494 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:21,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 816988206, now seen corresponding path program 18 times [2018-10-14 16:51:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:22,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:51:22,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:51:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:51:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:51:22,928 INFO L87 Difference]: Start difference. First operand 516 states and 516 transitions. Second operand 39 states. [2018-10-14 16:51:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:23,917 INFO L93 Difference]: Finished difference Result 560 states and 560 transitions. [2018-10-14 16:51:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 16:51:23,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 515 [2018-10-14 16:51:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:23,920 INFO L225 Difference]: With dead ends: 560 [2018-10-14 16:51:23,921 INFO L226 Difference]: Without dead ends: 560 [2018-10-14 16:51:23,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:51:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-14 16:51:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 539. [2018-10-14 16:51:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-14 16:51:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 539 transitions. [2018-10-14 16:51:23,929 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 539 transitions. Word has length 515 [2018-10-14 16:51:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:23,930 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 539 transitions. [2018-10-14 16:51:23,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:51:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 539 transitions. [2018-10-14 16:51:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-14 16:51:23,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:23,934 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:23,934 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:23,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1194001894, now seen corresponding path program 19 times [2018-10-14 16:51:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3952 backedges. 0 proven. 3952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:25,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:25,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:51:25,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:51:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:51:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:51:25,880 INFO L87 Difference]: Start difference. First operand 539 states and 539 transitions. Second operand 41 states. [2018-10-14 16:51:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:26,900 INFO L93 Difference]: Finished difference Result 562 states and 562 transitions. [2018-10-14 16:51:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 16:51:26,901 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 538 [2018-10-14 16:51:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:26,904 INFO L225 Difference]: With dead ends: 562 [2018-10-14 16:51:26,904 INFO L226 Difference]: Without dead ends: 562 [2018-10-14 16:51:26,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:51:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-14 16:51:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-10-14 16:51:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-10-14 16:51:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 562 transitions. [2018-10-14 16:51:26,913 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 562 transitions. Word has length 538 [2018-10-14 16:51:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:26,914 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 562 transitions. [2018-10-14 16:51:26,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:51:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 562 transitions. [2018-10-14 16:51:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-10-14 16:51:26,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:26,918 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:26,918 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:26,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1675503954, now seen corresponding path program 20 times [2018-10-14 16:51:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4390 backedges. 39 proven. 114 refuted. 0 times theorem prover too weak. 4237 trivial. 0 not checked. [2018-10-14 16:51:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:51:27,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:51:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:51:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:51:27,943 INFO L87 Difference]: Start difference. First operand 562 states and 562 transitions. Second operand 9 states. [2018-10-14 16:51:28,555 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-14 16:51:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:28,565 INFO L93 Difference]: Finished difference Result 560 states and 560 transitions. [2018-10-14 16:51:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:51:28,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 561 [2018-10-14 16:51:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:28,567 INFO L225 Difference]: With dead ends: 560 [2018-10-14 16:51:28,567 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:51:28,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:51:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:51:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:51:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:51:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:51:28,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2018-10-14 16:51:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:28,569 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:51:28,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:51:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:51:28,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:51:28,575 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:51:28 BoogieIcfgContainer [2018-10-14 16:51:28,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:51:28,576 INFO L168 Benchmark]: Toolchain (without parser) took 37526.18 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 516.4 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 79.8 MB). Peak memory consumption was 596.2 MB. Max. memory is 7.1 GB. [2018-10-14 16:51:28,578 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:51:28,578 INFO L168 Benchmark]: Boogie Preprocessor took 87.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:51:28,579 INFO L168 Benchmark]: RCFGBuilder took 985.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-14 16:51:28,579 INFO L168 Benchmark]: TraceAbstraction took 36449.41 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 516.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.5 MB). Peak memory consumption was 553.9 MB. Max. memory is 7.1 GB. [2018-10-14 16:51:28,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 985.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36449.41 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 516.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.5 MB). Peak memory consumption was 553.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 226]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. SAFE Result, 36.3s OverallTime, 21 OverallIterations, 20 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2508 SDtfs, 4666 SDslu, 40235 SDs, 0 SdLazy, 2384 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 793 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7042 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 399 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 6951 NumberOfCodeBlocks, 6951 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6930 ConstructedInterpolants, 0 QuantifiedInterpolants, 8835190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 4276/30800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_32.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-51-28-594.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_32.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-51-28-594.csv Received shutdown request...