java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:52:58,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:52:58,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:52:58,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:52:58,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:52:58,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:52:58,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:52:58,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:52:58,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:52:58,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:52:58,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:52:58,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:52:58,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:52:58,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:52:58,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:52:58,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:52:58,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:52:58,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:52:58,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:52:58,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:52:58,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:52:58,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:52:58,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:52:58,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:52:58,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:52:58,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:52:58,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:52:58,684 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:52:58,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:52:58,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:52:58,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:52:58,685 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:52:58,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:52:58,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:52:58,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:52:58,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:52:58,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:52:58,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:52:58,698 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:52:58,698 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:52:58,698 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:52:58,698 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:52:58,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:52:58,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:52:58,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:52:58,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:52:58,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:52:58,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:52:58,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:52:58,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:52:58,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:52:58,739 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:52:58,743 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:52:58,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:52:58,744 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:52:58,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-02 09:52:58,833 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:52:58,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:52:58,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:52:58,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:52:58,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:52:58,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32349321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58, skipping insertion in model container [2018-02-02 09:52:58,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,860 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:52:58,873 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:52:58,957 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:52:58,965 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:52:58,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58 WrapperNode [2018-02-02 09:52:58,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:52:58,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:52:58,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:52:58,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:52:58,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... [2018-02-02 09:52:58,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:52:58,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:52:58,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:52:58,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:52:58,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:52:59,023 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:52:59,023 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:52:59,023 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 09:52:59,023 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:52:59,023 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 09:52:59,023 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 09:52:59,023 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:52:59,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:52:59,024 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:52:59,107 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:52:59,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:52:59 BoogieIcfgContainer [2018-02-02 09:52:59,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:52:59,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:52:59,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:52:59,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:52:59,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:52:58" (1/3) ... [2018-02-02 09:52:59,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:52:59, skipping insertion in model container [2018-02-02 09:52:59,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:52:58" (2/3) ... [2018-02-02 09:52:59,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:52:59, skipping insertion in model container [2018-02-02 09:52:59,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:52:59" (3/3) ... [2018-02-02 09:52:59,112 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-02 09:52:59,117 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:52:59,122 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 09:52:59,146 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:52:59,146 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:52:59,147 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:52:59,147 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:52:59,147 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:52:59,147 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:52:59,147 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:52:59,147 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:52:59,148 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:52:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 09:52:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 09:52:59,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:52:59,168 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:52:59,169 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:52:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times [2018-02-02 09:52:59,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:52:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:52:59,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:52:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:52:59,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:52:59,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:52:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,310 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-02 09:52:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:52:59,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:52:59,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:52:59,325 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-02 09:52:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:52:59,390 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 09:52:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:52:59,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 09:52:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:52:59,397 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:52:59,397 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:52:59,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:52:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:52:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-02-02 09:52:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:52:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-02 09:52:59,427 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-02-02 09:52:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:52:59,428 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-02 09:52:59,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:52:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-02 09:52:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:52:59,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:52:59,428 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:52:59,429 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:52:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times [2018-02-02 09:52:59,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:52:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:52:59,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:52:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:52:59,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 09:52:59,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:52:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,504 INFO L182 omatonBuilderFactory]: Interpolants [128#true, 129#false, 130#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 131#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 09:52:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:52:59,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:52:59,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:52:59,505 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-02-02 09:52:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:52:59,609 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 09:52:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:52:59,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 09:52:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:52:59,611 INFO L225 Difference]: With dead ends: 54 [2018-02-02 09:52:59,611 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 09:52:59,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:52:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 09:52:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-02 09:52:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:52:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 09:52:59,617 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-02-02 09:52:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:52:59,617 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 09:52:59,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:52:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 09:52:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:52:59,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:52:59,618 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 09:52:59,618 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:52:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times [2018-02-02 09:52:59,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:52:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:52:59,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:52:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:52:59,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 09:52:59,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:52:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,673 INFO L182 omatonBuilderFactory]: Interpolants [240#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 236#true, 237#false, 238#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 239#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 09:52:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:52:59,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:52:59,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:52:59,674 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-02-02 09:52:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:52:59,786 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 09:52:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:52:59,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:52:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:52:59,788 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:52:59,789 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:52:59,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:52:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:52:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-02 09:52:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:52:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-02 09:52:59,796 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-02-02 09:52:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:52:59,796 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-02 09:52:59,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:52:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-02 09:52:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:52:59,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:52:59,797 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 09:52:59,797 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:52:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times [2018-02-02 09:52:59,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:52:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:52:59,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:52:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:52:59,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 09:52:59,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:52:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,851 INFO L182 omatonBuilderFactory]: Interpolants [370#true, 371#false, 372#(<= main_~i~0 0), 373#(<= main_~i~0 1), 374#(<= main_~i~0 2), 375#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 376#(and (<= main_~i~0 3) (<= 1 main_~i~0))] [2018-02-02 09:52:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:52:59,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:52:59,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:52:59,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:52:59,852 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-02-02 09:52:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:52:59,985 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-02 09:52:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:52:59,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 09:52:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:52:59,987 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:52:59,987 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:52:59,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:52:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:52:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-02-02 09:52:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:52:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-02 09:52:59,993 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-02-02 09:52:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:52:59,993 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-02 09:52:59,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:52:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-02 09:52:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:52:59,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:52:59,995 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 09:52:59,995 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:52:59,995 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times [2018-02-02 09:52:59,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:00,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:00,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 09:53:00,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,065 INFO L182 omatonBuilderFactory]: Interpolants [537#true, 538#false, 539#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 540#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 541#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 542#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 543#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-02-02 09:53:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:53:00,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:53:00,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:53:00,066 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-02-02 09:53:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:00,218 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-02 09:53:00,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:53:00,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 09:53:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:00,219 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:53:00,219 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 09:53:00,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:53:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 09:53:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-02-02 09:53:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 09:53:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-02 09:53:00,223 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-02-02 09:53:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:00,223 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-02 09:53:00,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:53:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-02 09:53:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:53:00,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:00,224 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:00,224 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times [2018-02-02 09:53:00,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:00,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:00,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:53:00,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,297 INFO L182 omatonBuilderFactory]: Interpolants [723#true, 724#false, 725#(<= main_~i~0 0), 726#(<= main_~i~0 1), 727#(<= main_~i~0 2), 728#(<= main_~i~0 3), 729#(<= main_~i~0 4), 730#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 731#(and (<= 1 main_~i~0) (<= main_~i~0 5))] [2018-02-02 09:53:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:53:00,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:53:00,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:53:00,298 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 9 states. [2018-02-02 09:53:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:00,480 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-02 09:53:00,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:53:00,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 09:53:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:00,483 INFO L225 Difference]: With dead ends: 106 [2018-02-02 09:53:00,484 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 09:53:00,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:53:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 09:53:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-02-02 09:53:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 09:53:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-02-02 09:53:00,490 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-02-02 09:53:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:00,490 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-02-02 09:53:00,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:53:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-02-02 09:53:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:53:00,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:00,491 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:00,491 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times [2018-02-02 09:53:00,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:00,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:00,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:53:00,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,555 INFO L182 omatonBuilderFactory]: Interpolants [946#true, 947#false, 948#(<= main_~i~0 0), 949#(<= main_~i~0 1), 950#(<= main_~i~0 2), 951#(<= main_~i~0 3), 952#(<= main_~i~0 4), 953#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 954#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 955#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-02-02 09:53:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:53:00,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:53:00,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:53:00,556 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-02-02 09:53:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:00,703 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-02 09:53:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:53:00,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-02 09:53:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:00,704 INFO L225 Difference]: With dead ends: 119 [2018-02-02 09:53:00,705 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 09:53:00,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:53:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 09:53:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-02 09:53:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 09:53:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 09:53:00,711 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-02-02 09:53:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:00,711 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 09:53:00,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:53:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 09:53:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:53:00,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:00,712 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:00,712 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times [2018-02-02 09:53:00,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:00,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:00,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:53:00,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,803 INFO L182 omatonBuilderFactory]: Interpolants [1200#(<= main_~i~0 1), 1201#(<= main_~i~0 2), 1202#(<= main_~i~0 3), 1203#(<= main_~i~0 4), 1204#(<= main_~i~0 5), 1205#(<= main_~i~0 6), 1206#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1207#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1197#true, 1198#false, 1199#(<= main_~i~0 0)] [2018-02-02 09:53:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:00,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:53:00,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:53:00,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:53:00,804 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-02-02 09:53:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:00,990 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-02 09:53:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:53:00,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 09:53:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:00,991 INFO L225 Difference]: With dead ends: 132 [2018-02-02 09:53:00,991 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:53:00,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:53:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:53:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-02 09:53:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 09:53:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-02 09:53:00,997 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-02-02 09:53:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:00,997 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-02 09:53:00,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:53:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-02 09:53:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:53:00,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:00,998 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:00,998 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times [2018-02-02 09:53:00,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:01,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:01,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:53:01,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,100 INFO L182 omatonBuilderFactory]: Interpolants [1476#true, 1477#false, 1478#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1479#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1480#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1481#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1482#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1483#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1484#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1485#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1486#(and (<= 8 main_~i~0) (<= main_~i~0 8))] [2018-02-02 09:53:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:53:01,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:53:01,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:53:01,101 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-02-02 09:53:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:01,413 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-02 09:53:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:53:01,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 09:53:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:01,414 INFO L225 Difference]: With dead ends: 145 [2018-02-02 09:53:01,414 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:53:01,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:53:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:53:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-02-02 09:53:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:53:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-02-02 09:53:01,420 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-02-02 09:53:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:01,421 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-02-02 09:53:01,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:53:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-02-02 09:53:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:53:01,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:01,422 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:01,422 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times [2018-02-02 09:53:01,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:01,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:01,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:53:01,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,524 INFO L182 omatonBuilderFactory]: Interpolants [1766#true, 1767#false, 1768#(<= main_~i~0 0), 1769#(<= main_~i~0 1), 1770#(<= main_~i~0 2), 1771#(<= main_~i~0 3), 1772#(<= main_~i~0 4), 1773#(<= main_~i~0 5), 1774#(<= main_~i~0 6), 1775#(<= main_~i~0 7), 1776#(<= main_~i~0 8), 1777#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1778#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-02-02 09:53:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:01,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:53:01,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:53:01,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:53:01,525 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 13 states. [2018-02-02 09:53:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:02,229 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-02 09:53:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:53:02,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 09:53:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:02,230 INFO L225 Difference]: With dead ends: 158 [2018-02-02 09:53:02,230 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 09:53:02,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:53:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 09:53:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-02-02 09:53:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 09:53:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-02-02 09:53:02,234 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-02-02 09:53:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:02,234 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-02-02 09:53:02,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:53:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-02-02 09:53:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:53:02,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:02,236 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:02,236 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times [2018-02-02 09:53:02,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:02,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:02,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:53:02,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,318 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2113#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2114#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2101#true, 2102#false, 2103#(<= main_~i~0 0), 2104#(<= main_~i~0 1), 2105#(<= main_~i~0 2), 2106#(<= main_~i~0 3), 2107#(<= main_~i~0 4), 2108#(<= main_~i~0 5), 2109#(<= main_~i~0 6), 2110#(<= main_~i~0 7), 2111#(<= main_~i~0 8)] [2018-02-02 09:53:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:53:02,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:53:02,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:53:02,319 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-02-02 09:53:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:02,560 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-02 09:53:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:53:02,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-02 09:53:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:02,561 INFO L225 Difference]: With dead ends: 171 [2018-02-02 09:53:02,561 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 09:53:02,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:53:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 09:53:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-02 09:53:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:53:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-02 09:53:02,566 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-02-02 09:53:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:02,566 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-02 09:53:02,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:53:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-02 09:53:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 09:53:02,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:02,567 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:02,567 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times [2018-02-02 09:53:02,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:02,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:02,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:53:02,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,678 INFO L182 omatonBuilderFactory]: Interpolants [2464#true, 2465#false, 2466#(<= main_~i~0 0), 2467#(<= main_~i~0 1), 2468#(<= main_~i~0 2), 2469#(<= main_~i~0 3), 2470#(<= main_~i~0 4), 2471#(<= main_~i~0 5), 2472#(<= main_~i~0 6), 2473#(<= main_~i~0 7), 2474#(<= main_~i~0 8), 2475#(<= main_~i~0 9), 2476#(<= main_~i~0 10), 2477#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2478#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-02-02 09:53:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:02,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:53:02,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:53:02,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:53:02,679 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 15 states. [2018-02-02 09:53:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:02,893 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-02 09:53:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:53:02,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 09:53:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:02,894 INFO L225 Difference]: With dead ends: 184 [2018-02-02 09:53:02,894 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 09:53:02,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:53:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 09:53:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-02 09:53:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 09:53:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-02-02 09:53:02,899 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-02-02 09:53:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:02,899 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-02-02 09:53:02,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:53:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-02-02 09:53:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:53:02,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:02,901 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:02,901 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times [2018-02-02 09:53:02,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:02,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:03,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:53:03,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,029 INFO L182 omatonBuilderFactory]: Interpolants [2855#true, 2856#false, 2857#(<= main_~i~0 0), 2858#(<= main_~i~0 1), 2859#(<= main_~i~0 2), 2860#(<= main_~i~0 3), 2861#(<= main_~i~0 4), 2862#(<= main_~i~0 5), 2863#(<= main_~i~0 6), 2864#(<= main_~i~0 7), 2865#(<= main_~i~0 8), 2866#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2867#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2868#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2869#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2870#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-02-02 09:53:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:53:03,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:53:03,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:53:03,030 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 16 states. [2018-02-02 09:53:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:03,420 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-02 09:53:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:53:03,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-02 09:53:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:03,421 INFO L225 Difference]: With dead ends: 197 [2018-02-02 09:53:03,421 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 09:53:03,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:53:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 09:53:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-02 09:53:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 09:53:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-02 09:53:03,426 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-02-02 09:53:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:03,426 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-02 09:53:03,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:53:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-02 09:53:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 09:53:03,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:03,427 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:03,427 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times [2018-02-02 09:53:03,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:03,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:03,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:53:03,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,597 INFO L182 omatonBuilderFactory]: Interpolants [3274#true, 3275#false, 3276#(<= main_~i~0 0), 3277#(<= main_~i~0 1), 3278#(<= main_~i~0 2), 3279#(<= main_~i~0 3), 3280#(<= main_~i~0 4), 3281#(<= main_~i~0 5), 3282#(<= main_~i~0 6), 3283#(<= main_~i~0 7), 3284#(<= main_~i~0 8), 3285#(<= main_~i~0 9), 3286#(<= main_~i~0 10), 3287#(<= main_~i~0 11), 3288#(<= main_~i~0 12), 3289#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3290#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-02-02 09:53:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:03,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:53:03,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:53:03,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:53:03,598 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-02-02 09:53:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:04,018 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-02 09:53:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:53:04,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 09:53:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:04,020 INFO L225 Difference]: With dead ends: 210 [2018-02-02 09:53:04,020 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 09:53:04,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:53:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 09:53:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-02-02 09:53:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:53:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-02-02 09:53:04,023 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-02-02 09:53:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:04,023 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-02-02 09:53:04,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:53:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-02-02 09:53:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 09:53:04,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:04,024 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:04,024 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times [2018-02-02 09:53:04,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:04,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:04,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:53:04,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,246 INFO L182 omatonBuilderFactory]: Interpolants [3721#true, 3722#false, 3723#(<= main_~i~0 0), 3724#(<= main_~i~0 1), 3725#(<= main_~i~0 2), 3726#(<= main_~i~0 3), 3727#(<= main_~i~0 4), 3728#(<= main_~i~0 5), 3729#(<= main_~i~0 6), 3730#(<= main_~i~0 7), 3731#(<= main_~i~0 8), 3732#(<= main_~i~0 9), 3733#(<= main_~i~0 10), 3734#(<= main_~i~0 11), 3735#(<= main_~i~0 12), 3736#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3737#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3738#(and (<= 2 main_~i~0) (<= main_~i~0 14))] [2018-02-02 09:53:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:53:04,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:53:04,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:53:04,248 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-02-02 09:53:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:04,600 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 09:53:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:53:04,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-02 09:53:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:04,601 INFO L225 Difference]: With dead ends: 223 [2018-02-02 09:53:04,601 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 09:53:04,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:53:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 09:53:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-02-02 09:53:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 09:53:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-02 09:53:04,608 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-02-02 09:53:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:04,608 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-02 09:53:04,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:53:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-02 09:53:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:53:04,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:04,609 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:04,609 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times [2018-02-02 09:53:04,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:04,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:04,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:53:04,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,749 INFO L182 omatonBuilderFactory]: Interpolants [4196#true, 4197#false, 4198#(<= main_~i~0 0), 4199#(<= main_~i~0 1), 4200#(<= main_~i~0 2), 4201#(<= main_~i~0 3), 4202#(<= main_~i~0 4), 4203#(<= main_~i~0 5), 4204#(<= main_~i~0 6), 4205#(<= main_~i~0 7), 4206#(<= main_~i~0 8), 4207#(<= main_~i~0 9), 4208#(<= main_~i~0 10), 4209#(<= main_~i~0 11), 4210#(<= main_~i~0 12), 4211#(<= main_~i~0 13), 4212#(<= main_~i~0 14), 4213#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4214#(and (<= 1 main_~i~0) (<= main_~i~0 15))] [2018-02-02 09:53:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:04,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:53:04,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:53:04,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:53:04,750 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 19 states. [2018-02-02 09:53:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:05,053 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-02 09:53:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:53:05,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-02 09:53:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:05,054 INFO L225 Difference]: With dead ends: 236 [2018-02-02 09:53:05,054 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 09:53:05,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:53:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 09:53:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-02-02 09:53:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:53:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-02-02 09:53:05,060 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-02-02 09:53:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:05,060 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-02-02 09:53:05,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:53:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-02-02 09:53:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:53:05,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:05,061 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:05,061 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times [2018-02-02 09:53:05,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:05,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:05,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:05,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:53:05,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:05,231 INFO L182 omatonBuilderFactory]: Interpolants [4704#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 4705#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 4706#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 4707#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 4708#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 4709#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 4710#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 4711#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 4712#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 4713#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 4714#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 4715#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 4716#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 4717#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 4699#true, 4700#false, 4701#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 4702#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 4703#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-02-02 09:53:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:05,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:53:05,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:53:05,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:53:05,232 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-02-02 09:53:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:06,279 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-02 09:53:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:53:06,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-02 09:53:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:06,280 INFO L225 Difference]: With dead ends: 249 [2018-02-02 09:53:06,281 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 09:53:06,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:53:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 09:53:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-02-02 09:53:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 09:53:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-02-02 09:53:06,286 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-02-02 09:53:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:06,286 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-02-02 09:53:06,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:53:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-02-02 09:53:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 09:53:06,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:06,287 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:06,287 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times [2018-02-02 09:53:06,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:06,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:06,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:06,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 09:53:06,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:06,457 INFO L182 omatonBuilderFactory]: Interpolants [5216#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5217#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5197#true, 5198#false, 5199#(<= main_~i~0 0), 5200#(<= main_~i~0 1), 5201#(<= main_~i~0 2), 5202#(<= main_~i~0 3), 5203#(<= main_~i~0 4), 5204#(<= main_~i~0 5), 5205#(<= main_~i~0 6), 5206#(<= main_~i~0 7), 5207#(<= main_~i~0 8), 5208#(<= main_~i~0 9), 5209#(<= main_~i~0 10), 5210#(<= main_~i~0 11), 5211#(<= main_~i~0 12), 5212#(<= main_~i~0 13), 5213#(<= main_~i~0 14), 5214#(<= main_~i~0 15), 5215#(<= main_~i~0 16)] [2018-02-02 09:53:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:06,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:53:06,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:53:06,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:53:06,458 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 21 states. [2018-02-02 09:53:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:06,869 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-02 09:53:06,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:53:06,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-02-02 09:53:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:06,870 INFO L225 Difference]: With dead ends: 262 [2018-02-02 09:53:06,871 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 09:53:06,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:53:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 09:53:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-02-02 09:53:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 09:53:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-02 09:53:06,875 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-02-02 09:53:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:06,875 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-02 09:53:06,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:53:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-02 09:53:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 09:53:06,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:06,876 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:06,876 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times [2018-02-02 09:53:06,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:06,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:07,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:53:07,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,028 INFO L182 omatonBuilderFactory]: Interpolants [5760#(<= main_~i~0 2), 5761#(<= main_~i~0 3), 5762#(<= main_~i~0 4), 5763#(<= main_~i~0 5), 5764#(<= main_~i~0 6), 5765#(<= main_~i~0 7), 5766#(<= main_~i~0 8), 5767#(<= main_~i~0 9), 5768#(<= main_~i~0 10), 5769#(<= main_~i~0 11), 5770#(<= main_~i~0 12), 5771#(<= main_~i~0 13), 5772#(<= main_~i~0 14), 5773#(<= main_~i~0 15), 5774#(<= main_~i~0 16), 5775#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5776#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5777#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5756#true, 5757#false, 5758#(<= main_~i~0 0), 5759#(<= main_~i~0 1)] [2018-02-02 09:53:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:53:07,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:53:07,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:53:07,029 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 22 states. [2018-02-02 09:53:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:07,479 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-02 09:53:07,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:53:07,480 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-02-02 09:53:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:07,480 INFO L225 Difference]: With dead ends: 275 [2018-02-02 09:53:07,481 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 09:53:07,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:53:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 09:53:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-02-02 09:53:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 09:53:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-02-02 09:53:07,484 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-02-02 09:53:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:07,484 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-02-02 09:53:07,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:53:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-02-02 09:53:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 09:53:07,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:07,485 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:07,485 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times [2018-02-02 09:53:07,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:07,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:07,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 09:53:07,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,695 INFO L182 omatonBuilderFactory]: Interpolants [6343#true, 6344#false, 6345#(<= main_~i~0 0), 6346#(<= main_~i~0 1), 6347#(<= main_~i~0 2), 6348#(<= main_~i~0 3), 6349#(<= main_~i~0 4), 6350#(<= main_~i~0 5), 6351#(<= main_~i~0 6), 6352#(<= main_~i~0 7), 6353#(<= main_~i~0 8), 6354#(<= main_~i~0 9), 6355#(<= main_~i~0 10), 6356#(<= main_~i~0 11), 6357#(<= main_~i~0 12), 6358#(<= main_~i~0 13), 6359#(<= main_~i~0 14), 6360#(<= main_~i~0 15), 6361#(<= main_~i~0 16), 6362#(<= main_~i~0 17), 6363#(<= main_~i~0 18), 6364#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 6365#(and (<= 1 main_~i~0) (<= main_~i~0 19))] [2018-02-02 09:53:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:07,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:53:07,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:53:07,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:53:07,696 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-02-02 09:53:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:08,248 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-02 09:53:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:53:08,249 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-02 09:53:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:08,250 INFO L225 Difference]: With dead ends: 288 [2018-02-02 09:53:08,250 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 09:53:08,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 09:53:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 09:53:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-02-02 09:53:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 09:53:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-02-02 09:53:08,254 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-02-02 09:53:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:08,254 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-02-02 09:53:08,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:53:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-02-02 09:53:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 09:53:08,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:08,255 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:08,255 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times [2018-02-02 09:53:08,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:08,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:08,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:08,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:53:08,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:08,462 INFO L182 omatonBuilderFactory]: Interpolants [6976#(<= main_~i~0 16), 6977#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6978#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6979#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6980#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 6981#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 6958#true, 6959#false, 6960#(<= main_~i~0 0), 6961#(<= main_~i~0 1), 6962#(<= main_~i~0 2), 6963#(<= main_~i~0 3), 6964#(<= main_~i~0 4), 6965#(<= main_~i~0 5), 6966#(<= main_~i~0 6), 6967#(<= main_~i~0 7), 6968#(<= main_~i~0 8), 6969#(<= main_~i~0 9), 6970#(<= main_~i~0 10), 6971#(<= main_~i~0 11), 6972#(<= main_~i~0 12), 6973#(<= main_~i~0 13), 6974#(<= main_~i~0 14), 6975#(<= main_~i~0 15)] [2018-02-02 09:53:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:08,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:53:08,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:53:08,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:53:08,463 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-02-02 09:53:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:09,086 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-02 09:53:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:53:09,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-02 09:53:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:09,087 INFO L225 Difference]: With dead ends: 301 [2018-02-02 09:53:09,087 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 09:53:09,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:53:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 09:53:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-02-02 09:53:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 09:53:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-02-02 09:53:09,091 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-02-02 09:53:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:09,091 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-02-02 09:53:09,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:53:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-02-02 09:53:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 09:53:09,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:09,092 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:09,092 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times [2018-02-02 09:53:09,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:09,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:09,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:09,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:53:09,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:09,309 INFO L182 omatonBuilderFactory]: Interpolants [7616#(<= main_~i~0 13), 7617#(<= main_~i~0 14), 7618#(<= main_~i~0 15), 7619#(<= main_~i~0 16), 7620#(<= main_~i~0 17), 7621#(<= main_~i~0 18), 7622#(<= main_~i~0 19), 7623#(<= main_~i~0 20), 7624#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 7625#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 7601#true, 7602#false, 7603#(<= main_~i~0 0), 7604#(<= main_~i~0 1), 7605#(<= main_~i~0 2), 7606#(<= main_~i~0 3), 7607#(<= main_~i~0 4), 7608#(<= main_~i~0 5), 7609#(<= main_~i~0 6), 7610#(<= main_~i~0 7), 7611#(<= main_~i~0 8), 7612#(<= main_~i~0 9), 7613#(<= main_~i~0 10), 7614#(<= main_~i~0 11), 7615#(<= main_~i~0 12)] [2018-02-02 09:53:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:09,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:53:09,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:53:09,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:53:09,310 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-02-02 09:53:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:09,913 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-02 09:53:09,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:53:09,913 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-02 09:53:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:09,915 INFO L225 Difference]: With dead ends: 314 [2018-02-02 09:53:09,915 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 09:53:09,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:53:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 09:53:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-02-02 09:53:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 09:53:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-02-02 09:53:09,919 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-02-02 09:53:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:09,919 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-02-02 09:53:09,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:53:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-02-02 09:53:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 09:53:09,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:09,920 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:09,920 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times [2018-02-02 09:53:09,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:09,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:10,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:53:10,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,126 INFO L182 omatonBuilderFactory]: Interpolants [8272#true, 8273#false, 8274#(<= main_~i~0 0), 8275#(<= main_~i~0 1), 8276#(<= main_~i~0 2), 8277#(<= main_~i~0 3), 8278#(<= main_~i~0 4), 8279#(<= main_~i~0 5), 8280#(<= main_~i~0 6), 8281#(<= main_~i~0 7), 8282#(<= main_~i~0 8), 8283#(<= main_~i~0 9), 8284#(<= main_~i~0 10), 8285#(<= main_~i~0 11), 8286#(<= main_~i~0 12), 8287#(<= main_~i~0 13), 8288#(<= main_~i~0 14), 8289#(<= main_~i~0 15), 8290#(<= main_~i~0 16), 8291#(<= main_~i~0 17), 8292#(<= main_~i~0 18), 8293#(<= main_~i~0 19), 8294#(<= main_~i~0 20), 8295#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8296#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8297#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-02-02 09:53:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:53:10,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:53:10,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:53:10,127 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-02-02 09:53:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:10,697 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-02 09:53:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:53:10,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-02 09:53:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:10,698 INFO L225 Difference]: With dead ends: 327 [2018-02-02 09:53:10,698 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 09:53:10,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:53:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 09:53:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-02-02 09:53:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-02 09:53:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-02-02 09:53:10,703 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-02-02 09:53:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:10,703 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-02-02 09:53:10,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:53:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-02-02 09:53:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 09:53:10,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:10,704 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:10,704 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times [2018-02-02 09:53:10,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:10,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:10,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 09:53:10,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,953 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(<= main_~i~0 0), 8974#(<= main_~i~0 1), 8975#(<= main_~i~0 2), 8976#(<= main_~i~0 3), 8977#(<= main_~i~0 4), 8978#(<= main_~i~0 5), 8979#(<= main_~i~0 6), 8980#(<= main_~i~0 7), 8981#(<= main_~i~0 8), 8982#(<= main_~i~0 9), 8983#(<= main_~i~0 10), 8984#(<= main_~i~0 11), 8985#(<= main_~i~0 12), 8986#(<= main_~i~0 13), 8987#(<= main_~i~0 14), 8988#(<= main_~i~0 15), 8989#(<= main_~i~0 16), 8990#(<= main_~i~0 17), 8991#(<= main_~i~0 18), 8992#(<= main_~i~0 19), 8993#(<= main_~i~0 20), 8994#(<= main_~i~0 21), 8995#(<= main_~i~0 22), 8996#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 8997#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-02-02 09:53:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:10,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:53:10,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:53:10,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:53:10,954 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 27 states. [2018-02-02 09:53:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:11,554 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-02 09:53:11,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:53:11,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-02-02 09:53:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:11,555 INFO L225 Difference]: With dead ends: 340 [2018-02-02 09:53:11,555 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 09:53:11,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 09:53:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 09:53:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-02-02 09:53:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 09:53:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-02 09:53:11,558 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-02-02 09:53:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:11,559 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-02 09:53:11,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:53:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-02 09:53:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 09:53:11,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:11,559 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:11,559 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times [2018-02-02 09:53:11,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:11,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:11,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:11,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:53:11,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:11,791 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(<= main_~i~0 0), 9701#(<= main_~i~0 1), 9702#(<= main_~i~0 2), 9703#(<= main_~i~0 3), 9704#(<= main_~i~0 4), 9705#(<= main_~i~0 5), 9706#(<= main_~i~0 6), 9707#(<= main_~i~0 7), 9708#(<= main_~i~0 8), 9709#(<= main_~i~0 9), 9710#(<= main_~i~0 10), 9711#(<= main_~i~0 11), 9712#(<= main_~i~0 12), 9713#(<= main_~i~0 13), 9714#(<= main_~i~0 14), 9715#(<= main_~i~0 15), 9716#(<= main_~i~0 16), 9717#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 9718#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 9719#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 9720#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 9721#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 9722#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 9723#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 9724#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 9725#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-02-02 09:53:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:11,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:53:11,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:53:11,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:53:11,792 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 28 states. [2018-02-02 09:53:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:12,714 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-02 09:53:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:53:12,715 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-02-02 09:53:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:12,715 INFO L225 Difference]: With dead ends: 353 [2018-02-02 09:53:12,716 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 09:53:12,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:53:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 09:53:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-02-02 09:53:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 09:53:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-02-02 09:53:12,721 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-02-02 09:53:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:12,721 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-02-02 09:53:12,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:53:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-02-02 09:53:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 09:53:12,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:12,722 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:12,722 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times [2018-02-02 09:53:12,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:12,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:12,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:12,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 09:53:12,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:12,957 INFO L182 omatonBuilderFactory]: Interpolants [10453#true, 10454#false, 10455#(<= main_~i~0 0), 10456#(<= main_~i~0 1), 10457#(<= main_~i~0 2), 10458#(<= main_~i~0 3), 10459#(<= main_~i~0 4), 10460#(<= main_~i~0 5), 10461#(<= main_~i~0 6), 10462#(<= main_~i~0 7), 10463#(<= main_~i~0 8), 10464#(<= main_~i~0 9), 10465#(<= main_~i~0 10), 10466#(<= main_~i~0 11), 10467#(<= main_~i~0 12), 10468#(<= main_~i~0 13), 10469#(<= main_~i~0 14), 10470#(<= main_~i~0 15), 10471#(<= main_~i~0 16), 10472#(<= main_~i~0 17), 10473#(<= main_~i~0 18), 10474#(<= main_~i~0 19), 10475#(<= main_~i~0 20), 10476#(<= main_~i~0 21), 10477#(<= main_~i~0 22), 10478#(<= main_~i~0 23), 10479#(<= main_~i~0 24), 10480#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 10481#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-02-02 09:53:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:12,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 09:53:12,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 09:53:12,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:53:12,958 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-02-02 09:53:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:13,581 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-02 09:53:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 09:53:13,581 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-02 09:53:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:13,583 INFO L225 Difference]: With dead ends: 366 [2018-02-02 09:53:13,583 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 09:53:13,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 09:53:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 09:53:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-02-02 09:53:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 09:53:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-02-02 09:53:13,587 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-02-02 09:53:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:13,587 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-02-02 09:53:13,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 09:53:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-02-02 09:53:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 09:53:13,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:13,588 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:13,588 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times [2018-02-02 09:53:13,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:13,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:13,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:13,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:53:13,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:13,864 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 11265#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 11236#true, 11237#false, 11238#(<= main_~i~0 0), 11239#(<= main_~i~0 1), 11240#(<= main_~i~0 2), 11241#(<= main_~i~0 3), 11242#(<= main_~i~0 4), 11243#(<= main_~i~0 5), 11244#(<= main_~i~0 6), 11245#(<= main_~i~0 7), 11246#(<= main_~i~0 8), 11247#(<= main_~i~0 9), 11248#(<= main_~i~0 10), 11249#(<= main_~i~0 11), 11250#(<= main_~i~0 12), 11251#(<= main_~i~0 13), 11252#(<= main_~i~0 14), 11253#(<= main_~i~0 15), 11254#(<= main_~i~0 16), 11255#(<= main_~i~0 17), 11256#(<= main_~i~0 18), 11257#(<= main_~i~0 19), 11258#(<= main_~i~0 20), 11259#(<= main_~i~0 21), 11260#(<= main_~i~0 22), 11261#(<= main_~i~0 23), 11262#(<= main_~i~0 24), 11263#(and (<= 0 main_~i~0) (<= main_~i~0 24))] [2018-02-02 09:53:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:13,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:53:13,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:53:13,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:53:13,865 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-02-02 09:53:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:14,546 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-02 09:53:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:53:14,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-02 09:53:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:14,548 INFO L225 Difference]: With dead ends: 379 [2018-02-02 09:53:14,548 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 09:53:14,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 09:53:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 09:53:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-02-02 09:53:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 09:53:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-02-02 09:53:14,553 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-02-02 09:53:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:14,553 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-02-02 09:53:14,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:53:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-02-02 09:53:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 09:53:14,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:14,555 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:14,555 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times [2018-02-02 09:53:14,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:14,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:14,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:14,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 09:53:14,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:14,937 INFO L182 omatonBuilderFactory]: Interpolants [12047#true, 12048#false, 12049#(<= main_~i~0 0), 12050#(<= main_~i~0 1), 12051#(<= main_~i~0 2), 12052#(<= main_~i~0 3), 12053#(<= main_~i~0 4), 12054#(<= main_~i~0 5), 12055#(<= main_~i~0 6), 12056#(<= main_~i~0 7), 12057#(<= main_~i~0 8), 12058#(<= main_~i~0 9), 12059#(<= main_~i~0 10), 12060#(<= main_~i~0 11), 12061#(<= main_~i~0 12), 12062#(<= main_~i~0 13), 12063#(<= main_~i~0 14), 12064#(<= main_~i~0 15), 12065#(<= main_~i~0 16), 12066#(<= main_~i~0 17), 12067#(<= main_~i~0 18), 12068#(<= main_~i~0 19), 12069#(<= main_~i~0 20), 12070#(<= main_~i~0 21), 12071#(<= main_~i~0 22), 12072#(<= main_~i~0 23), 12073#(<= main_~i~0 24), 12074#(<= main_~i~0 25), 12075#(<= main_~i~0 26), 12076#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 12077#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-02-02 09:53:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:14,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:53:14,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:53:14,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:53:14,938 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-02-02 09:53:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:15,583 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-02 09:53:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:53:15,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-02 09:53:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:15,584 INFO L225 Difference]: With dead ends: 392 [2018-02-02 09:53:15,584 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 09:53:15,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:53:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 09:53:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-02-02 09:53:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 09:53:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-02-02 09:53:15,589 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-02-02 09:53:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:15,589 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-02-02 09:53:15,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:53:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-02-02 09:53:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 09:53:15,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:15,589 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:15,590 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times [2018-02-02 09:53:15,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:15,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:15,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:15,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:53:15,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:15,921 INFO L182 omatonBuilderFactory]: Interpolants [12886#true, 12887#false, 12888#(<= main_~i~0 0), 12889#(<= main_~i~0 1), 12890#(<= main_~i~0 2), 12891#(<= main_~i~0 3), 12892#(<= main_~i~0 4), 12893#(<= main_~i~0 5), 12894#(<= main_~i~0 6), 12895#(<= main_~i~0 7), 12896#(<= main_~i~0 8), 12897#(<= main_~i~0 9), 12898#(<= main_~i~0 10), 12899#(<= main_~i~0 11), 12900#(<= main_~i~0 12), 12901#(<= main_~i~0 13), 12902#(<= main_~i~0 14), 12903#(<= main_~i~0 15), 12904#(<= main_~i~0 16), 12905#(<= main_~i~0 17), 12906#(<= main_~i~0 18), 12907#(<= main_~i~0 19), 12908#(<= main_~i~0 20), 12909#(<= main_~i~0 21), 12910#(<= main_~i~0 22), 12911#(<= main_~i~0 23), 12912#(<= main_~i~0 24), 12913#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12914#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 12915#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 12916#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 12917#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-02-02 09:53:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:15,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:53:15,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:53:15,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:53:15,922 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 32 states. [2018-02-02 09:53:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:16,873 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-02 09:53:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:53:16,906 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-02-02 09:53:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:16,907 INFO L225 Difference]: With dead ends: 405 [2018-02-02 09:53:16,908 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 09:53:16,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:53:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 09:53:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-02-02 09:53:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-02 09:53:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-02-02 09:53:16,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-02-02 09:53:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:16,914 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-02-02 09:53:16,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:53:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-02-02 09:53:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 09:53:16,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:16,915 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:16,915 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times [2018-02-02 09:53:16,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:16,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:17,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:17,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 09:53:17,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:17,392 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 5), 13761#(<= main_~i~0 6), 13762#(<= main_~i~0 7), 13763#(<= main_~i~0 8), 13764#(<= main_~i~0 9), 13765#(<= main_~i~0 10), 13766#(<= main_~i~0 11), 13767#(<= main_~i~0 12), 13768#(<= main_~i~0 13), 13769#(<= main_~i~0 14), 13770#(<= main_~i~0 15), 13771#(<= main_~i~0 16), 13772#(<= main_~i~0 17), 13773#(<= main_~i~0 18), 13774#(<= main_~i~0 19), 13775#(<= main_~i~0 20), 13776#(<= main_~i~0 21), 13777#(<= main_~i~0 22), 13778#(<= main_~i~0 23), 13779#(<= main_~i~0 24), 13780#(<= main_~i~0 25), 13781#(<= main_~i~0 26), 13782#(<= main_~i~0 27), 13783#(<= main_~i~0 28), 13784#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 13785#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 13753#true, 13754#false, 13755#(<= main_~i~0 0), 13756#(<= main_~i~0 1), 13757#(<= main_~i~0 2), 13758#(<= main_~i~0 3), 13759#(<= main_~i~0 4)] [2018-02-02 09:53:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:17,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 09:53:17,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 09:53:17,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:53:17,394 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 33 states. [2018-02-02 09:53:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:18,151 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-02 09:53:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:53:18,151 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-02-02 09:53:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:18,152 INFO L225 Difference]: With dead ends: 418 [2018-02-02 09:53:18,152 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 09:53:18,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 09:53:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 09:53:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-02-02 09:53:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 09:53:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-02-02 09:53:18,158 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-02-02 09:53:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:18,158 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-02-02 09:53:18,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 09:53:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-02-02 09:53:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 09:53:18,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:18,160 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:18,160 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times [2018-02-02 09:53:18,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:18,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:18,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:18,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:53:18,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:18,604 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 6), 14657#(<= main_~i~0 7), 14658#(<= main_~i~0 8), 14659#(<= main_~i~0 9), 14660#(<= main_~i~0 10), 14661#(<= main_~i~0 11), 14662#(<= main_~i~0 12), 14663#(<= main_~i~0 13), 14664#(<= main_~i~0 14), 14665#(<= main_~i~0 15), 14666#(<= main_~i~0 16), 14667#(<= main_~i~0 17), 14668#(<= main_~i~0 18), 14669#(<= main_~i~0 19), 14670#(<= main_~i~0 20), 14671#(<= main_~i~0 21), 14672#(<= main_~i~0 22), 14673#(<= main_~i~0 23), 14674#(<= main_~i~0 24), 14675#(<= main_~i~0 25), 14676#(<= main_~i~0 26), 14677#(<= main_~i~0 27), 14678#(<= main_~i~0 28), 14679#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 14680#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 14681#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 14648#true, 14649#false, 14650#(<= main_~i~0 0), 14651#(<= main_~i~0 1), 14652#(<= main_~i~0 2), 14653#(<= main_~i~0 3), 14654#(<= main_~i~0 4), 14655#(<= main_~i~0 5)] [2018-02-02 09:53:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:18,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:53:18,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:53:18,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:53:18,606 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 34 states. [2018-02-02 09:53:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:19,446 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-02 09:53:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:53:19,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-02-02 09:53:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:19,447 INFO L225 Difference]: With dead ends: 431 [2018-02-02 09:53:19,448 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 09:53:19,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 09:53:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 09:53:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-02-02 09:53:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 09:53:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-02-02 09:53:19,454 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-02-02 09:53:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:19,455 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-02-02 09:53:19,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:53:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-02-02 09:53:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 09:53:19,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:19,456 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:19,456 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times [2018-02-02 09:53:19,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:19,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:19,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:19,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 09:53:19,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:19,880 INFO L182 omatonBuilderFactory]: Interpolants [15571#true, 15572#false, 15573#(<= main_~i~0 0), 15574#(<= main_~i~0 1), 15575#(<= main_~i~0 2), 15576#(<= main_~i~0 3), 15577#(<= main_~i~0 4), 15578#(<= main_~i~0 5), 15579#(<= main_~i~0 6), 15580#(<= main_~i~0 7), 15581#(<= main_~i~0 8), 15582#(<= main_~i~0 9), 15583#(<= main_~i~0 10), 15584#(<= main_~i~0 11), 15585#(<= main_~i~0 12), 15586#(<= main_~i~0 13), 15587#(<= main_~i~0 14), 15588#(<= main_~i~0 15), 15589#(<= main_~i~0 16), 15590#(<= main_~i~0 17), 15591#(<= main_~i~0 18), 15592#(<= main_~i~0 19), 15593#(<= main_~i~0 20), 15594#(<= main_~i~0 21), 15595#(<= main_~i~0 22), 15596#(<= main_~i~0 23), 15597#(<= main_~i~0 24), 15598#(<= main_~i~0 25), 15599#(<= main_~i~0 26), 15600#(<= main_~i~0 27), 15601#(<= main_~i~0 28), 15602#(<= main_~i~0 29), 15603#(<= main_~i~0 30), 15604#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 15605#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-02-02 09:53:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:19,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:53:19,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:53:19,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:53:19,882 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-02-02 09:53:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:20,711 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-02 09:53:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 09:53:20,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-02 09:53:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:20,713 INFO L225 Difference]: With dead ends: 444 [2018-02-02 09:53:20,713 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 09:53:20,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 09:53:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 09:53:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-02-02 09:53:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 09:53:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-02-02 09:53:20,719 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-02-02 09:53:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:20,720 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-02-02 09:53:20,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:53:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-02-02 09:53:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 09:53:20,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:20,721 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:20,721 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times [2018-02-02 09:53:20,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:20,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:21,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:21,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 09:53:21,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:21,248 INFO L182 omatonBuilderFactory]: Interpolants [16522#true, 16523#false, 16524#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 16525#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 16526#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 16527#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 16528#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 16529#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 16530#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 16531#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 16532#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 16533#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 16534#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 16535#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 16536#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 16537#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 16538#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 16539#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 16540#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 16541#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 16542#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 16543#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 16544#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 16545#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 16546#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 16547#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 16548#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 16549#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 16550#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 16551#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 16552#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 16553#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 16554#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 16555#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 16556#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-02-02 09:53:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:21,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:53:21,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:53:21,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:53:21,249 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-02-02 09:53:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:24,404 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-02 09:53:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 09:53:24,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-02 09:53:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:24,405 INFO L225 Difference]: With dead ends: 457 [2018-02-02 09:53:24,405 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 09:53:24,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:53:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 09:53:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-02-02 09:53:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 09:53:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-02-02 09:53:24,410 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-02-02 09:53:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:24,410 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-02-02 09:53:24,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:53:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-02-02 09:53:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 09:53:24,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:24,411 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:24,411 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times [2018-02-02 09:53:24,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:24,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:24,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:24,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 09:53:24,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:24,886 INFO L182 omatonBuilderFactory]: Interpolants [17472#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17436#true, 17437#false, 17438#(<= main_~i~0 0), 17439#(<= main_~i~0 1), 17440#(<= main_~i~0 2), 17441#(<= main_~i~0 3), 17442#(<= main_~i~0 4), 17443#(<= main_~i~0 5), 17444#(<= main_~i~0 6), 17445#(<= main_~i~0 7), 17446#(<= main_~i~0 8), 17447#(<= main_~i~0 9), 17448#(<= main_~i~0 10), 17449#(<= main_~i~0 11), 17450#(<= main_~i~0 12), 17451#(<= main_~i~0 13), 17452#(<= main_~i~0 14), 17453#(<= main_~i~0 15), 17454#(<= main_~i~0 16), 17455#(<= main_~i~0 17), 17456#(<= main_~i~0 18), 17457#(<= main_~i~0 19), 17458#(<= main_~i~0 20), 17459#(<= main_~i~0 21), 17460#(<= main_~i~0 22), 17461#(<= main_~i~0 23), 17462#(<= main_~i~0 24), 17463#(<= main_~i~0 25), 17464#(<= main_~i~0 26), 17465#(<= main_~i~0 27), 17466#(<= main_~i~0 28), 17467#(<= main_~i~0 29), 17468#(<= main_~i~0 30), 17469#(<= main_~i~0 31), 17470#(<= main_~i~0 32), 17471#(and (<= 0 main_~i~0) (<= main_~i~0 32))] [2018-02-02 09:53:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:24,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:53:24,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:53:24,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:53:24,887 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-02-02 09:53:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:25,792 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-02 09:53:25,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:53:25,797 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-02 09:53:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:25,798 INFO L225 Difference]: With dead ends: 470 [2018-02-02 09:53:25,798 INFO L226 Difference]: Without dead ends: 470 [2018-02-02 09:53:25,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 09:53:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-02 09:53:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-02-02 09:53:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 09:53:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-02-02 09:53:25,802 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-02-02 09:53:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:25,802 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-02-02 09:53:25,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 09:53:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-02-02 09:53:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 09:53:25,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:25,803 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:25,803 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times [2018-02-02 09:53:25,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:25,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:26,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:26,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 09:53:26,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:26,228 INFO L182 omatonBuilderFactory]: Interpolants [18443#true, 18444#false, 18445#(<= main_~i~0 0), 18446#(<= main_~i~0 1), 18447#(<= main_~i~0 2), 18448#(<= main_~i~0 3), 18449#(<= main_~i~0 4), 18450#(<= main_~i~0 5), 18451#(<= main_~i~0 6), 18452#(<= main_~i~0 7), 18453#(<= main_~i~0 8), 18454#(<= main_~i~0 9), 18455#(<= main_~i~0 10), 18456#(<= main_~i~0 11), 18457#(<= main_~i~0 12), 18458#(<= main_~i~0 13), 18459#(<= main_~i~0 14), 18460#(<= main_~i~0 15), 18461#(<= main_~i~0 16), 18462#(<= main_~i~0 17), 18463#(<= main_~i~0 18), 18464#(<= main_~i~0 19), 18465#(<= main_~i~0 20), 18466#(<= main_~i~0 21), 18467#(<= main_~i~0 22), 18468#(<= main_~i~0 23), 18469#(<= main_~i~0 24), 18470#(<= main_~i~0 25), 18471#(<= main_~i~0 26), 18472#(<= main_~i~0 27), 18473#(<= main_~i~0 28), 18474#(<= main_~i~0 29), 18475#(<= main_~i~0 30), 18476#(<= main_~i~0 31), 18477#(<= main_~i~0 32), 18478#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 18479#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 18480#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-02-02 09:53:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:26,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 09:53:26,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 09:53:26,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:53:26,229 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-02-02 09:53:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:27,176 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-02 09:53:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 09:53:27,176 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-02 09:53:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:27,177 INFO L225 Difference]: With dead ends: 483 [2018-02-02 09:53:27,177 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 09:53:27,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 09:53:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 09:53:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-02-02 09:53:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 09:53:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-02-02 09:53:27,182 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-02-02 09:53:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:27,182 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-02-02 09:53:27,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 09:53:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-02-02 09:53:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 09:53:27,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:27,183 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:27,183 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times [2018-02-02 09:53:27,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:27,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:27,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:27,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 09:53:27,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:27,624 INFO L182 omatonBuilderFactory]: Interpolants [19478#true, 19479#false, 19480#(<= main_~i~0 0), 19481#(<= main_~i~0 1), 19482#(<= main_~i~0 2), 19483#(<= main_~i~0 3), 19484#(<= main_~i~0 4), 19485#(<= main_~i~0 5), 19486#(<= main_~i~0 6), 19487#(<= main_~i~0 7), 19488#(<= main_~i~0 8), 19489#(<= main_~i~0 9), 19490#(<= main_~i~0 10), 19491#(<= main_~i~0 11), 19492#(<= main_~i~0 12), 19493#(<= main_~i~0 13), 19494#(<= main_~i~0 14), 19495#(<= main_~i~0 15), 19496#(<= main_~i~0 16), 19497#(<= main_~i~0 17), 19498#(<= main_~i~0 18), 19499#(<= main_~i~0 19), 19500#(<= main_~i~0 20), 19501#(<= main_~i~0 21), 19502#(<= main_~i~0 22), 19503#(<= main_~i~0 23), 19504#(<= main_~i~0 24), 19505#(<= main_~i~0 25), 19506#(<= main_~i~0 26), 19507#(<= main_~i~0 27), 19508#(<= main_~i~0 28), 19509#(<= main_~i~0 29), 19510#(<= main_~i~0 30), 19511#(<= main_~i~0 31), 19512#(<= main_~i~0 32), 19513#(<= main_~i~0 33), 19514#(<= main_~i~0 34), 19515#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 19516#(and (<= 1 main_~i~0) (<= main_~i~0 35))] [2018-02-02 09:53:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:27,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:53:27,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:53:27,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:53:27,625 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 39 states. [2018-02-02 09:53:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:28,578 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-02 09:53:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:53:28,578 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-02-02 09:53:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:28,579 INFO L225 Difference]: With dead ends: 496 [2018-02-02 09:53:28,579 INFO L226 Difference]: Without dead ends: 496 [2018-02-02 09:53:28,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 09:53:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-02 09:53:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-02-02 09:53:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-02 09:53:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-02-02 09:53:28,582 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-02-02 09:53:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:28,582 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-02-02 09:53:28,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:53:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-02-02 09:53:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 09:53:28,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:28,583 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:28,583 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times [2018-02-02 09:53:28,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:28,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:28,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:28,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 09:53:28,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:28,980 INFO L182 omatonBuilderFactory]: Interpolants [20544#(<= main_~i~0 1), 20545#(<= main_~i~0 2), 20546#(<= main_~i~0 3), 20547#(<= main_~i~0 4), 20548#(<= main_~i~0 5), 20549#(<= main_~i~0 6), 20550#(<= main_~i~0 7), 20551#(<= main_~i~0 8), 20552#(<= main_~i~0 9), 20553#(<= main_~i~0 10), 20554#(<= main_~i~0 11), 20555#(<= main_~i~0 12), 20556#(<= main_~i~0 13), 20557#(<= main_~i~0 14), 20558#(<= main_~i~0 15), 20559#(<= main_~i~0 16), 20560#(<= main_~i~0 17), 20561#(<= main_~i~0 18), 20562#(<= main_~i~0 19), 20563#(<= main_~i~0 20), 20564#(<= main_~i~0 21), 20565#(<= main_~i~0 22), 20566#(<= main_~i~0 23), 20567#(<= main_~i~0 24), 20568#(<= main_~i~0 25), 20569#(<= main_~i~0 26), 20570#(<= main_~i~0 27), 20571#(<= main_~i~0 28), 20572#(<= main_~i~0 29), 20573#(<= main_~i~0 30), 20574#(<= main_~i~0 31), 20575#(<= main_~i~0 32), 20576#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20577#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20578#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 20579#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 20580#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 20541#true, 20542#false, 20543#(<= main_~i~0 0)] [2018-02-02 09:53:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:28,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 09:53:28,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 09:53:28,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:53:28,981 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 40 states. [2018-02-02 09:53:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:30,214 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-02 09:53:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 09:53:30,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-02-02 09:53:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:30,216 INFO L225 Difference]: With dead ends: 509 [2018-02-02 09:53:30,216 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 09:53:30,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 09:53:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 09:53:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-02-02 09:53:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-02 09:53:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-02-02 09:53:30,220 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-02-02 09:53:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:30,220 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-02-02 09:53:30,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 09:53:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-02-02 09:53:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 09:53:30,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:30,221 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:30,221 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times [2018-02-02 09:53:30,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:30,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:30,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:30,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 09:53:30,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:30,703 INFO L182 omatonBuilderFactory]: Interpolants [21632#true, 21633#false, 21634#(<= main_~i~0 0), 21635#(<= main_~i~0 1), 21636#(<= main_~i~0 2), 21637#(<= main_~i~0 3), 21638#(<= main_~i~0 4), 21639#(<= main_~i~0 5), 21640#(<= main_~i~0 6), 21641#(<= main_~i~0 7), 21642#(<= main_~i~0 8), 21643#(<= main_~i~0 9), 21644#(<= main_~i~0 10), 21645#(<= main_~i~0 11), 21646#(<= main_~i~0 12), 21647#(<= main_~i~0 13), 21648#(<= main_~i~0 14), 21649#(<= main_~i~0 15), 21650#(<= main_~i~0 16), 21651#(<= main_~i~0 17), 21652#(<= main_~i~0 18), 21653#(<= main_~i~0 19), 21654#(<= main_~i~0 20), 21655#(<= main_~i~0 21), 21656#(<= main_~i~0 22), 21657#(<= main_~i~0 23), 21658#(<= main_~i~0 24), 21659#(<= main_~i~0 25), 21660#(<= main_~i~0 26), 21661#(<= main_~i~0 27), 21662#(<= main_~i~0 28), 21663#(<= main_~i~0 29), 21664#(<= main_~i~0 30), 21665#(<= main_~i~0 31), 21666#(<= main_~i~0 32), 21667#(<= main_~i~0 33), 21668#(<= main_~i~0 34), 21669#(<= main_~i~0 35), 21670#(<= main_~i~0 36), 21671#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 21672#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-02-02 09:53:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:30,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 09:53:30,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 09:53:30,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 09:53:30,703 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-02-02 09:53:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:31,720 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-02 09:53:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 09:53:31,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-02 09:53:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:31,722 INFO L225 Difference]: With dead ends: 522 [2018-02-02 09:53:31,722 INFO L226 Difference]: Without dead ends: 522 [2018-02-02 09:53:31,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 09:53:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-02 09:53:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-02-02 09:53:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 09:53:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-02-02 09:53:31,726 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-02-02 09:53:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:31,726 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-02-02 09:53:31,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 09:53:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-02-02 09:53:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 09:53:31,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:31,727 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:31,727 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times [2018-02-02 09:53:31,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:31,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:32,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:32,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 09:53:32,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:32,167 INFO L182 omatonBuilderFactory]: Interpolants [22784#(<= main_~i~0 31), 22785#(<= main_~i~0 32), 22786#(<= main_~i~0 33), 22787#(<= main_~i~0 34), 22788#(<= main_~i~0 35), 22789#(<= main_~i~0 36), 22790#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 22791#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 22792#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 22751#true, 22752#false, 22753#(<= main_~i~0 0), 22754#(<= main_~i~0 1), 22755#(<= main_~i~0 2), 22756#(<= main_~i~0 3), 22757#(<= main_~i~0 4), 22758#(<= main_~i~0 5), 22759#(<= main_~i~0 6), 22760#(<= main_~i~0 7), 22761#(<= main_~i~0 8), 22762#(<= main_~i~0 9), 22763#(<= main_~i~0 10), 22764#(<= main_~i~0 11), 22765#(<= main_~i~0 12), 22766#(<= main_~i~0 13), 22767#(<= main_~i~0 14), 22768#(<= main_~i~0 15), 22769#(<= main_~i~0 16), 22770#(<= main_~i~0 17), 22771#(<= main_~i~0 18), 22772#(<= main_~i~0 19), 22773#(<= main_~i~0 20), 22774#(<= main_~i~0 21), 22775#(<= main_~i~0 22), 22776#(<= main_~i~0 23), 22777#(<= main_~i~0 24), 22778#(<= main_~i~0 25), 22779#(<= main_~i~0 26), 22780#(<= main_~i~0 27), 22781#(<= main_~i~0 28), 22782#(<= main_~i~0 29), 22783#(<= main_~i~0 30)] [2018-02-02 09:53:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:32,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 09:53:32,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 09:53:32,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 09:53:32,169 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-02-02 09:53:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:33,291 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-02 09:53:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 09:53:33,291 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-02 09:53:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:33,292 INFO L225 Difference]: With dead ends: 535 [2018-02-02 09:53:33,292 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 09:53:33,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 09:53:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 09:53:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-02-02 09:53:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 09:53:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-02-02 09:53:33,297 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-02-02 09:53:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:33,297 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-02-02 09:53:33,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 09:53:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-02-02 09:53:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 09:53:33,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:33,298 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:33,298 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times [2018-02-02 09:53:33,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:33,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:33,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:33,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 09:53:33,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:33,773 INFO L182 omatonBuilderFactory]: Interpolants [23936#(<= main_~i~0 36), 23937#(<= main_~i~0 37), 23938#(<= main_~i~0 38), 23939#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 23940#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 23898#true, 23899#false, 23900#(<= main_~i~0 0), 23901#(<= main_~i~0 1), 23902#(<= main_~i~0 2), 23903#(<= main_~i~0 3), 23904#(<= main_~i~0 4), 23905#(<= main_~i~0 5), 23906#(<= main_~i~0 6), 23907#(<= main_~i~0 7), 23908#(<= main_~i~0 8), 23909#(<= main_~i~0 9), 23910#(<= main_~i~0 10), 23911#(<= main_~i~0 11), 23912#(<= main_~i~0 12), 23913#(<= main_~i~0 13), 23914#(<= main_~i~0 14), 23915#(<= main_~i~0 15), 23916#(<= main_~i~0 16), 23917#(<= main_~i~0 17), 23918#(<= main_~i~0 18), 23919#(<= main_~i~0 19), 23920#(<= main_~i~0 20), 23921#(<= main_~i~0 21), 23922#(<= main_~i~0 22), 23923#(<= main_~i~0 23), 23924#(<= main_~i~0 24), 23925#(<= main_~i~0 25), 23926#(<= main_~i~0 26), 23927#(<= main_~i~0 27), 23928#(<= main_~i~0 28), 23929#(<= main_~i~0 29), 23930#(<= main_~i~0 30), 23931#(<= main_~i~0 31), 23932#(<= main_~i~0 32), 23933#(<= main_~i~0 33), 23934#(<= main_~i~0 34), 23935#(<= main_~i~0 35)] [2018-02-02 09:53:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:33,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 09:53:33,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 09:53:33,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 09:53:33,774 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-02-02 09:53:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:34,830 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-02 09:53:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 09:53:34,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-02 09:53:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:34,832 INFO L225 Difference]: With dead ends: 548 [2018-02-02 09:53:34,832 INFO L226 Difference]: Without dead ends: 548 [2018-02-02 09:53:34,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 09:53:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-02 09:53:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-02-02 09:53:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-02 09:53:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-02-02 09:53:34,837 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-02-02 09:53:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:34,837 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-02-02 09:53:34,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 09:53:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-02-02 09:53:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 09:53:34,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:34,838 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:34,838 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times [2018-02-02 09:53:34,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:34,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:35,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:35,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 09:53:35,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:35,348 INFO L182 omatonBuilderFactory]: Interpolants [25088#(<= main_~i~0 13), 25089#(<= main_~i~0 14), 25090#(<= main_~i~0 15), 25091#(<= main_~i~0 16), 25092#(<= main_~i~0 17), 25093#(<= main_~i~0 18), 25094#(<= main_~i~0 19), 25095#(<= main_~i~0 20), 25096#(<= main_~i~0 21), 25097#(<= main_~i~0 22), 25098#(<= main_~i~0 23), 25099#(<= main_~i~0 24), 25100#(<= main_~i~0 25), 25101#(<= main_~i~0 26), 25102#(<= main_~i~0 27), 25103#(<= main_~i~0 28), 25104#(<= main_~i~0 29), 25105#(<= main_~i~0 30), 25106#(<= main_~i~0 31), 25107#(<= main_~i~0 32), 25108#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 25109#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 25110#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 25111#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 25112#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 25113#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 25114#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 25115#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 25116#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 25073#true, 25074#false, 25075#(<= main_~i~0 0), 25076#(<= main_~i~0 1), 25077#(<= main_~i~0 2), 25078#(<= main_~i~0 3), 25079#(<= main_~i~0 4), 25080#(<= main_~i~0 5), 25081#(<= main_~i~0 6), 25082#(<= main_~i~0 7), 25083#(<= main_~i~0 8), 25084#(<= main_~i~0 9), 25085#(<= main_~i~0 10), 25086#(<= main_~i~0 11), 25087#(<= main_~i~0 12)] [2018-02-02 09:53:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:35,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 09:53:35,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 09:53:35,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:53:35,348 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-02-02 09:53:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:36,986 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-02-02 09:53:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 09:53:36,987 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-02 09:53:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:36,988 INFO L225 Difference]: With dead ends: 561 [2018-02-02 09:53:36,988 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 09:53:36,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 09:53:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 09:53:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-02-02 09:53:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-02 09:53:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-02-02 09:53:36,992 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-02-02 09:53:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:36,992 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-02-02 09:53:36,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 09:53:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-02-02 09:53:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 09:53:36,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:36,993 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:36,993 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times [2018-02-02 09:53:36,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:37,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:37,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:37,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 09:53:37,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:37,496 INFO L182 omatonBuilderFactory]: Interpolants [26304#(<= main_~i~0 26), 26305#(<= main_~i~0 27), 26306#(<= main_~i~0 28), 26307#(<= main_~i~0 29), 26308#(<= main_~i~0 30), 26309#(<= main_~i~0 31), 26310#(<= main_~i~0 32), 26311#(<= main_~i~0 33), 26312#(<= main_~i~0 34), 26313#(<= main_~i~0 35), 26314#(<= main_~i~0 36), 26315#(<= main_~i~0 37), 26316#(<= main_~i~0 38), 26317#(<= main_~i~0 39), 26318#(<= main_~i~0 40), 26319#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 26320#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 26276#true, 26277#false, 26278#(<= main_~i~0 0), 26279#(<= main_~i~0 1), 26280#(<= main_~i~0 2), 26281#(<= main_~i~0 3), 26282#(<= main_~i~0 4), 26283#(<= main_~i~0 5), 26284#(<= main_~i~0 6), 26285#(<= main_~i~0 7), 26286#(<= main_~i~0 8), 26287#(<= main_~i~0 9), 26288#(<= main_~i~0 10), 26289#(<= main_~i~0 11), 26290#(<= main_~i~0 12), 26291#(<= main_~i~0 13), 26292#(<= main_~i~0 14), 26293#(<= main_~i~0 15), 26294#(<= main_~i~0 16), 26295#(<= main_~i~0 17), 26296#(<= main_~i~0 18), 26297#(<= main_~i~0 19), 26298#(<= main_~i~0 20), 26299#(<= main_~i~0 21), 26300#(<= main_~i~0 22), 26301#(<= main_~i~0 23), 26302#(<= main_~i~0 24), 26303#(<= main_~i~0 25)] [2018-02-02 09:53:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:37,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 09:53:37,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 09:53:37,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 09:53:37,497 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 45 states. [2018-02-02 09:53:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:38,647 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-02-02 09:53:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 09:53:38,647 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-02-02 09:53:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:38,648 INFO L225 Difference]: With dead ends: 574 [2018-02-02 09:53:38,648 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 09:53:38,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 09:53:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 09:53:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-02-02 09:53:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 09:53:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-02-02 09:53:38,652 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-02-02 09:53:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:38,653 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-02-02 09:53:38,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 09:53:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-02-02 09:53:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-02 09:53:38,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:38,654 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:38,654 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1629807490, now seen corresponding path program 42 times [2018-02-02 09:53:38,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:38,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:39,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:39,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 09:53:39,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:39,275 INFO L182 omatonBuilderFactory]: Interpolants [27520#(<= main_~i~0 11), 27521#(<= main_~i~0 12), 27522#(<= main_~i~0 13), 27523#(<= main_~i~0 14), 27524#(<= main_~i~0 15), 27525#(<= main_~i~0 16), 27526#(<= main_~i~0 17), 27527#(<= main_~i~0 18), 27528#(<= main_~i~0 19), 27529#(<= main_~i~0 20), 27530#(<= main_~i~0 21), 27531#(<= main_~i~0 22), 27532#(<= main_~i~0 23), 27533#(<= main_~i~0 24), 27534#(<= main_~i~0 25), 27535#(<= main_~i~0 26), 27536#(<= main_~i~0 27), 27537#(<= main_~i~0 28), 27538#(<= main_~i~0 29), 27539#(<= main_~i~0 30), 27540#(<= main_~i~0 31), 27541#(<= main_~i~0 32), 27542#(<= main_~i~0 33), 27543#(<= main_~i~0 34), 27544#(<= main_~i~0 35), 27545#(<= main_~i~0 36), 27546#(<= main_~i~0 37), 27547#(<= main_~i~0 38), 27548#(<= main_~i~0 39), 27549#(<= main_~i~0 40), 27550#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 27551#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 27552#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 27507#true, 27508#false, 27509#(<= main_~i~0 0), 27510#(<= main_~i~0 1), 27511#(<= main_~i~0 2), 27512#(<= main_~i~0 3), 27513#(<= main_~i~0 4), 27514#(<= main_~i~0 5), 27515#(<= main_~i~0 6), 27516#(<= main_~i~0 7), 27517#(<= main_~i~0 8), 27518#(<= main_~i~0 9), 27519#(<= main_~i~0 10)] [2018-02-02 09:53:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:39,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 09:53:39,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 09:53:39,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:53:39,276 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 46 states. [2018-02-02 09:53:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:40,504 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-02-02 09:53:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 09:53:40,504 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-02-02 09:53:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:40,505 INFO L225 Difference]: With dead ends: 587 [2018-02-02 09:53:40,505 INFO L226 Difference]: Without dead ends: 587 [2018-02-02 09:53:40,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-02-02 09:53:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-02 09:53:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-02-02 09:53:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-02 09:53:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-02-02 09:53:40,509 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-02-02 09:53:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:40,509 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-02-02 09:53:40,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 09:53:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-02-02 09:53:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-02 09:53:40,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:40,510 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:40,510 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 324521397, now seen corresponding path program 43 times [2018-02-02 09:53:40,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:40,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:41,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:41,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 09:53:41,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:41,125 INFO L182 omatonBuilderFactory]: Interpolants [28800#(<= main_~i~0 32), 28801#(<= main_~i~0 33), 28802#(<= main_~i~0 34), 28803#(<= main_~i~0 35), 28804#(<= main_~i~0 36), 28805#(<= main_~i~0 37), 28806#(<= main_~i~0 38), 28807#(<= main_~i~0 39), 28808#(<= main_~i~0 40), 28809#(<= main_~i~0 41), 28810#(<= main_~i~0 42), 28811#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 28812#(and (<= 1 main_~i~0) (<= main_~i~0 43)), 28766#true, 28767#false, 28768#(<= main_~i~0 0), 28769#(<= main_~i~0 1), 28770#(<= main_~i~0 2), 28771#(<= main_~i~0 3), 28772#(<= main_~i~0 4), 28773#(<= main_~i~0 5), 28774#(<= main_~i~0 6), 28775#(<= main_~i~0 7), 28776#(<= main_~i~0 8), 28777#(<= main_~i~0 9), 28778#(<= main_~i~0 10), 28779#(<= main_~i~0 11), 28780#(<= main_~i~0 12), 28781#(<= main_~i~0 13), 28782#(<= main_~i~0 14), 28783#(<= main_~i~0 15), 28784#(<= main_~i~0 16), 28785#(<= main_~i~0 17), 28786#(<= main_~i~0 18), 28787#(<= main_~i~0 19), 28788#(<= main_~i~0 20), 28789#(<= main_~i~0 21), 28790#(<= main_~i~0 22), 28791#(<= main_~i~0 23), 28792#(<= main_~i~0 24), 28793#(<= main_~i~0 25), 28794#(<= main_~i~0 26), 28795#(<= main_~i~0 27), 28796#(<= main_~i~0 28), 28797#(<= main_~i~0 29), 28798#(<= main_~i~0 30), 28799#(<= main_~i~0 31)] [2018-02-02 09:53:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:41,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 09:53:41,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 09:53:41,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 09:53:41,126 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-02-02 09:53:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:42,317 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-02-02 09:53:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 09:53:42,317 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-02 09:53:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:42,318 INFO L225 Difference]: With dead ends: 600 [2018-02-02 09:53:42,318 INFO L226 Difference]: Without dead ends: 600 [2018-02-02 09:53:42,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 09:53:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-02 09:53:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-02-02 09:53:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-02 09:53:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-02-02 09:53:42,323 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-02-02 09:53:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:42,323 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-02-02 09:53:42,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 09:53:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-02-02 09:53:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 09:53:42,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:42,324 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:42,324 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1945913054, now seen corresponding path program 44 times [2018-02-02 09:53:42,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:42,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:42,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:42,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 09:53:42,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:42,935 INFO L182 omatonBuilderFactory]: Interpolants [30080#(<= main_~i~0 25), 30081#(<= main_~i~0 26), 30082#(<= main_~i~0 27), 30083#(<= main_~i~0 28), 30084#(<= main_~i~0 29), 30085#(<= main_~i~0 30), 30086#(<= main_~i~0 31), 30087#(<= main_~i~0 32), 30088#(<= main_~i~0 33), 30089#(<= main_~i~0 34), 30090#(<= main_~i~0 35), 30091#(<= main_~i~0 36), 30092#(<= main_~i~0 37), 30093#(<= main_~i~0 38), 30094#(<= main_~i~0 39), 30095#(<= main_~i~0 40), 30096#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30097#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30098#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 30099#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 30100#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 30053#true, 30054#false, 30055#(<= main_~i~0 0), 30056#(<= main_~i~0 1), 30057#(<= main_~i~0 2), 30058#(<= main_~i~0 3), 30059#(<= main_~i~0 4), 30060#(<= main_~i~0 5), 30061#(<= main_~i~0 6), 30062#(<= main_~i~0 7), 30063#(<= main_~i~0 8), 30064#(<= main_~i~0 9), 30065#(<= main_~i~0 10), 30066#(<= main_~i~0 11), 30067#(<= main_~i~0 12), 30068#(<= main_~i~0 13), 30069#(<= main_~i~0 14), 30070#(<= main_~i~0 15), 30071#(<= main_~i~0 16), 30072#(<= main_~i~0 17), 30073#(<= main_~i~0 18), 30074#(<= main_~i~0 19), 30075#(<= main_~i~0 20), 30076#(<= main_~i~0 21), 30077#(<= main_~i~0 22), 30078#(<= main_~i~0 23), 30079#(<= main_~i~0 24)] [2018-02-02 09:53:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:42,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 09:53:42,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 09:53:42,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:53:42,936 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 48 states. [2018-02-02 09:53:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:44,457 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-02-02 09:53:44,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 09:53:44,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-02-02 09:53:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:44,458 INFO L225 Difference]: With dead ends: 613 [2018-02-02 09:53:44,458 INFO L226 Difference]: Without dead ends: 613 [2018-02-02 09:53:44,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-02-02 09:53:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-02 09:53:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-02-02 09:53:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-02-02 09:53:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-02-02 09:53:44,462 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-02-02 09:53:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:44,462 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-02-02 09:53:44,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 09:53:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-02-02 09:53:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 09:53:44,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:44,463 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:44,463 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1707991211, now seen corresponding path program 45 times [2018-02-02 09:53:44,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:44,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:45,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:45,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 09:53:45,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:45,103 INFO L182 omatonBuilderFactory]: Interpolants [31368#true, 31369#false, 31370#(<= main_~i~0 0), 31371#(<= main_~i~0 1), 31372#(<= main_~i~0 2), 31373#(<= main_~i~0 3), 31374#(<= main_~i~0 4), 31375#(<= main_~i~0 5), 31376#(<= main_~i~0 6), 31377#(<= main_~i~0 7), 31378#(<= main_~i~0 8), 31379#(<= main_~i~0 9), 31380#(<= main_~i~0 10), 31381#(<= main_~i~0 11), 31382#(<= main_~i~0 12), 31383#(<= main_~i~0 13), 31384#(<= main_~i~0 14), 31385#(<= main_~i~0 15), 31386#(<= main_~i~0 16), 31387#(<= main_~i~0 17), 31388#(<= main_~i~0 18), 31389#(<= main_~i~0 19), 31390#(<= main_~i~0 20), 31391#(<= main_~i~0 21), 31392#(<= main_~i~0 22), 31393#(<= main_~i~0 23), 31394#(<= main_~i~0 24), 31395#(<= main_~i~0 25), 31396#(<= main_~i~0 26), 31397#(<= main_~i~0 27), 31398#(<= main_~i~0 28), 31399#(<= main_~i~0 29), 31400#(<= main_~i~0 30), 31401#(<= main_~i~0 31), 31402#(<= main_~i~0 32), 31403#(<= main_~i~0 33), 31404#(<= main_~i~0 34), 31405#(<= main_~i~0 35), 31406#(<= main_~i~0 36), 31407#(<= main_~i~0 37), 31408#(<= main_~i~0 38), 31409#(<= main_~i~0 39), 31410#(<= main_~i~0 40), 31411#(<= main_~i~0 41), 31412#(<= main_~i~0 42), 31413#(<= main_~i~0 43), 31414#(<= main_~i~0 44), 31415#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 31416#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-02-02 09:53:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:45,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 09:53:45,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 09:53:45,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 09:53:45,104 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-02-02 09:53:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:46,505 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-02-02 09:53:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 09:53:46,506 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-02 09:53:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:46,507 INFO L225 Difference]: With dead ends: 626 [2018-02-02 09:53:46,507 INFO L226 Difference]: Without dead ends: 626 [2018-02-02 09:53:46,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 09:53:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-02 09:53:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-02-02 09:53:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 09:53:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-02-02 09:53:46,512 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-02-02 09:53:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:46,512 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-02-02 09:53:46,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 09:53:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-02-02 09:53:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 09:53:46,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:46,513 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:46,513 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1861482814, now seen corresponding path program 46 times [2018-02-02 09:53:46,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:46,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:47,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:47,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 09:53:47,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:47,112 INFO L182 omatonBuilderFactory]: Interpolants [32711#true, 32712#false, 32713#(<= main_~i~0 0), 32714#(<= main_~i~0 1), 32715#(<= main_~i~0 2), 32716#(<= main_~i~0 3), 32717#(<= main_~i~0 4), 32718#(<= main_~i~0 5), 32719#(<= main_~i~0 6), 32720#(<= main_~i~0 7), 32721#(<= main_~i~0 8), 32722#(<= main_~i~0 9), 32723#(<= main_~i~0 10), 32724#(<= main_~i~0 11), 32725#(<= main_~i~0 12), 32726#(<= main_~i~0 13), 32727#(<= main_~i~0 14), 32728#(<= main_~i~0 15), 32729#(<= main_~i~0 16), 32730#(<= main_~i~0 17), 32731#(<= main_~i~0 18), 32732#(<= main_~i~0 19), 32733#(<= main_~i~0 20), 32734#(<= main_~i~0 21), 32735#(<= main_~i~0 22), 32736#(<= main_~i~0 23), 32737#(<= main_~i~0 24), 32738#(<= main_~i~0 25), 32739#(<= main_~i~0 26), 32740#(<= main_~i~0 27), 32741#(<= main_~i~0 28), 32742#(<= main_~i~0 29), 32743#(<= main_~i~0 30), 32744#(<= main_~i~0 31), 32745#(<= main_~i~0 32), 32746#(<= main_~i~0 33), 32747#(<= main_~i~0 34), 32748#(<= main_~i~0 35), 32749#(<= main_~i~0 36), 32750#(<= main_~i~0 37), 32751#(<= main_~i~0 38), 32752#(<= main_~i~0 39), 32753#(<= main_~i~0 40), 32754#(<= main_~i~0 41), 32755#(<= main_~i~0 42), 32756#(<= main_~i~0 43), 32757#(<= main_~i~0 44), 32758#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 32759#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 32760#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-02-02 09:53:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:47,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 09:53:47,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 09:53:47,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 09:53:47,113 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-02-02 09:53:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:48,676 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-02-02 09:53:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 09:53:48,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-02 09:53:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:48,677 INFO L225 Difference]: With dead ends: 639 [2018-02-02 09:53:48,677 INFO L226 Difference]: Without dead ends: 639 [2018-02-02 09:53:48,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-02 09:53:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-02 09:53:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-02-02 09:53:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-02 09:53:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-02-02 09:53:48,681 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-02-02 09:53:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:48,681 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-02-02 09:53:48,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 09:53:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-02-02 09:53:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-02 09:53:48,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:48,682 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:48,682 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1141565685, now seen corresponding path program 47 times [2018-02-02 09:53:48,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:48,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:49,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:49,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 09:53:49,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:49,314 INFO L182 omatonBuilderFactory]: Interpolants [34082#true, 34083#false, 34084#(<= main_~i~0 0), 34085#(<= main_~i~0 1), 34086#(<= main_~i~0 2), 34087#(<= main_~i~0 3), 34088#(<= main_~i~0 4), 34089#(<= main_~i~0 5), 34090#(<= main_~i~0 6), 34091#(<= main_~i~0 7), 34092#(<= main_~i~0 8), 34093#(<= main_~i~0 9), 34094#(<= main_~i~0 10), 34095#(<= main_~i~0 11), 34096#(<= main_~i~0 12), 34097#(<= main_~i~0 13), 34098#(<= main_~i~0 14), 34099#(<= main_~i~0 15), 34100#(<= main_~i~0 16), 34101#(<= main_~i~0 17), 34102#(<= main_~i~0 18), 34103#(<= main_~i~0 19), 34104#(<= main_~i~0 20), 34105#(<= main_~i~0 21), 34106#(<= main_~i~0 22), 34107#(<= main_~i~0 23), 34108#(<= main_~i~0 24), 34109#(<= main_~i~0 25), 34110#(<= main_~i~0 26), 34111#(<= main_~i~0 27), 34112#(<= main_~i~0 28), 34113#(<= main_~i~0 29), 34114#(<= main_~i~0 30), 34115#(<= main_~i~0 31), 34116#(<= main_~i~0 32), 34117#(<= main_~i~0 33), 34118#(<= main_~i~0 34), 34119#(<= main_~i~0 35), 34120#(<= main_~i~0 36), 34121#(<= main_~i~0 37), 34122#(<= main_~i~0 38), 34123#(<= main_~i~0 39), 34124#(<= main_~i~0 40), 34125#(<= main_~i~0 41), 34126#(<= main_~i~0 42), 34127#(<= main_~i~0 43), 34128#(<= main_~i~0 44), 34129#(<= main_~i~0 45), 34130#(<= main_~i~0 46), 34131#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 34132#(and (<= 1 main_~i~0) (<= main_~i~0 47))] [2018-02-02 09:53:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:49,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 09:53:49,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 09:53:49,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 09:53:49,315 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 51 states. [2018-02-02 09:53:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:53:50,807 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-02-02 09:53:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 09:53:50,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-02-02 09:53:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:53:50,808 INFO L225 Difference]: With dead ends: 652 [2018-02-02 09:53:50,809 INFO L226 Difference]: Without dead ends: 652 [2018-02-02 09:53:50,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-02-02 09:53:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-02-02 09:53:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-02-02 09:53:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-02-02 09:53:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-02-02 09:53:50,813 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-02-02 09:53:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:53:50,813 INFO L432 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-02-02 09:53:50,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 09:53:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-02-02 09:53:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-02 09:53:50,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:53:50,814 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-02 09:53:50,814 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 09:53:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash 993538974, now seen corresponding path program 48 times [2018-02-02 09:53:50,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:53:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:53:50,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:53:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:51,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:53:51,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 09:53:51,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:53:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:51,547 INFO L182 omatonBuilderFactory]: Interpolants [35481#true, 35482#false, 35483#(<= main_~i~0 0), 35484#(<= main_~i~0 1), 35485#(<= main_~i~0 2), 35486#(<= main_~i~0 3), 35487#(<= main_~i~0 4), 35488#(<= main_~i~0 5), 35489#(<= main_~i~0 6), 35490#(<= main_~i~0 7), 35491#(<= main_~i~0 8), 35492#(<= main_~i~0 9), 35493#(<= main_~i~0 10), 35494#(<= main_~i~0 11), 35495#(<= main_~i~0 12), 35496#(<= main_~i~0 13), 35497#(<= main_~i~0 14), 35498#(<= main_~i~0 15), 35499#(<= main_~i~0 16), 35500#(<= main_~i~0 17), 35501#(<= main_~i~0 18), 35502#(<= main_~i~0 19), 35503#(<= main_~i~0 20), 35504#(<= main_~i~0 21), 35505#(<= main_~i~0 22), 35506#(<= main_~i~0 23), 35507#(<= main_~i~0 24), 35508#(<= main_~i~0 25), 35509#(<= main_~i~0 26), 35510#(<= main_~i~0 27), 35511#(<= main_~i~0 28), 35512#(<= main_~i~0 29), 35513#(<= main_~i~0 30), 35514#(<= main_~i~0 31), 35515#(<= main_~i~0 32), 35516#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 35517#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 35518#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 35519#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 35520#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 35521#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 35522#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 35523#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 35524#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 35525#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 35526#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 35527#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 35528#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 35529#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 35530#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 35531#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 35532#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-02-02 09:53:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:53:51,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 09:53:51,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 09:53:51,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:53:51,548 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 52 states. Received shutdown request... [2018-02-02 09:53:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 09:53:53,969 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:53:53,972 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:53:53,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:53:53 BoogieIcfgContainer [2018-02-02 09:53:53,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:53:53,973 INFO L168 Benchmark]: Toolchain (without parser) took 55139.14 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 357.1 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 124.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:53:53,974 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:53:53,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.76 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:53:53,974 INFO L168 Benchmark]: Boogie Preprocessor took 19.01 ms. Allocated memory is still 399.0 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:53:53,974 INFO L168 Benchmark]: RCFGBuilder took 119.69 ms. Allocated memory is still 399.0 MB. Free memory was 347.7 MB in the beginning and 335.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:53:53,975 INFO L168 Benchmark]: TraceAbstraction took 54864.97 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 335.0 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 102.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:53:53,976 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 132.76 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.01 ms. Allocated memory is still 399.0 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 119.69 ms. Allocated memory is still 399.0 MB. Free memory was 347.7 MB in the beginning and 335.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54864.97 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 335.0 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 102.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 51 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (401 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 54.8s OverallTime, 49 OverallIterations, 49 TraceHistogramMax, 39.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2751 SDtfs, 34842 SDslu, 18636 SDs, 0 SdLazy, 57025 SolverSat, 13080 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2429 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21397 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/94472 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 1272 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 6223 NumberOfCodeBlocks, 6223 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6174 ConstructedInterpolants, 0 QuantifiedInterpolants, 3476636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 0/94472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-53-53-981.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-53-53-981.csv Completed graceful shutdown