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/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:34:36,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:34:36,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:34:36,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:34:36,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:34:36,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:34:36,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:34:36,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:34:36,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:34:36,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:34:36,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:34:36,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:34:36,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:34:36,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:34:36,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:34:36,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:34:36,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:34:36,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:34:36,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:34:36,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:34:36,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:34:36,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:34:36,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:34:36,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:34:36,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:34:36,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:34:36,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:34:36,416 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:34:36,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:34:36,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:34:36,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:34:36,417 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 10:34:36,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:34:36,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:34:36,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:34:36,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:34:36,428 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:34:36,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:34:36,429 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:34:36,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:34:36,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:34:36,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:34:36,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:34:36,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:34:36,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:34:36,469 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:34:36,472 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:34:36,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:34:36,474 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:34:36,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-02-02 10:34:36,555 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:34:36,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:34:36,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:34:36,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:34:36,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:34:36,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e86f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36, skipping insertion in model container [2018-02-02 10:34:36,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,574 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:34:36,585 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:34:36,669 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:34:36,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:34:36,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36 WrapperNode [2018-02-02 10:34:36,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:34:36,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:34:36,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:34:36,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:34:36,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... [2018-02-02 10:34:36,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:34:36,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:34:36,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:34:36,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:34:36,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:34:36,738 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:34:36,738 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:34:36,738 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 10:34:36,738 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:34:36,739 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:34:36,830 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:34:36,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:34:36 BoogieIcfgContainer [2018-02-02 10:34:36,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:34:36,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:34:36,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:34:36,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:34:36,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:34:36" (1/3) ... [2018-02-02 10:34:36,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10240965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:34:36, skipping insertion in model container [2018-02-02 10:34:36,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:36" (2/3) ... [2018-02-02 10:34:36,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10240965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:34:36, skipping insertion in model container [2018-02-02 10:34:36,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:34:36" (3/3) ... [2018-02-02 10:34:36,835 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-02-02 10:34:36,844 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:34:36,850 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-02-02 10:34:36,877 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:34:36,878 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:34:36,878 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:34:36,878 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:34:36,878 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:34:36,878 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:34:36,878 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:34:36,879 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:34:36,879 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:34:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-02 10:34:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:34:36,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:36,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:36,902 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1213833872, now seen corresponding path program 1 times [2018-02-02 10:34:36,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:36,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:37,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:34:37,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,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 10:34:37,028 INFO L182 omatonBuilderFactory]: Interpolants [32#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 33#(and (<= main_~i~0 1023) (<= 0 main_~i~0)), 30#true, 31#false] [2018-02-02 10:34:37,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 10:34:37,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:34:37,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:34:37,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:34:37,044 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-02-02 10:34:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,126 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 10:34:37,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:34:37,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:34:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,133 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:34:37,133 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:34:37,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:34:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:34:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 10:34:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:34:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 10:34:37,197 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-02-02 10:34:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,198 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 10:34:37,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:34:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 10:34:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:34:37,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,199 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,199 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -863334142, now seen corresponding path program 1 times [2018-02-02 10:34:37,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:34:37,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:37,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:34:37,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,269 INFO L182 omatonBuilderFactory]: Interpolants [112#(<= 1 main_~i~0), 113#(and (<= main_~i~0 1023) (<= 1 main_~i~0)), 109#true, 110#false, 111#(<= 0 main_~i~0)] [2018-02-02 10:34:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:34:37,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:37,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:37,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:37,271 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-02-02 10:34:37,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,314 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 10:34:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:37,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 10:34:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,315 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:34:37,315 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:34:37,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:34:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-02-02 10:34:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:34:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-02 10:34:37,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-02-02 10:34:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,320 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-02 10:34:37,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-02 10:34:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:34:37,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,321 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,322 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1135364244, now seen corresponding path program 1 times [2018-02-02 10:34:37,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:37,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:34:37,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,373 INFO L182 omatonBuilderFactory]: Interpolants [176#(<= main_~i~0 1), 177#(<= main_~i~0 2), 173#true, 174#false, 175#(<= main_~i~0 0)] [2018-02-02 10:34:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:37,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:37,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:37,375 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-02-02 10:34:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,427 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-02 10:34:37,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:37,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 10:34:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,428 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:34:37,428 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:34:37,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:34:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-02-02 10:34:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:34:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-02-02 10:34:37,433 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-02-02 10:34:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,433 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-02-02 10:34:37,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-02-02 10:34:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:34:37,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,434 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,434 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1230203493, now seen corresponding path program 2 times [2018-02-02 10:34:37,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:37,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:34:37,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,493 INFO L182 omatonBuilderFactory]: Interpolants [256#false, 257#(<= main_~i~0 0), 258#(<= main_~i~0 1), 259#(<= main_~i~0 2), 260#(<= main_~i~0 3), 255#true] [2018-02-02 10:34:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:34:37,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:34:37,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:34:37,494 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-02-02 10:34:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,550 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-02 10:34:37,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:34:37,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 10:34:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,553 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:34:37,553 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:34:37,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:34:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:34:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-02-02 10:34:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:34:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-02 10:34:37,557 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-02-02 10:34:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,558 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-02 10:34:37,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:34:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-02 10:34:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:34:37,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,559 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,559 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 417265886, now seen corresponding path program 3 times [2018-02-02 10:34:37,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:37,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:34:37,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,619 INFO L182 omatonBuilderFactory]: Interpolants [352#false, 353#(<= main_~i~0 0), 354#(<= main_~i~0 1), 355#(<= main_~i~0 2), 356#(<= main_~i~0 3), 357#(<= main_~i~0 4), 351#true] [2018-02-02 10:34:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:34:37,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:34:37,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:37,620 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 7 states. [2018-02-02 10:34:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,688 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-02-02 10:34:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:34:37,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 10:34:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,689 INFO L225 Difference]: With dead ends: 62 [2018-02-02 10:34:37,689 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 10:34:37,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 10:34:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-02-02 10:34:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:34:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-02 10:34:37,694 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-02-02 10:34:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,694 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-02 10:34:37,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:34:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-02 10:34:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:34:37,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,695 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,695 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 43819735, now seen corresponding path program 4 times [2018-02-02 10:34:37,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:37,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:34:37,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,772 INFO L182 omatonBuilderFactory]: Interpolants [464#(<= main_~i~0 1), 465#(<= main_~i~0 2), 466#(<= main_~i~0 3), 467#(<= main_~i~0 4), 468#(<= main_~i~0 5), 461#true, 462#false, 463#(<= main_~i~0 0)] [2018-02-02 10:34:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:34:37,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:34:37,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:34:37,773 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 8 states. [2018-02-02 10:34:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:37,850 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-02 10:34:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:34:37,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 10:34:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:37,853 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:34:37,853 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:34:37,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:34:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:34:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-02-02 10:34:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 10:34:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-02 10:34:37,858 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-02-02 10:34:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:37,858 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-02 10:34:37,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:34:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-02 10:34:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:34:37,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:37,859 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:37,859 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 554870864, now seen corresponding path program 5 times [2018-02-02 10:34:37,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:37,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:37,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:34:37,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:37,942 INFO L182 omatonBuilderFactory]: Interpolants [592#(<= main_~i~0 5), 593#(<= main_~i~0 6), 585#true, 586#false, 587#(<= main_~i~0 0), 588#(<= main_~i~0 1), 589#(<= main_~i~0 2), 590#(<= main_~i~0 3), 591#(<= main_~i~0 4)] [2018-02-02 10:34:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:37,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:34:37,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:34:37,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:37,943 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2018-02-02 10:34:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,048 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-02-02 10:34:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:34:38,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-02-02 10:34:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,054 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:34:38,054 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:34:38,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:34:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2018-02-02 10:34:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:34:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 10:34:38,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-02-02 10:34:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,058 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 10:34:38,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:34:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 10:34:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:34:38,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,059 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,059 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1638353225, now seen corresponding path program 6 times [2018-02-02 10:34:38,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:38,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:34:38,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:38,144 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#(<= main_~i~0 5), 731#(<= main_~i~0 6), 732#(<= main_~i~0 7)] [2018-02-02 10:34:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:34:38,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:34:38,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:34:38,146 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2018-02-02 10:34:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,235 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-02-02 10:34:38,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:34:38,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-02-02 10:34:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,236 INFO L225 Difference]: With dead ends: 89 [2018-02-02 10:34:38,236 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 10:34:38,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:34:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 10:34:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2018-02-02 10:34:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:34:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 10:34:38,239 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2018-02-02 10:34:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,240 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 10:34:38,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:34:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 10:34:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:34:38,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,241 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,241 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,241 INFO L82 PathProgramCache]: Analyzing trace with hash 346080706, now seen corresponding path program 7 times [2018-02-02 10:34:38,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:38,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:34:38,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:38,311 INFO L182 omatonBuilderFactory]: Interpolants [880#(<= main_~i~0 3), 881#(<= main_~i~0 4), 882#(<= main_~i~0 5), 883#(<= main_~i~0 6), 884#(<= main_~i~0 7), 885#(<= main_~i~0 8), 875#true, 876#false, 877#(<= main_~i~0 0), 878#(<= main_~i~0 1), 879#(<= main_~i~0 2)] [2018-02-02 10:34:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:34:38,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:34:38,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:34:38,313 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2018-02-02 10:34:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,394 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-02 10:34:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:34:38,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-02-02 10:34:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,396 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:34:38,396 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:34:38,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:34:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:34:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 57. [2018-02-02 10:34:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:34:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-02 10:34:38,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-02-02 10:34:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,401 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-02 10:34:38,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:34:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-02 10:34:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:34:38,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,402 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,402 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2099600827, now seen corresponding path program 8 times [2018-02-02 10:34:38,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:38,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:34:38,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:38,497 INFO L182 omatonBuilderFactory]: Interpolants [1041#true, 1042#false, 1043#(<= main_~i~0 0), 1044#(<= main_~i~0 1), 1045#(<= main_~i~0 2), 1046#(<= main_~i~0 3), 1047#(<= main_~i~0 4), 1048#(<= main_~i~0 5), 1049#(<= main_~i~0 6), 1050#(<= main_~i~0 7), 1051#(<= main_~i~0 8), 1052#(<= main_~i~0 9)] [2018-02-02 10:34:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:34:38,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:34:38,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:34:38,498 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2018-02-02 10:34:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,574 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-02 10:34:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:34:38,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-02-02 10:34:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,575 INFO L225 Difference]: With dead ends: 107 [2018-02-02 10:34:38,576 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 10:34:38,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:34:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 10:34:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 61. [2018-02-02 10:34:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:34:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-02-02 10:34:38,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2018-02-02 10:34:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,580 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-02-02 10:34:38,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:34:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-02-02 10:34:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:34:38,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,581 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,581 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1631277364, now seen corresponding path program 9 times [2018-02-02 10:34:38,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:38,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:34:38,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:38,676 INFO L182 omatonBuilderFactory]: Interpolants [1221#true, 1222#false, 1223#(<= main_~i~0 0), 1224#(<= main_~i~0 1), 1225#(<= main_~i~0 2), 1226#(<= main_~i~0 3), 1227#(<= main_~i~0 4), 1228#(<= main_~i~0 5), 1229#(<= main_~i~0 6), 1230#(<= main_~i~0 7), 1231#(<= main_~i~0 8), 1232#(<= main_~i~0 9), 1233#(<= main_~i~0 10)] [2018-02-02 10:34:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:34:38,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:34:38,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:34:38,677 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 13 states. [2018-02-02 10:34:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,770 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-02-02 10:34:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:34:38,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 10:34:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,771 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:34:38,771 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:34:38,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:34:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:34:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 65. [2018-02-02 10:34:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 10:34:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-02-02 10:34:38,775 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-02-02 10:34:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,776 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-02-02 10:34:38,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:34:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-02-02 10:34:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:34:38,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,777 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,777 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1714888659, now seen corresponding path program 10 times [2018-02-02 10:34:38,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:38,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:34:38,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:38,865 INFO L182 omatonBuilderFactory]: Interpolants [1415#true, 1416#false, 1417#(<= main_~i~0 0), 1418#(<= main_~i~0 1), 1419#(<= main_~i~0 2), 1420#(<= main_~i~0 3), 1421#(<= main_~i~0 4), 1422#(<= main_~i~0 5), 1423#(<= main_~i~0 6), 1424#(<= main_~i~0 7), 1425#(<= main_~i~0 8), 1426#(<= main_~i~0 9), 1427#(<= main_~i~0 10), 1428#(<= main_~i~0 11)] [2018-02-02 10:34:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:38,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:34:38,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:34:38,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:38,865 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2018-02-02 10:34:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:38,944 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-02-02 10:34:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:34:38,945 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-02-02 10:34:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:38,945 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:34:38,945 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:34:38,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:34:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2018-02-02 10:34:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 10:34:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-02-02 10:34:38,949 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-02-02 10:34:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:38,949 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-02-02 10:34:38,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:34:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-02-02 10:34:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:34:38,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:38,950 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:38,950 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1567339866, now seen corresponding path program 11 times [2018-02-02 10:34:38,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:38,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:39,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:34:39,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:39,050 INFO L182 omatonBuilderFactory]: Interpolants [1632#(<= main_~i~0 7), 1633#(<= main_~i~0 8), 1634#(<= main_~i~0 9), 1635#(<= main_~i~0 10), 1636#(<= main_~i~0 11), 1637#(<= main_~i~0 12), 1623#true, 1624#false, 1625#(<= main_~i~0 0), 1626#(<= main_~i~0 1), 1627#(<= main_~i~0 2), 1628#(<= main_~i~0 3), 1629#(<= main_~i~0 4), 1630#(<= main_~i~0 5), 1631#(<= main_~i~0 6)] [2018-02-02 10:34:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:34:39,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:34:39,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:34:39,051 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 15 states. [2018-02-02 10:34:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:39,128 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-02-02 10:34:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:34:39,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-02-02 10:34:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:39,129 INFO L225 Difference]: With dead ends: 134 [2018-02-02 10:34:39,129 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:34:39,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:34:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:34:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 73. [2018-02-02 10:34:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:34:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-02-02 10:34:39,131 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-02-02 10:34:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:39,132 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-02-02 10:34:39,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:34:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-02-02 10:34:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:34:39,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:39,132 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:39,132 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 709087391, now seen corresponding path program 12 times [2018-02-02 10:34:39,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:39,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:39,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:34:39,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:39,280 INFO L182 omatonBuilderFactory]: Interpolants [1856#(<= main_~i~0 9), 1857#(<= main_~i~0 10), 1858#(<= main_~i~0 11), 1859#(<= main_~i~0 12), 1860#(<= main_~i~0 13), 1845#true, 1846#false, 1847#(<= main_~i~0 0), 1848#(<= main_~i~0 1), 1849#(<= main_~i~0 2), 1850#(<= main_~i~0 3), 1851#(<= main_~i~0 4), 1852#(<= main_~i~0 5), 1853#(<= main_~i~0 6), 1854#(<= main_~i~0 7), 1855#(<= main_~i~0 8)] [2018-02-02 10:34:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:34:39,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:34:39,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:34:39,281 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2018-02-02 10:34:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:39,367 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-02-02 10:34:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:34:39,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 10:34:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:39,368 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:34:39,368 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:34:39,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:34:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:34:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 77. [2018-02-02 10:34:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:34:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-02-02 10:34:39,372 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 72 [2018-02-02 10:34:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:39,372 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-02-02 10:34:39,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:34:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-02-02 10:34:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:34:39,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:39,373 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:39,373 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1570917864, now seen corresponding path program 13 times [2018-02-02 10:34:39,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:39,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:39,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:34:39,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:39,576 INFO L182 omatonBuilderFactory]: Interpolants [2081#true, 2082#false, 2083#(<= main_~i~0 0), 2084#(<= main_~i~0 1), 2085#(<= main_~i~0 2), 2086#(<= main_~i~0 3), 2087#(<= main_~i~0 4), 2088#(<= main_~i~0 5), 2089#(<= main_~i~0 6), 2090#(<= main_~i~0 7), 2091#(<= main_~i~0 8), 2092#(<= main_~i~0 9), 2093#(<= main_~i~0 10), 2094#(<= main_~i~0 11), 2095#(<= main_~i~0 12), 2096#(<= main_~i~0 13), 2097#(<= main_~i~0 14)] [2018-02-02 10:34:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:34:39,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:34:39,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:34:39,577 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 17 states. [2018-02-02 10:34:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:39,715 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-02-02 10:34:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:34:39,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-02-02 10:34:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:39,716 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:34:39,716 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:34:39,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:34:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:34:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 81. [2018-02-02 10:34:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:34:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-02-02 10:34:39,719 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-02-02 10:34:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:39,720 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-02-02 10:34:39,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:34:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-02-02 10:34:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:34:39,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:39,721 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:39,721 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash -817352943, now seen corresponding path program 14 times [2018-02-02 10:34:39,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:39,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:39,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:34:39,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:39,843 INFO L182 omatonBuilderFactory]: Interpolants [2336#(<= main_~i~0 3), 2337#(<= main_~i~0 4), 2338#(<= main_~i~0 5), 2339#(<= main_~i~0 6), 2340#(<= main_~i~0 7), 2341#(<= main_~i~0 8), 2342#(<= main_~i~0 9), 2343#(<= main_~i~0 10), 2344#(<= main_~i~0 11), 2345#(<= main_~i~0 12), 2346#(<= main_~i~0 13), 2347#(<= main_~i~0 14), 2348#(<= main_~i~0 15), 2331#true, 2332#false, 2333#(<= main_~i~0 0), 2334#(<= main_~i~0 1), 2335#(<= main_~i~0 2)] [2018-02-02 10:34:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:39,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:34:39,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:34:39,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:34:39,844 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-02-02 10:34:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:39,939 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-02-02 10:34:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:34:39,939 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-02-02 10:34:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:39,940 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:34:39,940 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:34:39,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:34:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:34:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 85. [2018-02-02 10:34:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:34:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-02 10:34:39,943 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2018-02-02 10:34:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:39,943 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-02 10:34:39,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:34:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-02 10:34:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:34:39,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:39,944 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:39,944 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1481213834, now seen corresponding path program 15 times [2018-02-02 10:34:39,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:39,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:40,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:34:40,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:40,098 INFO L182 omatonBuilderFactory]: Interpolants [2595#true, 2596#false, 2597#(<= main_~i~0 0), 2598#(<= main_~i~0 1), 2599#(<= main_~i~0 2), 2600#(<= main_~i~0 3), 2601#(<= main_~i~0 4), 2602#(<= main_~i~0 5), 2603#(<= main_~i~0 6), 2604#(<= main_~i~0 7), 2605#(<= main_~i~0 8), 2606#(<= main_~i~0 9), 2607#(<= main_~i~0 10), 2608#(<= main_~i~0 11), 2609#(<= main_~i~0 12), 2610#(<= main_~i~0 13), 2611#(<= main_~i~0 14), 2612#(<= main_~i~0 15), 2613#(<= main_~i~0 16)] [2018-02-02 10:34:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:34:40,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:34:40,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:34:40,098 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 19 states. [2018-02-02 10:34:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:40,197 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-02 10:34:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:34:40,197 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-02-02 10:34:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:40,198 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:34:40,198 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:34:40,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:34:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:34:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 89. [2018-02-02 10:34:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:34:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-02-02 10:34:40,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-02-02 10:34:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:40,200 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-02-02 10:34:40,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:34:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-02-02 10:34:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:34:40,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:40,201 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:40,201 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1468529539, now seen corresponding path program 16 times [2018-02-02 10:34:40,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:40,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:40,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:34:40,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:40,371 INFO L182 omatonBuilderFactory]: Interpolants [2880#(<= main_~i~0 5), 2881#(<= main_~i~0 6), 2882#(<= main_~i~0 7), 2883#(<= main_~i~0 8), 2884#(<= main_~i~0 9), 2885#(<= main_~i~0 10), 2886#(<= main_~i~0 11), 2887#(<= main_~i~0 12), 2888#(<= main_~i~0 13), 2889#(<= main_~i~0 14), 2890#(<= main_~i~0 15), 2891#(<= main_~i~0 16), 2892#(<= main_~i~0 17), 2873#true, 2874#false, 2875#(<= main_~i~0 0), 2876#(<= main_~i~0 1), 2877#(<= main_~i~0 2), 2878#(<= main_~i~0 3), 2879#(<= main_~i~0 4)] [2018-02-02 10:34:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:34:40,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:34:40,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:34:40,372 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 20 states. [2018-02-02 10:34:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:40,476 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2018-02-02 10:34:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:34:40,476 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-02-02 10:34:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:40,477 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:34:40,477 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:34:40,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:34:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:34:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 93. [2018-02-02 10:34:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:34:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-02-02 10:34:40,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 88 [2018-02-02 10:34:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:40,479 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-02-02 10:34:40,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:34:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-02-02 10:34:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:34:40,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:40,479 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:40,479 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:40,480 INFO L82 PathProgramCache]: Analyzing trace with hash -368456964, now seen corresponding path program 17 times [2018-02-02 10:34:40,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:40,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:40,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:34:40,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:40,610 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= main_~i~0 1), 3169#(<= main_~i~0 2), 3170#(<= main_~i~0 3), 3171#(<= main_~i~0 4), 3172#(<= main_~i~0 5), 3173#(<= main_~i~0 6), 3174#(<= main_~i~0 7), 3175#(<= main_~i~0 8), 3176#(<= main_~i~0 9), 3177#(<= main_~i~0 10), 3178#(<= main_~i~0 11), 3179#(<= main_~i~0 12), 3180#(<= main_~i~0 13), 3181#(<= main_~i~0 14), 3182#(<= main_~i~0 15), 3183#(<= main_~i~0 16), 3184#(<= main_~i~0 17), 3185#(<= main_~i~0 18), 3165#true, 3166#false, 3167#(<= main_~i~0 0)] [2018-02-02 10:34:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:34:40,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:34:40,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:34:40,611 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-02-02 10:34:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:40,715 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-02-02 10:34:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:34:40,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-02-02 10:34:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:40,716 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:34:40,716 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 10:34:40,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:34:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 10:34:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 97. [2018-02-02 10:34:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:34:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-02-02 10:34:40,718 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-02-02 10:34:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:40,718 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-02-02 10:34:40,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:34:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-02-02 10:34:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:34:40,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:40,719 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:40,719 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1078643211, now seen corresponding path program 18 times [2018-02-02 10:34:40,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:40,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:40,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:34:40,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:40,923 INFO L182 omatonBuilderFactory]: Interpolants [3488#(<= main_~i~0 15), 3489#(<= main_~i~0 16), 3490#(<= main_~i~0 17), 3491#(<= main_~i~0 18), 3492#(<= main_~i~0 19), 3471#true, 3472#false, 3473#(<= main_~i~0 0), 3474#(<= main_~i~0 1), 3475#(<= main_~i~0 2), 3476#(<= main_~i~0 3), 3477#(<= main_~i~0 4), 3478#(<= main_~i~0 5), 3479#(<= main_~i~0 6), 3480#(<= main_~i~0 7), 3481#(<= main_~i~0 8), 3482#(<= main_~i~0 9), 3483#(<= main_~i~0 10), 3484#(<= main_~i~0 11), 3485#(<= main_~i~0 12), 3486#(<= main_~i~0 13), 3487#(<= main_~i~0 14)] [2018-02-02 10:34:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:40,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:34:40,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:34:40,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:34:40,923 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 22 states. [2018-02-02 10:34:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:41,060 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2018-02-02 10:34:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:34:41,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-02-02 10:34:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:41,061 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:34:41,061 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:34:41,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:34:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:34:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 101. [2018-02-02 10:34:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:34:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-02-02 10:34:41,063 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 96 [2018-02-02 10:34:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:41,064 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-02-02 10:34:41,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:34:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-02-02 10:34:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:34:41,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:41,065 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:41,065 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1420788626, now seen corresponding path program 19 times [2018-02-02 10:34:41,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:41,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:41,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:34:41,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:41,272 INFO L182 omatonBuilderFactory]: Interpolants [3808#(<= main_~i~0 15), 3809#(<= main_~i~0 16), 3810#(<= main_~i~0 17), 3811#(<= main_~i~0 18), 3812#(<= main_~i~0 19), 3813#(<= main_~i~0 20), 3791#true, 3792#false, 3793#(<= main_~i~0 0), 3794#(<= main_~i~0 1), 3795#(<= main_~i~0 2), 3796#(<= main_~i~0 3), 3797#(<= main_~i~0 4), 3798#(<= main_~i~0 5), 3799#(<= main_~i~0 6), 3800#(<= main_~i~0 7), 3801#(<= main_~i~0 8), 3802#(<= main_~i~0 9), 3803#(<= main_~i~0 10), 3804#(<= main_~i~0 11), 3805#(<= main_~i~0 12), 3806#(<= main_~i~0 13), 3807#(<= main_~i~0 14)] [2018-02-02 10:34:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:34:41,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:34:41,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:34:41,273 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 23 states. [2018-02-02 10:34:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:41,408 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2018-02-02 10:34:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:34:41,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-02-02 10:34:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:41,409 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:34:41,409 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:34:41,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:34:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:34:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 105. [2018-02-02 10:34:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:34:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-02-02 10:34:41,411 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-02-02 10:34:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:41,411 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-02-02 10:34:41,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:34:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-02-02 10:34:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 10:34:41,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:41,412 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:41,412 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash 847371879, now seen corresponding path program 20 times [2018-02-02 10:34:41,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:41,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:41,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:34:41,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:41,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 10:34:41,624 INFO L182 omatonBuilderFactory]: Interpolants [4128#(<= main_~i~0 1), 4129#(<= main_~i~0 2), 4130#(<= main_~i~0 3), 4131#(<= main_~i~0 4), 4132#(<= main_~i~0 5), 4133#(<= main_~i~0 6), 4134#(<= main_~i~0 7), 4135#(<= main_~i~0 8), 4136#(<= main_~i~0 9), 4137#(<= main_~i~0 10), 4138#(<= main_~i~0 11), 4139#(<= main_~i~0 12), 4140#(<= main_~i~0 13), 4141#(<= main_~i~0 14), 4142#(<= main_~i~0 15), 4143#(<= main_~i~0 16), 4144#(<= main_~i~0 17), 4145#(<= main_~i~0 18), 4146#(<= main_~i~0 19), 4147#(<= main_~i~0 20), 4148#(<= main_~i~0 21), 4125#true, 4126#false, 4127#(<= main_~i~0 0)] [2018-02-02 10:34:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:34:41,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:34:41,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:34:41,625 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 24 states. [2018-02-02 10:34:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:41,741 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-02-02 10:34:41,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:34:41,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 104 [2018-02-02 10:34:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:41,742 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:34:41,742 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:34:41,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:34:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:34:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 109. [2018-02-02 10:34:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:34:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-02-02 10:34:41,746 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-02-02 10:34:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:41,746 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-02-02 10:34:41,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:34:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-02-02 10:34:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 10:34:41,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:41,747 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:41,747 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 500145120, now seen corresponding path program 21 times [2018-02-02 10:34:41,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:41,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:41,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:34:41,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:41,973 INFO L182 omatonBuilderFactory]: Interpolants [4480#(<= main_~i~0 5), 4481#(<= main_~i~0 6), 4482#(<= main_~i~0 7), 4483#(<= main_~i~0 8), 4484#(<= main_~i~0 9), 4485#(<= main_~i~0 10), 4486#(<= main_~i~0 11), 4487#(<= main_~i~0 12), 4488#(<= main_~i~0 13), 4489#(<= main_~i~0 14), 4490#(<= main_~i~0 15), 4491#(<= main_~i~0 16), 4492#(<= main_~i~0 17), 4493#(<= main_~i~0 18), 4494#(<= main_~i~0 19), 4495#(<= main_~i~0 20), 4496#(<= main_~i~0 21), 4497#(<= main_~i~0 22), 4473#true, 4474#false, 4475#(<= main_~i~0 0), 4476#(<= main_~i~0 1), 4477#(<= main_~i~0 2), 4478#(<= main_~i~0 3), 4479#(<= main_~i~0 4)] [2018-02-02 10:34:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:41,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:34:41,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:34:41,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:34:41,973 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 25 states. [2018-02-02 10:34:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:42,095 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2018-02-02 10:34:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:34:42,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2018-02-02 10:34:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:42,096 INFO L225 Difference]: With dead ends: 224 [2018-02-02 10:34:42,096 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 10:34:42,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:34:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 10:34:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 113. [2018-02-02 10:34:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:34:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-02-02 10:34:42,098 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-02-02 10:34:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:42,098 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-02-02 10:34:42,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:34:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-02-02 10:34:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:34:42,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:42,099 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:42,099 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 144700633, now seen corresponding path program 22 times [2018-02-02 10:34:42,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:42,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:42,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:42,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:34:42,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:42,283 INFO L182 omatonBuilderFactory]: Interpolants [4835#true, 4836#false, 4837#(<= main_~i~0 0), 4838#(<= main_~i~0 1), 4839#(<= main_~i~0 2), 4840#(<= main_~i~0 3), 4841#(<= main_~i~0 4), 4842#(<= main_~i~0 5), 4843#(<= main_~i~0 6), 4844#(<= main_~i~0 7), 4845#(<= main_~i~0 8), 4846#(<= main_~i~0 9), 4847#(<= main_~i~0 10), 4848#(<= main_~i~0 11), 4849#(<= main_~i~0 12), 4850#(<= main_~i~0 13), 4851#(<= main_~i~0 14), 4852#(<= main_~i~0 15), 4853#(<= main_~i~0 16), 4854#(<= main_~i~0 17), 4855#(<= main_~i~0 18), 4856#(<= main_~i~0 19), 4857#(<= main_~i~0 20), 4858#(<= main_~i~0 21), 4859#(<= main_~i~0 22), 4860#(<= main_~i~0 23)] [2018-02-02 10:34:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:42,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:34:42,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:34:42,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:34:42,284 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 26 states. [2018-02-02 10:34:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:42,407 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-02-02 10:34:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:34:42,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2018-02-02 10:34:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:42,408 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:34:42,408 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:34:42,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:34:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:34:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 117. [2018-02-02 10:34:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:34:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-02-02 10:34:42,410 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 112 [2018-02-02 10:34:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:42,410 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-02-02 10:34:42,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:34:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-02-02 10:34:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 10:34:42,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:42,411 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:42,411 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash -247912110, now seen corresponding path program 23 times [2018-02-02 10:34:42,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:42,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:42,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:42,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:34:42,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:42,708 INFO L182 omatonBuilderFactory]: Interpolants [5211#true, 5212#false, 5213#(<= main_~i~0 0), 5214#(<= main_~i~0 1), 5215#(<= main_~i~0 2), 5216#(<= main_~i~0 3), 5217#(<= main_~i~0 4), 5218#(<= main_~i~0 5), 5219#(<= main_~i~0 6), 5220#(<= main_~i~0 7), 5221#(<= main_~i~0 8), 5222#(<= main_~i~0 9), 5223#(<= main_~i~0 10), 5224#(<= main_~i~0 11), 5225#(<= main_~i~0 12), 5226#(<= main_~i~0 13), 5227#(<= main_~i~0 14), 5228#(<= main_~i~0 15), 5229#(<= main_~i~0 16), 5230#(<= main_~i~0 17), 5231#(<= main_~i~0 18), 5232#(<= main_~i~0 19), 5233#(<= main_~i~0 20), 5234#(<= main_~i~0 21), 5235#(<= main_~i~0 22), 5236#(<= main_~i~0 23), 5237#(<= main_~i~0 24)] [2018-02-02 10:34:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:42,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:34:42,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:34:42,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:34:42,709 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 27 states. [2018-02-02 10:34:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:42,864 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-02-02 10:34:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:34:42,864 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 116 [2018-02-02 10:34:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:42,865 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:34:42,865 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:34:42,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:34:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:34:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 121. [2018-02-02 10:34:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:34:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-02-02 10:34:42,867 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-02-02 10:34:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:42,867 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-02-02 10:34:42,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:34:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-02-02 10:34:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:34:42,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:42,867 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:42,867 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:42,868 INFO L82 PathProgramCache]: Analyzing trace with hash -926844597, now seen corresponding path program 24 times [2018-02-02 10:34:42,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:42,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:43,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:43,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:34:43,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:43,113 INFO L182 omatonBuilderFactory]: Interpolants [5601#true, 5602#false, 5603#(<= main_~i~0 0), 5604#(<= main_~i~0 1), 5605#(<= main_~i~0 2), 5606#(<= main_~i~0 3), 5607#(<= main_~i~0 4), 5608#(<= main_~i~0 5), 5609#(<= main_~i~0 6), 5610#(<= main_~i~0 7), 5611#(<= main_~i~0 8), 5612#(<= main_~i~0 9), 5613#(<= main_~i~0 10), 5614#(<= main_~i~0 11), 5615#(<= main_~i~0 12), 5616#(<= main_~i~0 13), 5617#(<= main_~i~0 14), 5618#(<= main_~i~0 15), 5619#(<= main_~i~0 16), 5620#(<= main_~i~0 17), 5621#(<= main_~i~0 18), 5622#(<= main_~i~0 19), 5623#(<= main_~i~0 20), 5624#(<= main_~i~0 21), 5625#(<= main_~i~0 22), 5626#(<= main_~i~0 23), 5627#(<= main_~i~0 24), 5628#(<= main_~i~0 25)] [2018-02-02 10:34:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:43,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:34:43,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:34:43,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:34:43,115 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 28 states. [2018-02-02 10:34:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:43,324 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2018-02-02 10:34:43,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:34:43,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 120 [2018-02-02 10:34:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:43,325 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:34:43,325 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 10:34:43,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:34:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 10:34:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 125. [2018-02-02 10:34:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:34:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-02-02 10:34:43,327 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 120 [2018-02-02 10:34:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:43,328 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-02-02 10:34:43,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:34:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-02-02 10:34:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 10:34:43,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:43,328 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:43,328 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash 54469828, now seen corresponding path program 25 times [2018-02-02 10:34:43,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:43,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:43,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:43,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:34:43,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:43,661 INFO L182 omatonBuilderFactory]: Interpolants [6016#(<= main_~i~0 9), 6017#(<= main_~i~0 10), 6018#(<= main_~i~0 11), 6019#(<= main_~i~0 12), 6020#(<= main_~i~0 13), 6021#(<= main_~i~0 14), 6022#(<= main_~i~0 15), 6023#(<= main_~i~0 16), 6024#(<= main_~i~0 17), 6025#(<= main_~i~0 18), 6026#(<= main_~i~0 19), 6027#(<= main_~i~0 20), 6028#(<= main_~i~0 21), 6029#(<= main_~i~0 22), 6030#(<= main_~i~0 23), 6031#(<= main_~i~0 24), 6032#(<= main_~i~0 25), 6033#(<= main_~i~0 26), 6005#true, 6006#false, 6007#(<= main_~i~0 0), 6008#(<= main_~i~0 1), 6009#(<= main_~i~0 2), 6010#(<= main_~i~0 3), 6011#(<= main_~i~0 4), 6012#(<= main_~i~0 5), 6013#(<= main_~i~0 6), 6014#(<= main_~i~0 7), 6015#(<= main_~i~0 8)] [2018-02-02 10:34:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:43,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:34:43,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:34:43,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:34:43,663 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 29 states. [2018-02-02 10:34:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:43,911 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2018-02-02 10:34:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:34:43,911 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-02-02 10:34:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:43,912 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:34:43,913 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:34:43,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:34:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:34:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 129. [2018-02-02 10:34:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:34:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-02-02 10:34:43,916 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-02-02 10:34:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:43,916 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-02-02 10:34:43,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:34:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-02-02 10:34:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 10:34:43,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:43,917 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:43,917 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 664300477, now seen corresponding path program 26 times [2018-02-02 10:34:43,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:43,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:44,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:44,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:34:44,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:44,189 INFO L182 omatonBuilderFactory]: Interpolants [6423#true, 6424#false, 6425#(<= main_~i~0 0), 6426#(<= main_~i~0 1), 6427#(<= main_~i~0 2), 6428#(<= main_~i~0 3), 6429#(<= main_~i~0 4), 6430#(<= main_~i~0 5), 6431#(<= main_~i~0 6), 6432#(<= main_~i~0 7), 6433#(<= main_~i~0 8), 6434#(<= main_~i~0 9), 6435#(<= main_~i~0 10), 6436#(<= main_~i~0 11), 6437#(<= main_~i~0 12), 6438#(<= main_~i~0 13), 6439#(<= main_~i~0 14), 6440#(<= main_~i~0 15), 6441#(<= main_~i~0 16), 6442#(<= main_~i~0 17), 6443#(<= main_~i~0 18), 6444#(<= main_~i~0 19), 6445#(<= main_~i~0 20), 6446#(<= main_~i~0 21), 6447#(<= main_~i~0 22), 6448#(<= main_~i~0 23), 6449#(<= main_~i~0 24), 6450#(<= main_~i~0 25), 6451#(<= main_~i~0 26), 6452#(<= main_~i~0 27)] [2018-02-02 10:34:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:44,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:34:44,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:34:44,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:34:44,190 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 30 states. [2018-02-02 10:34:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:44,386 INFO L93 Difference]: Finished difference Result 269 states and 295 transitions. [2018-02-02 10:34:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:34:44,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 128 [2018-02-02 10:34:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:44,387 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:34:44,388 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:34:44,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:34:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:34:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 133. [2018-02-02 10:34:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:34:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-02-02 10:34:44,391 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-02-02 10:34:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:44,391 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-02-02 10:34:44,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:34:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-02-02 10:34:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 10:34:44,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:44,392 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:44,392 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1603505718, now seen corresponding path program 27 times [2018-02-02 10:34:44,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:44,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:44,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:44,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:34:44,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:44,696 INFO L182 omatonBuilderFactory]: Interpolants [6855#true, 6856#false, 6857#(<= main_~i~0 0), 6858#(<= main_~i~0 1), 6859#(<= main_~i~0 2), 6860#(<= main_~i~0 3), 6861#(<= main_~i~0 4), 6862#(<= main_~i~0 5), 6863#(<= main_~i~0 6), 6864#(<= main_~i~0 7), 6865#(<= main_~i~0 8), 6866#(<= main_~i~0 9), 6867#(<= main_~i~0 10), 6868#(<= main_~i~0 11), 6869#(<= main_~i~0 12), 6870#(<= main_~i~0 13), 6871#(<= main_~i~0 14), 6872#(<= main_~i~0 15), 6873#(<= main_~i~0 16), 6874#(<= main_~i~0 17), 6875#(<= main_~i~0 18), 6876#(<= main_~i~0 19), 6877#(<= main_~i~0 20), 6878#(<= main_~i~0 21), 6879#(<= main_~i~0 22), 6880#(<= main_~i~0 23), 6881#(<= main_~i~0 24), 6882#(<= main_~i~0 25), 6883#(<= main_~i~0 26), 6884#(<= main_~i~0 27), 6885#(<= main_~i~0 28)] [2018-02-02 10:34:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:44,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:34:44,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:34:44,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:34:44,697 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-02-02 10:34:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:44,862 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2018-02-02 10:34:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:34:44,862 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-02-02 10:34:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:44,863 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:34:44,863 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:34:44,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:34:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:34:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 137. [2018-02-02 10:34:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:34:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-02-02 10:34:44,866 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-02-02 10:34:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:44,866 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-02-02 10:34:44,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:34:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-02-02 10:34:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 10:34:44,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:44,867 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:44,867 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash 131517487, now seen corresponding path program 28 times [2018-02-02 10:34:44,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:44,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:45,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:45,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:34:45,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:45,245 INFO L182 omatonBuilderFactory]: Interpolants [7301#true, 7302#false, 7303#(<= main_~i~0 0), 7304#(<= main_~i~0 1), 7305#(<= main_~i~0 2), 7306#(<= main_~i~0 3), 7307#(<= main_~i~0 4), 7308#(<= main_~i~0 5), 7309#(<= main_~i~0 6), 7310#(<= main_~i~0 7), 7311#(<= main_~i~0 8), 7312#(<= main_~i~0 9), 7313#(<= main_~i~0 10), 7314#(<= main_~i~0 11), 7315#(<= main_~i~0 12), 7316#(<= main_~i~0 13), 7317#(<= main_~i~0 14), 7318#(<= main_~i~0 15), 7319#(<= main_~i~0 16), 7320#(<= main_~i~0 17), 7321#(<= main_~i~0 18), 7322#(<= main_~i~0 19), 7323#(<= main_~i~0 20), 7324#(<= main_~i~0 21), 7325#(<= main_~i~0 22), 7326#(<= main_~i~0 23), 7327#(<= main_~i~0 24), 7328#(<= main_~i~0 25), 7329#(<= main_~i~0 26), 7330#(<= main_~i~0 27), 7331#(<= main_~i~0 28), 7332#(<= main_~i~0 29)] [2018-02-02 10:34:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:45,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:34:45,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:34:45,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:34:45,247 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 32 states. [2018-02-02 10:34:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:45,471 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2018-02-02 10:34:45,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:34:45,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 136 [2018-02-02 10:34:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:45,472 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:34:45,472 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:34:45,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:34:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:34:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 141. [2018-02-02 10:34:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:34:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-02-02 10:34:45,474 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 136 [2018-02-02 10:34:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:45,474 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-02-02 10:34:45,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:34:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-02-02 10:34:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 10:34:45,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:45,475 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:45,475 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1072194984, now seen corresponding path program 29 times [2018-02-02 10:34:45,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:45,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:45,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:45,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:34:45,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:45,897 INFO L182 omatonBuilderFactory]: Interpolants [7761#true, 7762#false, 7763#(<= main_~i~0 0), 7764#(<= main_~i~0 1), 7765#(<= main_~i~0 2), 7766#(<= main_~i~0 3), 7767#(<= main_~i~0 4), 7768#(<= main_~i~0 5), 7769#(<= main_~i~0 6), 7770#(<= main_~i~0 7), 7771#(<= main_~i~0 8), 7772#(<= main_~i~0 9), 7773#(<= main_~i~0 10), 7774#(<= main_~i~0 11), 7775#(<= main_~i~0 12), 7776#(<= main_~i~0 13), 7777#(<= main_~i~0 14), 7778#(<= main_~i~0 15), 7779#(<= main_~i~0 16), 7780#(<= main_~i~0 17), 7781#(<= main_~i~0 18), 7782#(<= main_~i~0 19), 7783#(<= main_~i~0 20), 7784#(<= main_~i~0 21), 7785#(<= main_~i~0 22), 7786#(<= main_~i~0 23), 7787#(<= main_~i~0 24), 7788#(<= main_~i~0 25), 7789#(<= main_~i~0 26), 7790#(<= main_~i~0 27), 7791#(<= main_~i~0 28), 7792#(<= main_~i~0 29), 7793#(<= main_~i~0 30)] [2018-02-02 10:34:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:45,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:34:45,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:34:45,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:34:45,899 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 33 states. [2018-02-02 10:34:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:46,145 INFO L93 Difference]: Finished difference Result 296 states and 325 transitions. [2018-02-02 10:34:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:34:46,145 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 140 [2018-02-02 10:34:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:46,146 INFO L225 Difference]: With dead ends: 296 [2018-02-02 10:34:46,146 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 10:34:46,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:34:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 10:34:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 145. [2018-02-02 10:34:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:34:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-02-02 10:34:46,149 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-02-02 10:34:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:46,149 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-02-02 10:34:46,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:34:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-02-02 10:34:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-02 10:34:46,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:46,150 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:46,150 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2049874593, now seen corresponding path program 30 times [2018-02-02 10:34:46,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:46,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:46,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:46,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:34:46,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:46,556 INFO L182 omatonBuilderFactory]: Interpolants [8256#(<= main_~i~0 19), 8257#(<= main_~i~0 20), 8258#(<= main_~i~0 21), 8259#(<= main_~i~0 22), 8260#(<= main_~i~0 23), 8261#(<= main_~i~0 24), 8262#(<= main_~i~0 25), 8263#(<= main_~i~0 26), 8264#(<= main_~i~0 27), 8265#(<= main_~i~0 28), 8266#(<= main_~i~0 29), 8267#(<= main_~i~0 30), 8268#(<= main_~i~0 31), 8235#true, 8236#false, 8237#(<= main_~i~0 0), 8238#(<= main_~i~0 1), 8239#(<= main_~i~0 2), 8240#(<= main_~i~0 3), 8241#(<= main_~i~0 4), 8242#(<= main_~i~0 5), 8243#(<= main_~i~0 6), 8244#(<= main_~i~0 7), 8245#(<= main_~i~0 8), 8246#(<= main_~i~0 9), 8247#(<= main_~i~0 10), 8248#(<= main_~i~0 11), 8249#(<= main_~i~0 12), 8250#(<= main_~i~0 13), 8251#(<= main_~i~0 14), 8252#(<= main_~i~0 15), 8253#(<= main_~i~0 16), 8254#(<= main_~i~0 17), 8255#(<= main_~i~0 18)] [2018-02-02 10:34:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:46,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:34:46,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:34:46,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:34:46,559 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 34 states. [2018-02-02 10:34:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:46,772 INFO L93 Difference]: Finished difference Result 305 states and 335 transitions. [2018-02-02 10:34:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:34:46,773 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 144 [2018-02-02 10:34:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:46,774 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:34:46,774 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:34:46,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:34:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:34:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 149. [2018-02-02 10:34:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:34:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-02-02 10:34:46,776 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-02-02 10:34:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:46,776 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-02-02 10:34:46,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:34:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-02-02 10:34:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 10:34:46,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:46,777 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:46,777 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 200256282, now seen corresponding path program 31 times [2018-02-02 10:34:46,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:46,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:47,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:47,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:34:47,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:47,150 INFO L182 omatonBuilderFactory]: Interpolants [8723#true, 8724#false, 8725#(<= main_~i~0 0), 8726#(<= main_~i~0 1), 8727#(<= main_~i~0 2), 8728#(<= main_~i~0 3), 8729#(<= main_~i~0 4), 8730#(<= main_~i~0 5), 8731#(<= main_~i~0 6), 8732#(<= main_~i~0 7), 8733#(<= main_~i~0 8), 8734#(<= main_~i~0 9), 8735#(<= main_~i~0 10), 8736#(<= main_~i~0 11), 8737#(<= main_~i~0 12), 8738#(<= main_~i~0 13), 8739#(<= main_~i~0 14), 8740#(<= main_~i~0 15), 8741#(<= main_~i~0 16), 8742#(<= main_~i~0 17), 8743#(<= main_~i~0 18), 8744#(<= main_~i~0 19), 8745#(<= main_~i~0 20), 8746#(<= main_~i~0 21), 8747#(<= main_~i~0 22), 8748#(<= main_~i~0 23), 8749#(<= main_~i~0 24), 8750#(<= main_~i~0 25), 8751#(<= main_~i~0 26), 8752#(<= main_~i~0 27), 8753#(<= main_~i~0 28), 8754#(<= main_~i~0 29), 8755#(<= main_~i~0 30), 8756#(<= main_~i~0 31), 8757#(<= main_~i~0 32)] [2018-02-02 10:34:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:47,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:34:47,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:34:47,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:34:47,151 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 35 states. [2018-02-02 10:34:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:47,387 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-02-02 10:34:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:34:47,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2018-02-02 10:34:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:47,388 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:34:47,388 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 10:34:47,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:34:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 10:34:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 153. [2018-02-02 10:34:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:34:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-02-02 10:34:47,390 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-02-02 10:34:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:47,390 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-02-02 10:34:47,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:34:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-02-02 10:34:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 10:34:47,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:47,391 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:47,391 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1118709997, now seen corresponding path program 32 times [2018-02-02 10:34:47,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:47,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:47,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:47,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:34:47,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:47,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 10:34:47,804 INFO L182 omatonBuilderFactory]: Interpolants [9225#true, 9226#false, 9227#(<= main_~i~0 0), 9228#(<= main_~i~0 1), 9229#(<= main_~i~0 2), 9230#(<= main_~i~0 3), 9231#(<= main_~i~0 4), 9232#(<= main_~i~0 5), 9233#(<= main_~i~0 6), 9234#(<= main_~i~0 7), 9235#(<= main_~i~0 8), 9236#(<= main_~i~0 9), 9237#(<= main_~i~0 10), 9238#(<= main_~i~0 11), 9239#(<= main_~i~0 12), 9240#(<= main_~i~0 13), 9241#(<= main_~i~0 14), 9242#(<= main_~i~0 15), 9243#(<= main_~i~0 16), 9244#(<= main_~i~0 17), 9245#(<= main_~i~0 18), 9246#(<= main_~i~0 19), 9247#(<= main_~i~0 20), 9248#(<= main_~i~0 21), 9249#(<= main_~i~0 22), 9250#(<= main_~i~0 23), 9251#(<= main_~i~0 24), 9252#(<= main_~i~0 25), 9253#(<= main_~i~0 26), 9254#(<= main_~i~0 27), 9255#(<= main_~i~0 28), 9256#(<= main_~i~0 29), 9257#(<= main_~i~0 30), 9258#(<= main_~i~0 31), 9259#(<= main_~i~0 32), 9260#(<= main_~i~0 33)] [2018-02-02 10:34:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:47,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:34:47,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:34:47,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:34:47,805 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 36 states. [2018-02-02 10:34:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:48,045 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-02-02 10:34:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:34:48,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 152 [2018-02-02 10:34:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:48,046 INFO L225 Difference]: With dead ends: 323 [2018-02-02 10:34:48,046 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 10:34:48,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:34:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 10:34:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 157. [2018-02-02 10:34:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:34:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-02-02 10:34:48,050 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2018-02-02 10:34:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:48,050 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-02-02 10:34:48,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:34:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-02-02 10:34:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-02-02 10:34:48,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:48,051 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:48,051 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1499160204, now seen corresponding path program 33 times [2018-02-02 10:34:48,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:48,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:48,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:48,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:34:48,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:48,485 INFO L182 omatonBuilderFactory]: Interpolants [9741#true, 9742#false, 9743#(<= main_~i~0 0), 9744#(<= main_~i~0 1), 9745#(<= main_~i~0 2), 9746#(<= main_~i~0 3), 9747#(<= main_~i~0 4), 9748#(<= main_~i~0 5), 9749#(<= main_~i~0 6), 9750#(<= main_~i~0 7), 9751#(<= main_~i~0 8), 9752#(<= main_~i~0 9), 9753#(<= main_~i~0 10), 9754#(<= main_~i~0 11), 9755#(<= main_~i~0 12), 9756#(<= main_~i~0 13), 9757#(<= main_~i~0 14), 9758#(<= main_~i~0 15), 9759#(<= main_~i~0 16), 9760#(<= main_~i~0 17), 9761#(<= main_~i~0 18), 9762#(<= main_~i~0 19), 9763#(<= main_~i~0 20), 9764#(<= main_~i~0 21), 9765#(<= main_~i~0 22), 9766#(<= main_~i~0 23), 9767#(<= main_~i~0 24), 9768#(<= main_~i~0 25), 9769#(<= main_~i~0 26), 9770#(<= main_~i~0 27), 9771#(<= main_~i~0 28), 9772#(<= main_~i~0 29), 9773#(<= main_~i~0 30), 9774#(<= main_~i~0 31), 9775#(<= main_~i~0 32), 9776#(<= main_~i~0 33), 9777#(<= main_~i~0 34)] [2018-02-02 10:34:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:48,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:34:48,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:34:48,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:34:48,486 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 37 states. [2018-02-02 10:34:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:48,688 INFO L93 Difference]: Finished difference Result 332 states and 365 transitions. [2018-02-02 10:34:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:34:48,688 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 156 [2018-02-02 10:34:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:48,689 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:34:48,689 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:34:48,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:34:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:34:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 161. [2018-02-02 10:34:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:34:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-02-02 10:34:48,693 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-02-02 10:34:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:48,693 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-02-02 10:34:48,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:34:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-02-02 10:34:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 10:34:48,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:48,694 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:48,694 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1039303045, now seen corresponding path program 34 times [2018-02-02 10:34:48,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:48,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:49,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:49,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 10:34:49,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:49,171 INFO L182 omatonBuilderFactory]: Interpolants [10304#(<= main_~i~0 31), 10305#(<= main_~i~0 32), 10306#(<= main_~i~0 33), 10307#(<= main_~i~0 34), 10308#(<= main_~i~0 35), 10271#true, 10272#false, 10273#(<= main_~i~0 0), 10274#(<= main_~i~0 1), 10275#(<= main_~i~0 2), 10276#(<= main_~i~0 3), 10277#(<= main_~i~0 4), 10278#(<= main_~i~0 5), 10279#(<= main_~i~0 6), 10280#(<= main_~i~0 7), 10281#(<= main_~i~0 8), 10282#(<= main_~i~0 9), 10283#(<= main_~i~0 10), 10284#(<= main_~i~0 11), 10285#(<= main_~i~0 12), 10286#(<= main_~i~0 13), 10287#(<= main_~i~0 14), 10288#(<= main_~i~0 15), 10289#(<= main_~i~0 16), 10290#(<= main_~i~0 17), 10291#(<= main_~i~0 18), 10292#(<= main_~i~0 19), 10293#(<= main_~i~0 20), 10294#(<= main_~i~0 21), 10295#(<= main_~i~0 22), 10296#(<= main_~i~0 23), 10297#(<= main_~i~0 24), 10298#(<= main_~i~0 25), 10299#(<= main_~i~0 26), 10300#(<= main_~i~0 27), 10301#(<= main_~i~0 28), 10302#(<= main_~i~0 29), 10303#(<= main_~i~0 30)] [2018-02-02 10:34:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:49,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:34:49,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:34:49,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:34:49,172 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 38 states. [2018-02-02 10:34:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:49,381 INFO L93 Difference]: Finished difference Result 341 states and 375 transitions. [2018-02-02 10:34:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:34:49,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 160 [2018-02-02 10:34:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:49,383 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:34:49,383 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:34:49,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:34:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:34:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 165. [2018-02-02 10:34:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:34:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-02-02 10:34:49,385 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 160 [2018-02-02 10:34:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:49,385 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-02-02 10:34:49,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:34:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-02-02 10:34:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 10:34:49,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:49,386 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:49,386 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -337805314, now seen corresponding path program 35 times [2018-02-02 10:34:49,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:49,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:49,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:49,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 10:34:49,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:49,782 INFO L182 omatonBuilderFactory]: Interpolants [10816#false, 10817#(<= main_~i~0 0), 10818#(<= main_~i~0 1), 10819#(<= main_~i~0 2), 10820#(<= main_~i~0 3), 10821#(<= main_~i~0 4), 10822#(<= main_~i~0 5), 10823#(<= main_~i~0 6), 10824#(<= main_~i~0 7), 10825#(<= main_~i~0 8), 10826#(<= main_~i~0 9), 10827#(<= main_~i~0 10), 10828#(<= main_~i~0 11), 10829#(<= main_~i~0 12), 10830#(<= main_~i~0 13), 10831#(<= main_~i~0 14), 10832#(<= main_~i~0 15), 10833#(<= main_~i~0 16), 10834#(<= main_~i~0 17), 10835#(<= main_~i~0 18), 10836#(<= main_~i~0 19), 10837#(<= main_~i~0 20), 10838#(<= main_~i~0 21), 10839#(<= main_~i~0 22), 10840#(<= main_~i~0 23), 10841#(<= main_~i~0 24), 10842#(<= main_~i~0 25), 10843#(<= main_~i~0 26), 10844#(<= main_~i~0 27), 10845#(<= main_~i~0 28), 10846#(<= main_~i~0 29), 10847#(<= main_~i~0 30), 10848#(<= main_~i~0 31), 10849#(<= main_~i~0 32), 10850#(<= main_~i~0 33), 10851#(<= main_~i~0 34), 10852#(<= main_~i~0 35), 10853#(<= main_~i~0 36), 10815#true] [2018-02-02 10:34:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:49,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 10:34:49,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 10:34:49,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:34:49,783 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 39 states. [2018-02-02 10:34:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:50,030 INFO L93 Difference]: Finished difference Result 350 states and 385 transitions. [2018-02-02 10:34:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:34:50,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 164 [2018-02-02 10:34:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:50,031 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:34:50,031 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:34:50,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:34:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:34:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 169. [2018-02-02 10:34:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:34:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-02-02 10:34:50,035 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-02-02 10:34:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:50,035 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-02-02 10:34:50,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 10:34:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-02-02 10:34:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 10:34:50,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:50,036 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:50,036 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1765631497, now seen corresponding path program 36 times [2018-02-02 10:34:50,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:50,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:50,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:50,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 10:34:50,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:50,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 10:34:50,496 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~0 17), 11393#(<= main_~i~0 18), 11394#(<= main_~i~0 19), 11395#(<= main_~i~0 20), 11396#(<= main_~i~0 21), 11397#(<= main_~i~0 22), 11398#(<= main_~i~0 23), 11399#(<= main_~i~0 24), 11400#(<= main_~i~0 25), 11401#(<= main_~i~0 26), 11402#(<= main_~i~0 27), 11403#(<= main_~i~0 28), 11404#(<= main_~i~0 29), 11405#(<= main_~i~0 30), 11406#(<= main_~i~0 31), 11407#(<= main_~i~0 32), 11408#(<= main_~i~0 33), 11409#(<= main_~i~0 34), 11410#(<= main_~i~0 35), 11411#(<= main_~i~0 36), 11412#(<= main_~i~0 37), 11373#true, 11374#false, 11375#(<= main_~i~0 0), 11376#(<= main_~i~0 1), 11377#(<= main_~i~0 2), 11378#(<= main_~i~0 3), 11379#(<= main_~i~0 4), 11380#(<= main_~i~0 5), 11381#(<= main_~i~0 6), 11382#(<= main_~i~0 7), 11383#(<= main_~i~0 8), 11384#(<= main_~i~0 9), 11385#(<= main_~i~0 10), 11386#(<= main_~i~0 11), 11387#(<= main_~i~0 12), 11388#(<= main_~i~0 13), 11389#(<= main_~i~0 14), 11390#(<= main_~i~0 15), 11391#(<= main_~i~0 16)] [2018-02-02 10:34:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:50,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:34:50,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:34:50,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:34:50,497 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 40 states. [2018-02-02 10:34:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:50,722 INFO L93 Difference]: Finished difference Result 359 states and 395 transitions. [2018-02-02 10:34:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:34:50,722 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 168 [2018-02-02 10:34:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:50,723 INFO L225 Difference]: With dead ends: 359 [2018-02-02 10:34:50,723 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 10:34:50,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:34:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 10:34:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 173. [2018-02-02 10:34:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:34:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-02-02 10:34:50,725 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 168 [2018-02-02 10:34:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:50,725 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-02-02 10:34:50,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:34:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-02-02 10:34:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 10:34:50,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:50,726 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:50,727 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1255665808, now seen corresponding path program 37 times [2018-02-02 10:34:50,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:50,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:51,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:51,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 10:34:51,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:51,183 INFO L182 omatonBuilderFactory]: Interpolants [11968#(<= main_~i~0 21), 11969#(<= main_~i~0 22), 11970#(<= main_~i~0 23), 11971#(<= main_~i~0 24), 11972#(<= main_~i~0 25), 11973#(<= main_~i~0 26), 11974#(<= main_~i~0 27), 11975#(<= main_~i~0 28), 11976#(<= main_~i~0 29), 11977#(<= main_~i~0 30), 11978#(<= main_~i~0 31), 11979#(<= main_~i~0 32), 11980#(<= main_~i~0 33), 11981#(<= main_~i~0 34), 11982#(<= main_~i~0 35), 11983#(<= main_~i~0 36), 11984#(<= main_~i~0 37), 11985#(<= main_~i~0 38), 11945#true, 11946#false, 11947#(<= main_~i~0 0), 11948#(<= main_~i~0 1), 11949#(<= main_~i~0 2), 11950#(<= main_~i~0 3), 11951#(<= main_~i~0 4), 11952#(<= main_~i~0 5), 11953#(<= main_~i~0 6), 11954#(<= main_~i~0 7), 11955#(<= main_~i~0 8), 11956#(<= main_~i~0 9), 11957#(<= main_~i~0 10), 11958#(<= main_~i~0 11), 11959#(<= main_~i~0 12), 11960#(<= main_~i~0 13), 11961#(<= main_~i~0 14), 11962#(<= main_~i~0 15), 11963#(<= main_~i~0 16), 11964#(<= main_~i~0 17), 11965#(<= main_~i~0 18), 11966#(<= main_~i~0 19), 11967#(<= main_~i~0 20)] [2018-02-02 10:34:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:51,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 10:34:51,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 10:34:51,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:34:51,184 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 41 states. [2018-02-02 10:34:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:51,409 INFO L93 Difference]: Finished difference Result 368 states and 405 transitions. [2018-02-02 10:34:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:34:51,410 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-02-02 10:34:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:51,411 INFO L225 Difference]: With dead ends: 368 [2018-02-02 10:34:51,411 INFO L226 Difference]: Without dead ends: 368 [2018-02-02 10:34:51,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:34:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-02 10:34:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 177. [2018-02-02 10:34:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:34:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-02-02 10:34:51,413 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-02-02 10:34:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:51,413 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-02-02 10:34:51,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 10:34:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-02-02 10:34:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-02 10:34:51,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:51,414 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:51,414 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1871437719, now seen corresponding path program 38 times [2018-02-02 10:34:51,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:51,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:51,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:51,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:34:51,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:51,862 INFO L182 omatonBuilderFactory]: Interpolants [12544#(<= main_~i~0 11), 12545#(<= main_~i~0 12), 12546#(<= main_~i~0 13), 12547#(<= main_~i~0 14), 12548#(<= main_~i~0 15), 12549#(<= main_~i~0 16), 12550#(<= main_~i~0 17), 12551#(<= main_~i~0 18), 12552#(<= main_~i~0 19), 12553#(<= main_~i~0 20), 12554#(<= main_~i~0 21), 12555#(<= main_~i~0 22), 12556#(<= main_~i~0 23), 12557#(<= main_~i~0 24), 12558#(<= main_~i~0 25), 12559#(<= main_~i~0 26), 12560#(<= main_~i~0 27), 12561#(<= main_~i~0 28), 12562#(<= main_~i~0 29), 12563#(<= main_~i~0 30), 12564#(<= main_~i~0 31), 12565#(<= main_~i~0 32), 12566#(<= main_~i~0 33), 12567#(<= main_~i~0 34), 12568#(<= main_~i~0 35), 12569#(<= main_~i~0 36), 12570#(<= main_~i~0 37), 12571#(<= main_~i~0 38), 12572#(<= main_~i~0 39), 12531#true, 12532#false, 12533#(<= main_~i~0 0), 12534#(<= main_~i~0 1), 12535#(<= main_~i~0 2), 12536#(<= main_~i~0 3), 12537#(<= main_~i~0 4), 12538#(<= main_~i~0 5), 12539#(<= main_~i~0 6), 12540#(<= main_~i~0 7), 12541#(<= main_~i~0 8), 12542#(<= main_~i~0 9), 12543#(<= main_~i~0 10)] [2018-02-02 10:34:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:51,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 10:34:51,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 10:34:51,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:34:51,863 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 42 states. [2018-02-02 10:34:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:52,086 INFO L93 Difference]: Finished difference Result 377 states and 415 transitions. [2018-02-02 10:34:52,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:34:52,086 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 176 [2018-02-02 10:34:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:52,087 INFO L225 Difference]: With dead ends: 377 [2018-02-02 10:34:52,087 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 10:34:52,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:34:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 10:34:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 181. [2018-02-02 10:34:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:34:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-02-02 10:34:52,089 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2018-02-02 10:34:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:52,089 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-02-02 10:34:52,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 10:34:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-02-02 10:34:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 10:34:52,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:52,090 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:52,090 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -722662174, now seen corresponding path program 39 times [2018-02-02 10:34:52,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:52,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:52,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:52,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 10:34:52,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:52,559 INFO L182 omatonBuilderFactory]: Interpolants [13131#true, 13132#false, 13133#(<= main_~i~0 0), 13134#(<= main_~i~0 1), 13135#(<= main_~i~0 2), 13136#(<= main_~i~0 3), 13137#(<= main_~i~0 4), 13138#(<= main_~i~0 5), 13139#(<= main_~i~0 6), 13140#(<= main_~i~0 7), 13141#(<= main_~i~0 8), 13142#(<= main_~i~0 9), 13143#(<= main_~i~0 10), 13144#(<= main_~i~0 11), 13145#(<= main_~i~0 12), 13146#(<= main_~i~0 13), 13147#(<= main_~i~0 14), 13148#(<= main_~i~0 15), 13149#(<= main_~i~0 16), 13150#(<= main_~i~0 17), 13151#(<= main_~i~0 18), 13152#(<= main_~i~0 19), 13153#(<= main_~i~0 20), 13154#(<= main_~i~0 21), 13155#(<= main_~i~0 22), 13156#(<= main_~i~0 23), 13157#(<= main_~i~0 24), 13158#(<= main_~i~0 25), 13159#(<= main_~i~0 26), 13160#(<= main_~i~0 27), 13161#(<= main_~i~0 28), 13162#(<= main_~i~0 29), 13163#(<= main_~i~0 30), 13164#(<= main_~i~0 31), 13165#(<= main_~i~0 32), 13166#(<= main_~i~0 33), 13167#(<= main_~i~0 34), 13168#(<= main_~i~0 35), 13169#(<= main_~i~0 36), 13170#(<= main_~i~0 37), 13171#(<= main_~i~0 38), 13172#(<= main_~i~0 39), 13173#(<= main_~i~0 40)] [2018-02-02 10:34:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:52,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 10:34:52,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 10:34:52,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:34:52,561 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 43 states. [2018-02-02 10:34:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:52,871 INFO L93 Difference]: Finished difference Result 386 states and 425 transitions. [2018-02-02 10:34:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:34:52,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 180 [2018-02-02 10:34:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:52,872 INFO L225 Difference]: With dead ends: 386 [2018-02-02 10:34:52,872 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 10:34:52,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:34:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 10:34:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 185. [2018-02-02 10:34:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:34:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-02-02 10:34:52,875 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-02-02 10:34:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:52,875 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-02-02 10:34:52,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 10:34:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-02-02 10:34:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 10:34:52,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:52,876 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:52,876 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash 565777627, now seen corresponding path program 40 times [2018-02-02 10:34:52,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:52,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:53,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:53,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 10:34:53,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:53,379 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 13), 13761#(<= main_~i~0 14), 13762#(<= main_~i~0 15), 13763#(<= main_~i~0 16), 13764#(<= main_~i~0 17), 13765#(<= main_~i~0 18), 13766#(<= main_~i~0 19), 13767#(<= main_~i~0 20), 13768#(<= main_~i~0 21), 13769#(<= main_~i~0 22), 13770#(<= main_~i~0 23), 13771#(<= main_~i~0 24), 13772#(<= main_~i~0 25), 13773#(<= main_~i~0 26), 13774#(<= main_~i~0 27), 13775#(<= main_~i~0 28), 13776#(<= main_~i~0 29), 13777#(<= main_~i~0 30), 13778#(<= main_~i~0 31), 13779#(<= main_~i~0 32), 13780#(<= main_~i~0 33), 13781#(<= main_~i~0 34), 13782#(<= main_~i~0 35), 13783#(<= main_~i~0 36), 13784#(<= main_~i~0 37), 13785#(<= main_~i~0 38), 13786#(<= main_~i~0 39), 13787#(<= main_~i~0 40), 13788#(<= main_~i~0 41), 13745#true, 13746#false, 13747#(<= main_~i~0 0), 13748#(<= main_~i~0 1), 13749#(<= main_~i~0 2), 13750#(<= main_~i~0 3), 13751#(<= main_~i~0 4), 13752#(<= main_~i~0 5), 13753#(<= main_~i~0 6), 13754#(<= main_~i~0 7), 13755#(<= main_~i~0 8), 13756#(<= main_~i~0 9), 13757#(<= main_~i~0 10), 13758#(<= main_~i~0 11), 13759#(<= main_~i~0 12)] [2018-02-02 10:34:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:53,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 10:34:53,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 10:34:53,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:34:53,381 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 44 states. [2018-02-02 10:34:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:53,682 INFO L93 Difference]: Finished difference Result 395 states and 435 transitions. [2018-02-02 10:34:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:34:53,682 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 184 [2018-02-02 10:34:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:53,683 INFO L225 Difference]: With dead ends: 395 [2018-02-02 10:34:53,683 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 10:34:53,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:34:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 10:34:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 189. [2018-02-02 10:34:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:34:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-02-02 10:34:53,685 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-02-02 10:34:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:53,685 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-02-02 10:34:53,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 10:34:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-02-02 10:34:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 10:34:53,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:53,686 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:53,686 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1730250668, now seen corresponding path program 41 times [2018-02-02 10:34:53,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:53,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:54,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:54,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 10:34:54,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:54,170 INFO L182 omatonBuilderFactory]: Interpolants [14400#(<= main_~i~0 25), 14401#(<= main_~i~0 26), 14402#(<= main_~i~0 27), 14403#(<= main_~i~0 28), 14404#(<= main_~i~0 29), 14405#(<= main_~i~0 30), 14406#(<= main_~i~0 31), 14407#(<= main_~i~0 32), 14408#(<= main_~i~0 33), 14409#(<= main_~i~0 34), 14410#(<= main_~i~0 35), 14411#(<= main_~i~0 36), 14412#(<= main_~i~0 37), 14413#(<= main_~i~0 38), 14414#(<= main_~i~0 39), 14415#(<= main_~i~0 40), 14416#(<= main_~i~0 41), 14417#(<= main_~i~0 42), 14373#true, 14374#false, 14375#(<= main_~i~0 0), 14376#(<= main_~i~0 1), 14377#(<= main_~i~0 2), 14378#(<= main_~i~0 3), 14379#(<= main_~i~0 4), 14380#(<= main_~i~0 5), 14381#(<= main_~i~0 6), 14382#(<= main_~i~0 7), 14383#(<= main_~i~0 8), 14384#(<= main_~i~0 9), 14385#(<= main_~i~0 10), 14386#(<= main_~i~0 11), 14387#(<= main_~i~0 12), 14388#(<= main_~i~0 13), 14389#(<= main_~i~0 14), 14390#(<= main_~i~0 15), 14391#(<= main_~i~0 16), 14392#(<= main_~i~0 17), 14393#(<= main_~i~0 18), 14394#(<= main_~i~0 19), 14395#(<= main_~i~0 20), 14396#(<= main_~i~0 21), 14397#(<= main_~i~0 22), 14398#(<= main_~i~0 23), 14399#(<= main_~i~0 24)] [2018-02-02 10:34:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:54,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 10:34:54,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 10:34:54,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:34:54,171 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 45 states. [2018-02-02 10:34:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:54,446 INFO L93 Difference]: Finished difference Result 404 states and 445 transitions. [2018-02-02 10:34:54,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:34:54,446 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 188 [2018-02-02 10:34:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:54,447 INFO L225 Difference]: With dead ends: 404 [2018-02-02 10:34:54,447 INFO L226 Difference]: Without dead ends: 404 [2018-02-02 10:34:54,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:34:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-02 10:34:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 193. [2018-02-02 10:34:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:34:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-02-02 10:34:54,450 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-02-02 10:34:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:54,450 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-02-02 10:34:54,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 10:34:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-02-02 10:34:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 10:34:54,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:54,451 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:54,451 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1866692429, now seen corresponding path program 42 times [2018-02-02 10:34:54,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:54,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:54,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:54,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 10:34:54,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:54,974 INFO L182 omatonBuilderFactory]: Interpolants [15040#(<= main_~i~0 23), 15041#(<= main_~i~0 24), 15042#(<= main_~i~0 25), 15043#(<= main_~i~0 26), 15044#(<= main_~i~0 27), 15045#(<= main_~i~0 28), 15046#(<= main_~i~0 29), 15047#(<= main_~i~0 30), 15048#(<= main_~i~0 31), 15049#(<= main_~i~0 32), 15050#(<= main_~i~0 33), 15051#(<= main_~i~0 34), 15052#(<= main_~i~0 35), 15053#(<= main_~i~0 36), 15054#(<= main_~i~0 37), 15055#(<= main_~i~0 38), 15056#(<= main_~i~0 39), 15057#(<= main_~i~0 40), 15058#(<= main_~i~0 41), 15059#(<= main_~i~0 42), 15060#(<= main_~i~0 43), 15015#true, 15016#false, 15017#(<= main_~i~0 0), 15018#(<= main_~i~0 1), 15019#(<= main_~i~0 2), 15020#(<= main_~i~0 3), 15021#(<= main_~i~0 4), 15022#(<= main_~i~0 5), 15023#(<= main_~i~0 6), 15024#(<= main_~i~0 7), 15025#(<= main_~i~0 8), 15026#(<= main_~i~0 9), 15027#(<= main_~i~0 10), 15028#(<= main_~i~0 11), 15029#(<= main_~i~0 12), 15030#(<= main_~i~0 13), 15031#(<= main_~i~0 14), 15032#(<= main_~i~0 15), 15033#(<= main_~i~0 16), 15034#(<= main_~i~0 17), 15035#(<= main_~i~0 18), 15036#(<= main_~i~0 19), 15037#(<= main_~i~0 20), 15038#(<= main_~i~0 21), 15039#(<= main_~i~0 22)] [2018-02-02 10:34:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:54,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 10:34:54,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 10:34:54,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:34:54,984 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 46 states. [2018-02-02 10:34:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:55,237 INFO L93 Difference]: Finished difference Result 413 states and 455 transitions. [2018-02-02 10:34:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 10:34:55,237 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 192 [2018-02-02 10:34:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:55,238 INFO L225 Difference]: With dead ends: 413 [2018-02-02 10:34:55,238 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 10:34:55,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:34:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 10:34:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 197. [2018-02-02 10:34:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:34:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-02-02 10:34:55,240 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 192 [2018-02-02 10:34:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:55,240 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-02-02 10:34:55,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 10:34:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-02-02 10:34:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 10:34:55,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:55,241 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:55,241 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2091798982, now seen corresponding path program 43 times [2018-02-02 10:34:55,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:55,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:55,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:55,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 10:34:55,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:55,782 INFO L182 omatonBuilderFactory]: Interpolants [15680#(<= main_~i~0 7), 15681#(<= main_~i~0 8), 15682#(<= main_~i~0 9), 15683#(<= main_~i~0 10), 15684#(<= main_~i~0 11), 15685#(<= main_~i~0 12), 15686#(<= main_~i~0 13), 15687#(<= main_~i~0 14), 15688#(<= main_~i~0 15), 15689#(<= main_~i~0 16), 15690#(<= main_~i~0 17), 15691#(<= main_~i~0 18), 15692#(<= main_~i~0 19), 15693#(<= main_~i~0 20), 15694#(<= main_~i~0 21), 15695#(<= main_~i~0 22), 15696#(<= main_~i~0 23), 15697#(<= main_~i~0 24), 15698#(<= main_~i~0 25), 15699#(<= main_~i~0 26), 15700#(<= main_~i~0 27), 15701#(<= main_~i~0 28), 15702#(<= main_~i~0 29), 15703#(<= main_~i~0 30), 15704#(<= main_~i~0 31), 15705#(<= main_~i~0 32), 15706#(<= main_~i~0 33), 15707#(<= main_~i~0 34), 15708#(<= main_~i~0 35), 15709#(<= main_~i~0 36), 15710#(<= main_~i~0 37), 15711#(<= main_~i~0 38), 15712#(<= main_~i~0 39), 15713#(<= main_~i~0 40), 15714#(<= main_~i~0 41), 15715#(<= main_~i~0 42), 15716#(<= main_~i~0 43), 15717#(<= main_~i~0 44), 15671#true, 15672#false, 15673#(<= main_~i~0 0), 15674#(<= main_~i~0 1), 15675#(<= main_~i~0 2), 15676#(<= main_~i~0 3), 15677#(<= main_~i~0 4), 15678#(<= main_~i~0 5), 15679#(<= main_~i~0 6)] [2018-02-02 10:34:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:55,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 10:34:55,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 10:34:55,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:34:55,783 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 47 states. [2018-02-02 10:34:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:56,094 INFO L93 Difference]: Finished difference Result 422 states and 465 transitions. [2018-02-02 10:34:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:34:56,094 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 196 [2018-02-02 10:34:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:56,095 INFO L225 Difference]: With dead ends: 422 [2018-02-02 10:34:56,095 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 10:34:56,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:34:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 10:34:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 201. [2018-02-02 10:34:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 10:34:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-02-02 10:34:56,097 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-02-02 10:34:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:56,097 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-02-02 10:34:56,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 10:34:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-02-02 10:34:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-02 10:34:56,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:56,098 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:56,098 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash -876263489, now seen corresponding path program 44 times [2018-02-02 10:34:56,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:56,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:56,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:56,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 10:34:56,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:56,664 INFO L182 omatonBuilderFactory]: Interpolants [16384#(<= main_~i~0 41), 16385#(<= main_~i~0 42), 16386#(<= main_~i~0 43), 16387#(<= main_~i~0 44), 16388#(<= main_~i~0 45), 16341#true, 16342#false, 16343#(<= main_~i~0 0), 16344#(<= main_~i~0 1), 16345#(<= main_~i~0 2), 16346#(<= main_~i~0 3), 16347#(<= main_~i~0 4), 16348#(<= main_~i~0 5), 16349#(<= main_~i~0 6), 16350#(<= main_~i~0 7), 16351#(<= main_~i~0 8), 16352#(<= main_~i~0 9), 16353#(<= main_~i~0 10), 16354#(<= main_~i~0 11), 16355#(<= main_~i~0 12), 16356#(<= main_~i~0 13), 16357#(<= main_~i~0 14), 16358#(<= main_~i~0 15), 16359#(<= main_~i~0 16), 16360#(<= main_~i~0 17), 16361#(<= main_~i~0 18), 16362#(<= main_~i~0 19), 16363#(<= main_~i~0 20), 16364#(<= main_~i~0 21), 16365#(<= main_~i~0 22), 16366#(<= main_~i~0 23), 16367#(<= main_~i~0 24), 16368#(<= main_~i~0 25), 16369#(<= main_~i~0 26), 16370#(<= main_~i~0 27), 16371#(<= main_~i~0 28), 16372#(<= main_~i~0 29), 16373#(<= main_~i~0 30), 16374#(<= main_~i~0 31), 16375#(<= main_~i~0 32), 16376#(<= main_~i~0 33), 16377#(<= main_~i~0 34), 16378#(<= main_~i~0 35), 16379#(<= main_~i~0 36), 16380#(<= main_~i~0 37), 16381#(<= main_~i~0 38), 16382#(<= main_~i~0 39), 16383#(<= main_~i~0 40)] [2018-02-02 10:34:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:56,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 10:34:56,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 10:34:56,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:34:56,665 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 48 states. [2018-02-02 10:34:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:57,018 INFO L93 Difference]: Finished difference Result 431 states and 475 transitions. [2018-02-02 10:34:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:34:57,018 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 200 [2018-02-02 10:34:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:57,019 INFO L225 Difference]: With dead ends: 431 [2018-02-02 10:34:57,019 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 10:34:57,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:34:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 10:34:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 205. [2018-02-02 10:34:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:34:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-02-02 10:34:57,022 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 200 [2018-02-02 10:34:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:57,023 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-02-02 10:34:57,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 10:34:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-02-02 10:34:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-02 10:34:57,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:57,023 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:57,023 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash 705599800, now seen corresponding path program 45 times [2018-02-02 10:34:57,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:57,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:57,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:57,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 10:34:57,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:57,631 INFO L182 omatonBuilderFactory]: Interpolants [17025#true, 17026#false, 17027#(<= main_~i~0 0), 17028#(<= main_~i~0 1), 17029#(<= main_~i~0 2), 17030#(<= main_~i~0 3), 17031#(<= main_~i~0 4), 17032#(<= main_~i~0 5), 17033#(<= main_~i~0 6), 17034#(<= main_~i~0 7), 17035#(<= main_~i~0 8), 17036#(<= main_~i~0 9), 17037#(<= main_~i~0 10), 17038#(<= main_~i~0 11), 17039#(<= main_~i~0 12), 17040#(<= main_~i~0 13), 17041#(<= main_~i~0 14), 17042#(<= main_~i~0 15), 17043#(<= main_~i~0 16), 17044#(<= main_~i~0 17), 17045#(<= main_~i~0 18), 17046#(<= main_~i~0 19), 17047#(<= main_~i~0 20), 17048#(<= main_~i~0 21), 17049#(<= main_~i~0 22), 17050#(<= main_~i~0 23), 17051#(<= main_~i~0 24), 17052#(<= main_~i~0 25), 17053#(<= main_~i~0 26), 17054#(<= main_~i~0 27), 17055#(<= main_~i~0 28), 17056#(<= main_~i~0 29), 17057#(<= main_~i~0 30), 17058#(<= main_~i~0 31), 17059#(<= main_~i~0 32), 17060#(<= main_~i~0 33), 17061#(<= main_~i~0 34), 17062#(<= main_~i~0 35), 17063#(<= main_~i~0 36), 17064#(<= main_~i~0 37), 17065#(<= main_~i~0 38), 17066#(<= main_~i~0 39), 17067#(<= main_~i~0 40), 17068#(<= main_~i~0 41), 17069#(<= main_~i~0 42), 17070#(<= main_~i~0 43), 17071#(<= main_~i~0 44), 17072#(<= main_~i~0 45), 17073#(<= main_~i~0 46)] [2018-02-02 10:34:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:57,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 10:34:57,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 10:34:57,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:34:57,632 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 49 states. [2018-02-02 10:34:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:58,026 INFO L93 Difference]: Finished difference Result 440 states and 485 transitions. [2018-02-02 10:34:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 10:34:58,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-02-02 10:34:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:58,028 INFO L225 Difference]: With dead ends: 440 [2018-02-02 10:34:58,028 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 10:34:58,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:34:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 10:34:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 209. [2018-02-02 10:34:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:34:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-02-02 10:34:58,030 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-02-02 10:34:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:58,030 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-02-02 10:34:58,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 10:34:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-02-02 10:34:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-02 10:34:58,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:58,031 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:58,031 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1208973775, now seen corresponding path program 46 times [2018-02-02 10:34:58,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:58,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:58,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:58,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 10:34:58,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:58,628 INFO L182 omatonBuilderFactory]: Interpolants [17723#true, 17724#false, 17725#(<= main_~i~0 0), 17726#(<= main_~i~0 1), 17727#(<= main_~i~0 2), 17728#(<= main_~i~0 3), 17729#(<= main_~i~0 4), 17730#(<= main_~i~0 5), 17731#(<= main_~i~0 6), 17732#(<= main_~i~0 7), 17733#(<= main_~i~0 8), 17734#(<= main_~i~0 9), 17735#(<= main_~i~0 10), 17736#(<= main_~i~0 11), 17737#(<= main_~i~0 12), 17738#(<= main_~i~0 13), 17739#(<= main_~i~0 14), 17740#(<= main_~i~0 15), 17741#(<= main_~i~0 16), 17742#(<= main_~i~0 17), 17743#(<= main_~i~0 18), 17744#(<= main_~i~0 19), 17745#(<= main_~i~0 20), 17746#(<= main_~i~0 21), 17747#(<= main_~i~0 22), 17748#(<= main_~i~0 23), 17749#(<= main_~i~0 24), 17750#(<= main_~i~0 25), 17751#(<= main_~i~0 26), 17752#(<= main_~i~0 27), 17753#(<= main_~i~0 28), 17754#(<= main_~i~0 29), 17755#(<= main_~i~0 30), 17756#(<= main_~i~0 31), 17757#(<= main_~i~0 32), 17758#(<= main_~i~0 33), 17759#(<= main_~i~0 34), 17760#(<= main_~i~0 35), 17761#(<= main_~i~0 36), 17762#(<= main_~i~0 37), 17763#(<= main_~i~0 38), 17764#(<= main_~i~0 39), 17765#(<= main_~i~0 40), 17766#(<= main_~i~0 41), 17767#(<= main_~i~0 42), 17768#(<= main_~i~0 43), 17769#(<= main_~i~0 44), 17770#(<= main_~i~0 45), 17771#(<= main_~i~0 46), 17772#(<= main_~i~0 47)] [2018-02-02 10:34:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:58,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 10:34:58,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 10:34:58,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:34:58,629 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 50 states. [2018-02-02 10:34:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:59,008 INFO L93 Difference]: Finished difference Result 449 states and 495 transitions. [2018-02-02 10:34:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:34:59,009 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 208 [2018-02-02 10:34:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:59,010 INFO L225 Difference]: With dead ends: 449 [2018-02-02 10:34:59,010 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 10:34:59,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:34:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 10:34:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 213. [2018-02-02 10:34:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:34:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-02-02 10:34:59,014 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 208 [2018-02-02 10:34:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:59,014 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-02-02 10:34:59,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 10:34:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-02-02 10:34:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 10:34:59,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:59,015 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:59,015 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:34:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2024885930, now seen corresponding path program 47 times [2018-02-02 10:34:59,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:59,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:59,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:59,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 10:34:59,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:59,631 INFO L182 omatonBuilderFactory]: Interpolants [18435#true, 18436#false, 18437#(<= main_~i~0 0), 18438#(<= main_~i~0 1), 18439#(<= main_~i~0 2), 18440#(<= main_~i~0 3), 18441#(<= main_~i~0 4), 18442#(<= main_~i~0 5), 18443#(<= main_~i~0 6), 18444#(<= main_~i~0 7), 18445#(<= main_~i~0 8), 18446#(<= main_~i~0 9), 18447#(<= main_~i~0 10), 18448#(<= main_~i~0 11), 18449#(<= main_~i~0 12), 18450#(<= main_~i~0 13), 18451#(<= main_~i~0 14), 18452#(<= main_~i~0 15), 18453#(<= main_~i~0 16), 18454#(<= main_~i~0 17), 18455#(<= main_~i~0 18), 18456#(<= main_~i~0 19), 18457#(<= main_~i~0 20), 18458#(<= main_~i~0 21), 18459#(<= main_~i~0 22), 18460#(<= main_~i~0 23), 18461#(<= main_~i~0 24), 18462#(<= main_~i~0 25), 18463#(<= main_~i~0 26), 18464#(<= main_~i~0 27), 18465#(<= main_~i~0 28), 18466#(<= main_~i~0 29), 18467#(<= main_~i~0 30), 18468#(<= main_~i~0 31), 18469#(<= main_~i~0 32), 18470#(<= main_~i~0 33), 18471#(<= main_~i~0 34), 18472#(<= main_~i~0 35), 18473#(<= main_~i~0 36), 18474#(<= main_~i~0 37), 18475#(<= main_~i~0 38), 18476#(<= main_~i~0 39), 18477#(<= main_~i~0 40), 18478#(<= main_~i~0 41), 18479#(<= main_~i~0 42), 18480#(<= main_~i~0 43), 18481#(<= main_~i~0 44), 18482#(<= main_~i~0 45), 18483#(<= main_~i~0 46), 18484#(<= main_~i~0 47), 18485#(<= main_~i~0 48)] [2018-02-02 10:34:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:34:59,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 10:34:59,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 10:34:59,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:34:59,631 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 51 states. [2018-02-02 10:35:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:00,031 INFO L93 Difference]: Finished difference Result 458 states and 505 transitions. [2018-02-02 10:35:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 10:35:00,031 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 212 [2018-02-02 10:35:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:00,032 INFO L225 Difference]: With dead ends: 458 [2018-02-02 10:35:00,032 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 10:35:00,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:35:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 10:35:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 217. [2018-02-02 10:35:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:35:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-02-02 10:35:00,035 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-02-02 10:35:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:00,035 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-02-02 10:35:00,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 10:35:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-02-02 10:35:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-02-02 10:35:00,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:00,036 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:00,036 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash -495504733, now seen corresponding path program 48 times [2018-02-02 10:35:00,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:00,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:00,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:00,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 10:35:00,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:00,709 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 37), 19201#(<= main_~i~0 38), 19202#(<= main_~i~0 39), 19203#(<= main_~i~0 40), 19204#(<= main_~i~0 41), 19205#(<= main_~i~0 42), 19206#(<= main_~i~0 43), 19207#(<= main_~i~0 44), 19208#(<= main_~i~0 45), 19209#(<= main_~i~0 46), 19210#(<= main_~i~0 47), 19211#(<= main_~i~0 48), 19212#(<= main_~i~0 49), 19161#true, 19162#false, 19163#(<= main_~i~0 0), 19164#(<= main_~i~0 1), 19165#(<= main_~i~0 2), 19166#(<= main_~i~0 3), 19167#(<= main_~i~0 4), 19168#(<= main_~i~0 5), 19169#(<= main_~i~0 6), 19170#(<= main_~i~0 7), 19171#(<= main_~i~0 8), 19172#(<= main_~i~0 9), 19173#(<= main_~i~0 10), 19174#(<= main_~i~0 11), 19175#(<= main_~i~0 12), 19176#(<= main_~i~0 13), 19177#(<= main_~i~0 14), 19178#(<= main_~i~0 15), 19179#(<= main_~i~0 16), 19180#(<= main_~i~0 17), 19181#(<= main_~i~0 18), 19182#(<= main_~i~0 19), 19183#(<= main_~i~0 20), 19184#(<= main_~i~0 21), 19185#(<= main_~i~0 22), 19186#(<= main_~i~0 23), 19187#(<= main_~i~0 24), 19188#(<= main_~i~0 25), 19189#(<= main_~i~0 26), 19190#(<= main_~i~0 27), 19191#(<= main_~i~0 28), 19192#(<= main_~i~0 29), 19193#(<= main_~i~0 30), 19194#(<= main_~i~0 31), 19195#(<= main_~i~0 32), 19196#(<= main_~i~0 33), 19197#(<= main_~i~0 34), 19198#(<= main_~i~0 35), 19199#(<= main_~i~0 36)] [2018-02-02 10:35:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:00,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 10:35:00,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 10:35:00,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:35:00,710 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 52 states. [2018-02-02 10:35:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:01,049 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2018-02-02 10:35:01,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 10:35:01,049 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 216 [2018-02-02 10:35:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:01,050 INFO L225 Difference]: With dead ends: 467 [2018-02-02 10:35:01,050 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 10:35:01,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:35:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 10:35:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 221. [2018-02-02 10:35:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:35:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-02-02 10:35:01,052 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 216 [2018-02-02 10:35:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:01,053 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-02-02 10:35:01,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 10:35:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-02-02 10:35:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-02 10:35:01,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:01,053 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:01,053 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1850241564, now seen corresponding path program 49 times [2018-02-02 10:35:01,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:01,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:01,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:01,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 10:35:01,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:01,879 INFO L182 omatonBuilderFactory]: Interpolants [19901#true, 19902#false, 19903#(<= main_~i~0 0), 19904#(<= main_~i~0 1), 19905#(<= main_~i~0 2), 19906#(<= main_~i~0 3), 19907#(<= main_~i~0 4), 19908#(<= main_~i~0 5), 19909#(<= main_~i~0 6), 19910#(<= main_~i~0 7), 19911#(<= main_~i~0 8), 19912#(<= main_~i~0 9), 19913#(<= main_~i~0 10), 19914#(<= main_~i~0 11), 19915#(<= main_~i~0 12), 19916#(<= main_~i~0 13), 19917#(<= main_~i~0 14), 19918#(<= main_~i~0 15), 19919#(<= main_~i~0 16), 19920#(<= main_~i~0 17), 19921#(<= main_~i~0 18), 19922#(<= main_~i~0 19), 19923#(<= main_~i~0 20), 19924#(<= main_~i~0 21), 19925#(<= main_~i~0 22), 19926#(<= main_~i~0 23), 19927#(<= main_~i~0 24), 19928#(<= main_~i~0 25), 19929#(<= main_~i~0 26), 19930#(<= main_~i~0 27), 19931#(<= main_~i~0 28), 19932#(<= main_~i~0 29), 19933#(<= main_~i~0 30), 19934#(<= main_~i~0 31), 19935#(<= main_~i~0 32), 19936#(<= main_~i~0 33), 19937#(<= main_~i~0 34), 19938#(<= main_~i~0 35), 19939#(<= main_~i~0 36), 19940#(<= main_~i~0 37), 19941#(<= main_~i~0 38), 19942#(<= main_~i~0 39), 19943#(<= main_~i~0 40), 19944#(<= main_~i~0 41), 19945#(<= main_~i~0 42), 19946#(<= main_~i~0 43), 19947#(<= main_~i~0 44), 19948#(<= main_~i~0 45), 19949#(<= main_~i~0 46), 19950#(<= main_~i~0 47), 19951#(<= main_~i~0 48), 19952#(<= main_~i~0 49), 19953#(<= main_~i~0 50)] [2018-02-02 10:35:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:01,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 10:35:01,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 10:35:01,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:35:01,879 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 53 states. [2018-02-02 10:35:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:02,477 INFO L93 Difference]: Finished difference Result 476 states and 525 transitions. [2018-02-02 10:35:02,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 10:35:02,477 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 220 [2018-02-02 10:35:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:02,478 INFO L225 Difference]: With dead ends: 476 [2018-02-02 10:35:02,478 INFO L226 Difference]: Without dead ends: 476 [2018-02-02 10:35:02,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:35:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-02 10:35:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 225. [2018-02-02 10:35:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:35:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-02-02 10:35:02,482 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-02-02 10:35:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:02,483 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-02-02 10:35:02,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 10:35:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-02-02 10:35:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-02 10:35:02,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:02,484 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:02,484 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash 671829269, now seen corresponding path program 50 times [2018-02-02 10:35:02,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:02,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:03,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:03,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 10:35:03,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:03,330 INFO L182 omatonBuilderFactory]: Interpolants [20655#true, 20656#false, 20657#(<= main_~i~0 0), 20658#(<= main_~i~0 1), 20659#(<= main_~i~0 2), 20660#(<= main_~i~0 3), 20661#(<= main_~i~0 4), 20662#(<= main_~i~0 5), 20663#(<= main_~i~0 6), 20664#(<= main_~i~0 7), 20665#(<= main_~i~0 8), 20666#(<= main_~i~0 9), 20667#(<= main_~i~0 10), 20668#(<= main_~i~0 11), 20669#(<= main_~i~0 12), 20670#(<= main_~i~0 13), 20671#(<= main_~i~0 14), 20672#(<= main_~i~0 15), 20673#(<= main_~i~0 16), 20674#(<= main_~i~0 17), 20675#(<= main_~i~0 18), 20676#(<= main_~i~0 19), 20677#(<= main_~i~0 20), 20678#(<= main_~i~0 21), 20679#(<= main_~i~0 22), 20680#(<= main_~i~0 23), 20681#(<= main_~i~0 24), 20682#(<= main_~i~0 25), 20683#(<= main_~i~0 26), 20684#(<= main_~i~0 27), 20685#(<= main_~i~0 28), 20686#(<= main_~i~0 29), 20687#(<= main_~i~0 30), 20688#(<= main_~i~0 31), 20689#(<= main_~i~0 32), 20690#(<= main_~i~0 33), 20691#(<= main_~i~0 34), 20692#(<= main_~i~0 35), 20693#(<= main_~i~0 36), 20694#(<= main_~i~0 37), 20695#(<= main_~i~0 38), 20696#(<= main_~i~0 39), 20697#(<= main_~i~0 40), 20698#(<= main_~i~0 41), 20699#(<= main_~i~0 42), 20700#(<= main_~i~0 43), 20701#(<= main_~i~0 44), 20702#(<= main_~i~0 45), 20703#(<= main_~i~0 46), 20704#(<= main_~i~0 47), 20705#(<= main_~i~0 48), 20706#(<= main_~i~0 49), 20707#(<= main_~i~0 50), 20708#(<= main_~i~0 51)] [2018-02-02 10:35:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:03,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 10:35:03,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 10:35:03,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:35:03,331 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 54 states. [2018-02-02 10:35:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:03,871 INFO L93 Difference]: Finished difference Result 485 states and 535 transitions. [2018-02-02 10:35:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 10:35:03,872 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 224 [2018-02-02 10:35:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:03,873 INFO L225 Difference]: With dead ends: 485 [2018-02-02 10:35:03,873 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 10:35:03,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:35:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 10:35:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 229. [2018-02-02 10:35:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:35:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-02-02 10:35:03,876 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-02-02 10:35:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:03,877 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-02-02 10:35:03,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 10:35:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-02-02 10:35:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-02 10:35:03,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:03,877 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:03,877 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1048970126, now seen corresponding path program 51 times [2018-02-02 10:35:03,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:03,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:04,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:04,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 10:35:04,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:04,738 INFO L182 omatonBuilderFactory]: Interpolants [21423#true, 21424#false, 21425#(<= main_~i~0 0), 21426#(<= main_~i~0 1), 21427#(<= main_~i~0 2), 21428#(<= main_~i~0 3), 21429#(<= main_~i~0 4), 21430#(<= main_~i~0 5), 21431#(<= main_~i~0 6), 21432#(<= main_~i~0 7), 21433#(<= main_~i~0 8), 21434#(<= main_~i~0 9), 21435#(<= main_~i~0 10), 21436#(<= main_~i~0 11), 21437#(<= main_~i~0 12), 21438#(<= main_~i~0 13), 21439#(<= main_~i~0 14), 21440#(<= main_~i~0 15), 21441#(<= main_~i~0 16), 21442#(<= main_~i~0 17), 21443#(<= main_~i~0 18), 21444#(<= main_~i~0 19), 21445#(<= main_~i~0 20), 21446#(<= main_~i~0 21), 21447#(<= main_~i~0 22), 21448#(<= main_~i~0 23), 21449#(<= main_~i~0 24), 21450#(<= main_~i~0 25), 21451#(<= main_~i~0 26), 21452#(<= main_~i~0 27), 21453#(<= main_~i~0 28), 21454#(<= main_~i~0 29), 21455#(<= main_~i~0 30), 21456#(<= main_~i~0 31), 21457#(<= main_~i~0 32), 21458#(<= main_~i~0 33), 21459#(<= main_~i~0 34), 21460#(<= main_~i~0 35), 21461#(<= main_~i~0 36), 21462#(<= main_~i~0 37), 21463#(<= main_~i~0 38), 21464#(<= main_~i~0 39), 21465#(<= main_~i~0 40), 21466#(<= main_~i~0 41), 21467#(<= main_~i~0 42), 21468#(<= main_~i~0 43), 21469#(<= main_~i~0 44), 21470#(<= main_~i~0 45), 21471#(<= main_~i~0 46), 21472#(<= main_~i~0 47), 21473#(<= main_~i~0 48), 21474#(<= main_~i~0 49), 21475#(<= main_~i~0 50), 21476#(<= main_~i~0 51), 21477#(<= main_~i~0 52)] [2018-02-02 10:35:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:04,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 10:35:04,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 10:35:04,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:35:04,739 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 55 states. [2018-02-02 10:35:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:05,158 INFO L93 Difference]: Finished difference Result 494 states and 545 transitions. [2018-02-02 10:35:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 10:35:05,158 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-02-02 10:35:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:05,159 INFO L225 Difference]: With dead ends: 494 [2018-02-02 10:35:05,160 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 10:35:05,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:35:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 10:35:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 233. [2018-02-02 10:35:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:35:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-02-02 10:35:05,162 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-02-02 10:35:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:05,162 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-02-02 10:35:05,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 10:35:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-02-02 10:35:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 10:35:05,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:05,163 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:05,163 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1822501497, now seen corresponding path program 52 times [2018-02-02 10:35:05,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:05,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:05,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:05,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-02 10:35:05,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:05,987 INFO L182 omatonBuilderFactory]: Interpolants [22205#true, 22206#false, 22207#(<= main_~i~0 0), 22208#(<= main_~i~0 1), 22209#(<= main_~i~0 2), 22210#(<= main_~i~0 3), 22211#(<= main_~i~0 4), 22212#(<= main_~i~0 5), 22213#(<= main_~i~0 6), 22214#(<= main_~i~0 7), 22215#(<= main_~i~0 8), 22216#(<= main_~i~0 9), 22217#(<= main_~i~0 10), 22218#(<= main_~i~0 11), 22219#(<= main_~i~0 12), 22220#(<= main_~i~0 13), 22221#(<= main_~i~0 14), 22222#(<= main_~i~0 15), 22223#(<= main_~i~0 16), 22224#(<= main_~i~0 17), 22225#(<= main_~i~0 18), 22226#(<= main_~i~0 19), 22227#(<= main_~i~0 20), 22228#(<= main_~i~0 21), 22229#(<= main_~i~0 22), 22230#(<= main_~i~0 23), 22231#(<= main_~i~0 24), 22232#(<= main_~i~0 25), 22233#(<= main_~i~0 26), 22234#(<= main_~i~0 27), 22235#(<= main_~i~0 28), 22236#(<= main_~i~0 29), 22237#(<= main_~i~0 30), 22238#(<= main_~i~0 31), 22239#(<= main_~i~0 32), 22240#(<= main_~i~0 33), 22241#(<= main_~i~0 34), 22242#(<= main_~i~0 35), 22243#(<= main_~i~0 36), 22244#(<= main_~i~0 37), 22245#(<= main_~i~0 38), 22246#(<= main_~i~0 39), 22247#(<= main_~i~0 40), 22248#(<= main_~i~0 41), 22249#(<= main_~i~0 42), 22250#(<= main_~i~0 43), 22251#(<= main_~i~0 44), 22252#(<= main_~i~0 45), 22253#(<= main_~i~0 46), 22254#(<= main_~i~0 47), 22255#(<= main_~i~0 48), 22256#(<= main_~i~0 49), 22257#(<= main_~i~0 50), 22258#(<= main_~i~0 51), 22259#(<= main_~i~0 52), 22260#(<= main_~i~0 53)] [2018-02-02 10:35:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:05,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 10:35:05,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 10:35:05,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:35:05,988 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 56 states. [2018-02-02 10:35:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:06,471 INFO L93 Difference]: Finished difference Result 503 states and 555 transitions. [2018-02-02 10:35:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 10:35:06,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 232 [2018-02-02 10:35:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:06,473 INFO L225 Difference]: With dead ends: 503 [2018-02-02 10:35:06,473 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 10:35:06,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:35:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 10:35:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 237. [2018-02-02 10:35:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:35:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-02-02 10:35:06,476 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 232 [2018-02-02 10:35:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:06,476 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-02-02 10:35:06,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 10:35:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-02-02 10:35:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-02 10:35:06,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:06,478 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:06,478 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1260126976, now seen corresponding path program 53 times [2018-02-02 10:35:06,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:06,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:07,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:07,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 10:35:07,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:07,317 INFO L182 omatonBuilderFactory]: Interpolants [23040#(<= main_~i~0 37), 23041#(<= main_~i~0 38), 23042#(<= main_~i~0 39), 23043#(<= main_~i~0 40), 23044#(<= main_~i~0 41), 23045#(<= main_~i~0 42), 23046#(<= main_~i~0 43), 23047#(<= main_~i~0 44), 23048#(<= main_~i~0 45), 23049#(<= main_~i~0 46), 23050#(<= main_~i~0 47), 23051#(<= main_~i~0 48), 23052#(<= main_~i~0 49), 23053#(<= main_~i~0 50), 23054#(<= main_~i~0 51), 23055#(<= main_~i~0 52), 23056#(<= main_~i~0 53), 23057#(<= main_~i~0 54), 23001#true, 23002#false, 23003#(<= main_~i~0 0), 23004#(<= main_~i~0 1), 23005#(<= main_~i~0 2), 23006#(<= main_~i~0 3), 23007#(<= main_~i~0 4), 23008#(<= main_~i~0 5), 23009#(<= main_~i~0 6), 23010#(<= main_~i~0 7), 23011#(<= main_~i~0 8), 23012#(<= main_~i~0 9), 23013#(<= main_~i~0 10), 23014#(<= main_~i~0 11), 23015#(<= main_~i~0 12), 23016#(<= main_~i~0 13), 23017#(<= main_~i~0 14), 23018#(<= main_~i~0 15), 23019#(<= main_~i~0 16), 23020#(<= main_~i~0 17), 23021#(<= main_~i~0 18), 23022#(<= main_~i~0 19), 23023#(<= main_~i~0 20), 23024#(<= main_~i~0 21), 23025#(<= main_~i~0 22), 23026#(<= main_~i~0 23), 23027#(<= main_~i~0 24), 23028#(<= main_~i~0 25), 23029#(<= main_~i~0 26), 23030#(<= main_~i~0 27), 23031#(<= main_~i~0 28), 23032#(<= main_~i~0 29), 23033#(<= main_~i~0 30), 23034#(<= main_~i~0 31), 23035#(<= main_~i~0 32), 23036#(<= main_~i~0 33), 23037#(<= main_~i~0 34), 23038#(<= main_~i~0 35), 23039#(<= main_~i~0 36)] [2018-02-02 10:35:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:07,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 10:35:07,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 10:35:07,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:35:07,318 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 57 states. [2018-02-02 10:35:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:07,754 INFO L93 Difference]: Finished difference Result 512 states and 565 transitions. [2018-02-02 10:35:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 10:35:07,754 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 236 [2018-02-02 10:35:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:07,755 INFO L225 Difference]: With dead ends: 512 [2018-02-02 10:35:07,755 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 10:35:07,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:35:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 10:35:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 241. [2018-02-02 10:35:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 10:35:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-02-02 10:35:07,757 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-02-02 10:35:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:07,757 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-02-02 10:35:07,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 10:35:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-02-02 10:35:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-02 10:35:07,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:07,758 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:07,758 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1562627065, now seen corresponding path program 54 times [2018-02-02 10:35:07,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:07,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:08,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:08,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-02 10:35:08,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:08,615 INFO L182 omatonBuilderFactory]: Interpolants [23811#true, 23812#false, 23813#(<= main_~i~0 0), 23814#(<= main_~i~0 1), 23815#(<= main_~i~0 2), 23816#(<= main_~i~0 3), 23817#(<= main_~i~0 4), 23818#(<= main_~i~0 5), 23819#(<= main_~i~0 6), 23820#(<= main_~i~0 7), 23821#(<= main_~i~0 8), 23822#(<= main_~i~0 9), 23823#(<= main_~i~0 10), 23824#(<= main_~i~0 11), 23825#(<= main_~i~0 12), 23826#(<= main_~i~0 13), 23827#(<= main_~i~0 14), 23828#(<= main_~i~0 15), 23829#(<= main_~i~0 16), 23830#(<= main_~i~0 17), 23831#(<= main_~i~0 18), 23832#(<= main_~i~0 19), 23833#(<= main_~i~0 20), 23834#(<= main_~i~0 21), 23835#(<= main_~i~0 22), 23836#(<= main_~i~0 23), 23837#(<= main_~i~0 24), 23838#(<= main_~i~0 25), 23839#(<= main_~i~0 26), 23840#(<= main_~i~0 27), 23841#(<= main_~i~0 28), 23842#(<= main_~i~0 29), 23843#(<= main_~i~0 30), 23844#(<= main_~i~0 31), 23845#(<= main_~i~0 32), 23846#(<= main_~i~0 33), 23847#(<= main_~i~0 34), 23848#(<= main_~i~0 35), 23849#(<= main_~i~0 36), 23850#(<= main_~i~0 37), 23851#(<= main_~i~0 38), 23852#(<= main_~i~0 39), 23853#(<= main_~i~0 40), 23854#(<= main_~i~0 41), 23855#(<= main_~i~0 42), 23856#(<= main_~i~0 43), 23857#(<= main_~i~0 44), 23858#(<= main_~i~0 45), 23859#(<= main_~i~0 46), 23860#(<= main_~i~0 47), 23861#(<= main_~i~0 48), 23862#(<= main_~i~0 49), 23863#(<= main_~i~0 50), 23864#(<= main_~i~0 51), 23865#(<= main_~i~0 52), 23866#(<= main_~i~0 53), 23867#(<= main_~i~0 54), 23868#(<= main_~i~0 55)] [2018-02-02 10:35:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:08,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 10:35:08,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 10:35:08,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:35:08,616 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 58 states. [2018-02-02 10:35:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:09,163 INFO L93 Difference]: Finished difference Result 521 states and 575 transitions. [2018-02-02 10:35:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 10:35:09,163 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 240 [2018-02-02 10:35:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:09,164 INFO L225 Difference]: With dead ends: 521 [2018-02-02 10:35:09,164 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 10:35:09,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:35:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 10:35:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 245. [2018-02-02 10:35:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 10:35:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-02-02 10:35:09,166 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 240 [2018-02-02 10:35:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:09,166 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-02-02 10:35:09,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 10:35:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-02-02 10:35:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-02-02 10:35:09,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:09,168 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:09,168 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash 599552114, now seen corresponding path program 55 times [2018-02-02 10:35:09,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:09,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:10,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:10,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 10:35:10,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:10,059 INFO L182 omatonBuilderFactory]: Interpolants [24635#true, 24636#false, 24637#(<= main_~i~0 0), 24638#(<= main_~i~0 1), 24639#(<= main_~i~0 2), 24640#(<= main_~i~0 3), 24641#(<= main_~i~0 4), 24642#(<= main_~i~0 5), 24643#(<= main_~i~0 6), 24644#(<= main_~i~0 7), 24645#(<= main_~i~0 8), 24646#(<= main_~i~0 9), 24647#(<= main_~i~0 10), 24648#(<= main_~i~0 11), 24649#(<= main_~i~0 12), 24650#(<= main_~i~0 13), 24651#(<= main_~i~0 14), 24652#(<= main_~i~0 15), 24653#(<= main_~i~0 16), 24654#(<= main_~i~0 17), 24655#(<= main_~i~0 18), 24656#(<= main_~i~0 19), 24657#(<= main_~i~0 20), 24658#(<= main_~i~0 21), 24659#(<= main_~i~0 22), 24660#(<= main_~i~0 23), 24661#(<= main_~i~0 24), 24662#(<= main_~i~0 25), 24663#(<= main_~i~0 26), 24664#(<= main_~i~0 27), 24665#(<= main_~i~0 28), 24666#(<= main_~i~0 29), 24667#(<= main_~i~0 30), 24668#(<= main_~i~0 31), 24669#(<= main_~i~0 32), 24670#(<= main_~i~0 33), 24671#(<= main_~i~0 34), 24672#(<= main_~i~0 35), 24673#(<= main_~i~0 36), 24674#(<= main_~i~0 37), 24675#(<= main_~i~0 38), 24676#(<= main_~i~0 39), 24677#(<= main_~i~0 40), 24678#(<= main_~i~0 41), 24679#(<= main_~i~0 42), 24680#(<= main_~i~0 43), 24681#(<= main_~i~0 44), 24682#(<= main_~i~0 45), 24683#(<= main_~i~0 46), 24684#(<= main_~i~0 47), 24685#(<= main_~i~0 48), 24686#(<= main_~i~0 49), 24687#(<= main_~i~0 50), 24688#(<= main_~i~0 51), 24689#(<= main_~i~0 52), 24690#(<= main_~i~0 53), 24691#(<= main_~i~0 54), 24692#(<= main_~i~0 55), 24693#(<= main_~i~0 56)] [2018-02-02 10:35:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:10,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 10:35:10,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 10:35:10,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:35:10,060 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 59 states. [2018-02-02 10:35:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:10,632 INFO L93 Difference]: Finished difference Result 530 states and 585 transitions. [2018-02-02 10:35:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 10:35:10,632 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 244 [2018-02-02 10:35:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:10,633 INFO L225 Difference]: With dead ends: 530 [2018-02-02 10:35:10,633 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 10:35:10,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:35:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 10:35:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 249. [2018-02-02 10:35:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 10:35:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-02-02 10:35:10,636 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-02-02 10:35:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:10,636 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-02-02 10:35:10,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 10:35:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-02-02 10:35:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-02 10:35:10,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:10,636 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:10,637 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash -334745493, now seen corresponding path program 56 times [2018-02-02 10:35:10,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:10,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:11,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:11,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-02 10:35:11,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:11,512 INFO L182 omatonBuilderFactory]: Interpolants [25473#true, 25474#false, 25475#(<= main_~i~0 0), 25476#(<= main_~i~0 1), 25477#(<= main_~i~0 2), 25478#(<= main_~i~0 3), 25479#(<= main_~i~0 4), 25480#(<= main_~i~0 5), 25481#(<= main_~i~0 6), 25482#(<= main_~i~0 7), 25483#(<= main_~i~0 8), 25484#(<= main_~i~0 9), 25485#(<= main_~i~0 10), 25486#(<= main_~i~0 11), 25487#(<= main_~i~0 12), 25488#(<= main_~i~0 13), 25489#(<= main_~i~0 14), 25490#(<= main_~i~0 15), 25491#(<= main_~i~0 16), 25492#(<= main_~i~0 17), 25493#(<= main_~i~0 18), 25494#(<= main_~i~0 19), 25495#(<= main_~i~0 20), 25496#(<= main_~i~0 21), 25497#(<= main_~i~0 22), 25498#(<= main_~i~0 23), 25499#(<= main_~i~0 24), 25500#(<= main_~i~0 25), 25501#(<= main_~i~0 26), 25502#(<= main_~i~0 27), 25503#(<= main_~i~0 28), 25504#(<= main_~i~0 29), 25505#(<= main_~i~0 30), 25506#(<= main_~i~0 31), 25507#(<= main_~i~0 32), 25508#(<= main_~i~0 33), 25509#(<= main_~i~0 34), 25510#(<= main_~i~0 35), 25511#(<= main_~i~0 36), 25512#(<= main_~i~0 37), 25513#(<= main_~i~0 38), 25514#(<= main_~i~0 39), 25515#(<= main_~i~0 40), 25516#(<= main_~i~0 41), 25517#(<= main_~i~0 42), 25518#(<= main_~i~0 43), 25519#(<= main_~i~0 44), 25520#(<= main_~i~0 45), 25521#(<= main_~i~0 46), 25522#(<= main_~i~0 47), 25523#(<= main_~i~0 48), 25524#(<= main_~i~0 49), 25525#(<= main_~i~0 50), 25526#(<= main_~i~0 51), 25527#(<= main_~i~0 52), 25528#(<= main_~i~0 53), 25529#(<= main_~i~0 54), 25530#(<= main_~i~0 55), 25531#(<= main_~i~0 56), 25532#(<= main_~i~0 57)] [2018-02-02 10:35:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:11,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 10:35:11,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 10:35:11,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:35:11,513 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 60 states. [2018-02-02 10:35:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:12,088 INFO L93 Difference]: Finished difference Result 539 states and 595 transitions. [2018-02-02 10:35:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 10:35:12,088 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 248 [2018-02-02 10:35:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:12,089 INFO L225 Difference]: With dead ends: 539 [2018-02-02 10:35:12,089 INFO L226 Difference]: Without dead ends: 539 [2018-02-02 10:35:12,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:35:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-02 10:35:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 253. [2018-02-02 10:35:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:35:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-02-02 10:35:12,092 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 248 [2018-02-02 10:35:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:12,093 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-02-02 10:35:12,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 10:35:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-02-02 10:35:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-02 10:35:12,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:12,093 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:12,093 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2045162524, now seen corresponding path program 57 times [2018-02-02 10:35:12,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:12,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:13,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:13,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 10:35:13,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:13,027 INFO L182 omatonBuilderFactory]: Interpolants [26368#(<= main_~i~0 41), 26369#(<= main_~i~0 42), 26370#(<= main_~i~0 43), 26371#(<= main_~i~0 44), 26372#(<= main_~i~0 45), 26373#(<= main_~i~0 46), 26374#(<= main_~i~0 47), 26375#(<= main_~i~0 48), 26376#(<= main_~i~0 49), 26377#(<= main_~i~0 50), 26378#(<= main_~i~0 51), 26379#(<= main_~i~0 52), 26380#(<= main_~i~0 53), 26381#(<= main_~i~0 54), 26382#(<= main_~i~0 55), 26383#(<= main_~i~0 56), 26384#(<= main_~i~0 57), 26385#(<= main_~i~0 58), 26325#true, 26326#false, 26327#(<= main_~i~0 0), 26328#(<= main_~i~0 1), 26329#(<= main_~i~0 2), 26330#(<= main_~i~0 3), 26331#(<= main_~i~0 4), 26332#(<= main_~i~0 5), 26333#(<= main_~i~0 6), 26334#(<= main_~i~0 7), 26335#(<= main_~i~0 8), 26336#(<= main_~i~0 9), 26337#(<= main_~i~0 10), 26338#(<= main_~i~0 11), 26339#(<= main_~i~0 12), 26340#(<= main_~i~0 13), 26341#(<= main_~i~0 14), 26342#(<= main_~i~0 15), 26343#(<= main_~i~0 16), 26344#(<= main_~i~0 17), 26345#(<= main_~i~0 18), 26346#(<= main_~i~0 19), 26347#(<= main_~i~0 20), 26348#(<= main_~i~0 21), 26349#(<= main_~i~0 22), 26350#(<= main_~i~0 23), 26351#(<= main_~i~0 24), 26352#(<= main_~i~0 25), 26353#(<= main_~i~0 26), 26354#(<= main_~i~0 27), 26355#(<= main_~i~0 28), 26356#(<= main_~i~0 29), 26357#(<= main_~i~0 30), 26358#(<= main_~i~0 31), 26359#(<= main_~i~0 32), 26360#(<= main_~i~0 33), 26361#(<= main_~i~0 34), 26362#(<= main_~i~0 35), 26363#(<= main_~i~0 36), 26364#(<= main_~i~0 37), 26365#(<= main_~i~0 38), 26366#(<= main_~i~0 39), 26367#(<= main_~i~0 40)] [2018-02-02 10:35:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:13,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 10:35:13,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 10:35:13,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:35:13,027 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 61 states. [2018-02-02 10:35:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:13,523 INFO L93 Difference]: Finished difference Result 548 states and 605 transitions. [2018-02-02 10:35:13,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 10:35:13,523 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 252 [2018-02-02 10:35:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:13,524 INFO L225 Difference]: With dead ends: 548 [2018-02-02 10:35:13,524 INFO L226 Difference]: Without dead ends: 548 [2018-02-02 10:35:13,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:35:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-02 10:35:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 257. [2018-02-02 10:35:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:35:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-02-02 10:35:13,526 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-02-02 10:35:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:13,526 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-02-02 10:35:13,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 10:35:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-02-02 10:35:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-02-02 10:35:13,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:13,527 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:13,527 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash -724958499, now seen corresponding path program 58 times [2018-02-02 10:35:13,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:13,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:14,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:14,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-02 10:35:14,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:14,486 INFO L182 omatonBuilderFactory]: Interpolants [27191#true, 27192#false, 27193#(<= main_~i~0 0), 27194#(<= main_~i~0 1), 27195#(<= main_~i~0 2), 27196#(<= main_~i~0 3), 27197#(<= main_~i~0 4), 27198#(<= main_~i~0 5), 27199#(<= main_~i~0 6), 27200#(<= main_~i~0 7), 27201#(<= main_~i~0 8), 27202#(<= main_~i~0 9), 27203#(<= main_~i~0 10), 27204#(<= main_~i~0 11), 27205#(<= main_~i~0 12), 27206#(<= main_~i~0 13), 27207#(<= main_~i~0 14), 27208#(<= main_~i~0 15), 27209#(<= main_~i~0 16), 27210#(<= main_~i~0 17), 27211#(<= main_~i~0 18), 27212#(<= main_~i~0 19), 27213#(<= main_~i~0 20), 27214#(<= main_~i~0 21), 27215#(<= main_~i~0 22), 27216#(<= main_~i~0 23), 27217#(<= main_~i~0 24), 27218#(<= main_~i~0 25), 27219#(<= main_~i~0 26), 27220#(<= main_~i~0 27), 27221#(<= main_~i~0 28), 27222#(<= main_~i~0 29), 27223#(<= main_~i~0 30), 27224#(<= main_~i~0 31), 27225#(<= main_~i~0 32), 27226#(<= main_~i~0 33), 27227#(<= main_~i~0 34), 27228#(<= main_~i~0 35), 27229#(<= main_~i~0 36), 27230#(<= main_~i~0 37), 27231#(<= main_~i~0 38), 27232#(<= main_~i~0 39), 27233#(<= main_~i~0 40), 27234#(<= main_~i~0 41), 27235#(<= main_~i~0 42), 27236#(<= main_~i~0 43), 27237#(<= main_~i~0 44), 27238#(<= main_~i~0 45), 27239#(<= main_~i~0 46), 27240#(<= main_~i~0 47), 27241#(<= main_~i~0 48), 27242#(<= main_~i~0 49), 27243#(<= main_~i~0 50), 27244#(<= main_~i~0 51), 27245#(<= main_~i~0 52), 27246#(<= main_~i~0 53), 27247#(<= main_~i~0 54), 27248#(<= main_~i~0 55), 27249#(<= main_~i~0 56), 27250#(<= main_~i~0 57), 27251#(<= main_~i~0 58), 27252#(<= main_~i~0 59)] [2018-02-02 10:35:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:14,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 10:35:14,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 10:35:14,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:35:14,487 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 62 states. [2018-02-02 10:35:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:15,083 INFO L93 Difference]: Finished difference Result 557 states and 615 transitions. [2018-02-02 10:35:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 10:35:15,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 256 [2018-02-02 10:35:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:15,085 INFO L225 Difference]: With dead ends: 557 [2018-02-02 10:35:15,085 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 10:35:15,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:35:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 10:35:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 261. [2018-02-02 10:35:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:35:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-02-02 10:35:15,087 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 256 [2018-02-02 10:35:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:15,087 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-02-02 10:35:15,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 10:35:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-02-02 10:35:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-02-02 10:35:15,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:15,088 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:15,088 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1575261526, now seen corresponding path program 59 times [2018-02-02 10:35:15,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:15,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:16,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:16,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-02 10:35:16,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:16,062 INFO L182 omatonBuilderFactory]: Interpolants [28071#true, 28072#false, 28073#(<= main_~i~0 0), 28074#(<= main_~i~0 1), 28075#(<= main_~i~0 2), 28076#(<= main_~i~0 3), 28077#(<= main_~i~0 4), 28078#(<= main_~i~0 5), 28079#(<= main_~i~0 6), 28080#(<= main_~i~0 7), 28081#(<= main_~i~0 8), 28082#(<= main_~i~0 9), 28083#(<= main_~i~0 10), 28084#(<= main_~i~0 11), 28085#(<= main_~i~0 12), 28086#(<= main_~i~0 13), 28087#(<= main_~i~0 14), 28088#(<= main_~i~0 15), 28089#(<= main_~i~0 16), 28090#(<= main_~i~0 17), 28091#(<= main_~i~0 18), 28092#(<= main_~i~0 19), 28093#(<= main_~i~0 20), 28094#(<= main_~i~0 21), 28095#(<= main_~i~0 22), 28096#(<= main_~i~0 23), 28097#(<= main_~i~0 24), 28098#(<= main_~i~0 25), 28099#(<= main_~i~0 26), 28100#(<= main_~i~0 27), 28101#(<= main_~i~0 28), 28102#(<= main_~i~0 29), 28103#(<= main_~i~0 30), 28104#(<= main_~i~0 31), 28105#(<= main_~i~0 32), 28106#(<= main_~i~0 33), 28107#(<= main_~i~0 34), 28108#(<= main_~i~0 35), 28109#(<= main_~i~0 36), 28110#(<= main_~i~0 37), 28111#(<= main_~i~0 38), 28112#(<= main_~i~0 39), 28113#(<= main_~i~0 40), 28114#(<= main_~i~0 41), 28115#(<= main_~i~0 42), 28116#(<= main_~i~0 43), 28117#(<= main_~i~0 44), 28118#(<= main_~i~0 45), 28119#(<= main_~i~0 46), 28120#(<= main_~i~0 47), 28121#(<= main_~i~0 48), 28122#(<= main_~i~0 49), 28123#(<= main_~i~0 50), 28124#(<= main_~i~0 51), 28125#(<= main_~i~0 52), 28126#(<= main_~i~0 53), 28127#(<= main_~i~0 54), 28128#(<= main_~i~0 55), 28129#(<= main_~i~0 56), 28130#(<= main_~i~0 57), 28131#(<= main_~i~0 58), 28132#(<= main_~i~0 59), 28133#(<= main_~i~0 60)] [2018-02-02 10:35:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:16,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 10:35:16,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 10:35:16,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:35:16,063 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 63 states. [2018-02-02 10:35:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:16,648 INFO L93 Difference]: Finished difference Result 566 states and 625 transitions. [2018-02-02 10:35:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 10:35:16,649 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 260 [2018-02-02 10:35:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:16,650 INFO L225 Difference]: With dead ends: 566 [2018-02-02 10:35:16,650 INFO L226 Difference]: Without dead ends: 566 [2018-02-02 10:35:16,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:35:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-02 10:35:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 265. [2018-02-02 10:35:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:35:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-02-02 10:35:16,652 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-02-02 10:35:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:16,652 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-02-02 10:35:16,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 10:35:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-02-02 10:35:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-02-02 10:35:16,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:16,653 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:16,653 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash -636533937, now seen corresponding path program 60 times [2018-02-02 10:35:16,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:16,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:17,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:17,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-02 10:35:17,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:17,689 INFO L182 omatonBuilderFactory]: Interpolants [28965#true, 28966#false, 28967#(<= main_~i~0 0), 28968#(<= main_~i~0 1), 28969#(<= main_~i~0 2), 28970#(<= main_~i~0 3), 28971#(<= main_~i~0 4), 28972#(<= main_~i~0 5), 28973#(<= main_~i~0 6), 28974#(<= main_~i~0 7), 28975#(<= main_~i~0 8), 28976#(<= main_~i~0 9), 28977#(<= main_~i~0 10), 28978#(<= main_~i~0 11), 28979#(<= main_~i~0 12), 28980#(<= main_~i~0 13), 28981#(<= main_~i~0 14), 28982#(<= main_~i~0 15), 28983#(<= main_~i~0 16), 28984#(<= main_~i~0 17), 28985#(<= main_~i~0 18), 28986#(<= main_~i~0 19), 28987#(<= main_~i~0 20), 28988#(<= main_~i~0 21), 28989#(<= main_~i~0 22), 28990#(<= main_~i~0 23), 28991#(<= main_~i~0 24), 28992#(<= main_~i~0 25), 28993#(<= main_~i~0 26), 28994#(<= main_~i~0 27), 28995#(<= main_~i~0 28), 28996#(<= main_~i~0 29), 28997#(<= main_~i~0 30), 28998#(<= main_~i~0 31), 28999#(<= main_~i~0 32), 29000#(<= main_~i~0 33), 29001#(<= main_~i~0 34), 29002#(<= main_~i~0 35), 29003#(<= main_~i~0 36), 29004#(<= main_~i~0 37), 29005#(<= main_~i~0 38), 29006#(<= main_~i~0 39), 29007#(<= main_~i~0 40), 29008#(<= main_~i~0 41), 29009#(<= main_~i~0 42), 29010#(<= main_~i~0 43), 29011#(<= main_~i~0 44), 29012#(<= main_~i~0 45), 29013#(<= main_~i~0 46), 29014#(<= main_~i~0 47), 29015#(<= main_~i~0 48), 29016#(<= main_~i~0 49), 29017#(<= main_~i~0 50), 29018#(<= main_~i~0 51), 29019#(<= main_~i~0 52), 29020#(<= main_~i~0 53), 29021#(<= main_~i~0 54), 29022#(<= main_~i~0 55), 29023#(<= main_~i~0 56), 29024#(<= main_~i~0 57), 29025#(<= main_~i~0 58), 29026#(<= main_~i~0 59), 29027#(<= main_~i~0 60), 29028#(<= main_~i~0 61)] [2018-02-02 10:35:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:17,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-02 10:35:17,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-02 10:35:17,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:35:17,690 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 64 states. [2018-02-02 10:35:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:18,344 INFO L93 Difference]: Finished difference Result 575 states and 635 transitions. [2018-02-02 10:35:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-02 10:35:18,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 264 [2018-02-02 10:35:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:18,345 INFO L225 Difference]: With dead ends: 575 [2018-02-02 10:35:18,345 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 10:35:18,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:35:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 10:35:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 269. [2018-02-02 10:35:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:35:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-02-02 10:35:18,347 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-02-02 10:35:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:18,347 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-02-02 10:35:18,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-02 10:35:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-02-02 10:35:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-02-02 10:35:18,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:18,348 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:18,348 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:18,348 INFO L82 PathProgramCache]: Analyzing trace with hash -992981816, now seen corresponding path program 61 times [2018-02-02 10:35:18,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:18,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:19,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:19,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-02 10:35:19,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:19,406 INFO L182 omatonBuilderFactory]: Interpolants [29873#true, 29874#false, 29875#(<= main_~i~0 0), 29876#(<= main_~i~0 1), 29877#(<= main_~i~0 2), 29878#(<= main_~i~0 3), 29879#(<= main_~i~0 4), 29880#(<= main_~i~0 5), 29881#(<= main_~i~0 6), 29882#(<= main_~i~0 7), 29883#(<= main_~i~0 8), 29884#(<= main_~i~0 9), 29885#(<= main_~i~0 10), 29886#(<= main_~i~0 11), 29887#(<= main_~i~0 12), 29888#(<= main_~i~0 13), 29889#(<= main_~i~0 14), 29890#(<= main_~i~0 15), 29891#(<= main_~i~0 16), 29892#(<= main_~i~0 17), 29893#(<= main_~i~0 18), 29894#(<= main_~i~0 19), 29895#(<= main_~i~0 20), 29896#(<= main_~i~0 21), 29897#(<= main_~i~0 22), 29898#(<= main_~i~0 23), 29899#(<= main_~i~0 24), 29900#(<= main_~i~0 25), 29901#(<= main_~i~0 26), 29902#(<= main_~i~0 27), 29903#(<= main_~i~0 28), 29904#(<= main_~i~0 29), 29905#(<= main_~i~0 30), 29906#(<= main_~i~0 31), 29907#(<= main_~i~0 32), 29908#(<= main_~i~0 33), 29909#(<= main_~i~0 34), 29910#(<= main_~i~0 35), 29911#(<= main_~i~0 36), 29912#(<= main_~i~0 37), 29913#(<= main_~i~0 38), 29914#(<= main_~i~0 39), 29915#(<= main_~i~0 40), 29916#(<= main_~i~0 41), 29917#(<= main_~i~0 42), 29918#(<= main_~i~0 43), 29919#(<= main_~i~0 44), 29920#(<= main_~i~0 45), 29921#(<= main_~i~0 46), 29922#(<= main_~i~0 47), 29923#(<= main_~i~0 48), 29924#(<= main_~i~0 49), 29925#(<= main_~i~0 50), 29926#(<= main_~i~0 51), 29927#(<= main_~i~0 52), 29928#(<= main_~i~0 53), 29929#(<= main_~i~0 54), 29930#(<= main_~i~0 55), 29931#(<= main_~i~0 56), 29932#(<= main_~i~0 57), 29933#(<= main_~i~0 58), 29934#(<= main_~i~0 59), 29935#(<= main_~i~0 60), 29936#(<= main_~i~0 61), 29937#(<= main_~i~0 62)] [2018-02-02 10:35:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:19,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-02 10:35:19,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-02 10:35:19,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:35:19,407 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 65 states. [2018-02-02 10:35:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:20,080 INFO L93 Difference]: Finished difference Result 584 states and 645 transitions. [2018-02-02 10:35:20,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 10:35:20,080 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 268 [2018-02-02 10:35:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:20,081 INFO L225 Difference]: With dead ends: 584 [2018-02-02 10:35:20,081 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 10:35:20,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:35:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 10:35:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 273. [2018-02-02 10:35:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:35:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-02-02 10:35:20,083 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-02-02 10:35:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:20,084 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-02-02 10:35:20,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-02 10:35:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-02-02 10:35:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-02 10:35:20,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:20,084 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:20,084 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash -326241855, now seen corresponding path program 62 times [2018-02-02 10:35:20,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:20,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:21,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:21,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-02 10:35:21,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:21,178 INFO L182 omatonBuilderFactory]: Interpolants [30848#(<= main_~i~0 51), 30849#(<= main_~i~0 52), 30850#(<= main_~i~0 53), 30851#(<= main_~i~0 54), 30852#(<= main_~i~0 55), 30853#(<= main_~i~0 56), 30854#(<= main_~i~0 57), 30855#(<= main_~i~0 58), 30856#(<= main_~i~0 59), 30857#(<= main_~i~0 60), 30858#(<= main_~i~0 61), 30859#(<= main_~i~0 62), 30860#(<= main_~i~0 63), 30795#true, 30796#false, 30797#(<= main_~i~0 0), 30798#(<= main_~i~0 1), 30799#(<= main_~i~0 2), 30800#(<= main_~i~0 3), 30801#(<= main_~i~0 4), 30802#(<= main_~i~0 5), 30803#(<= main_~i~0 6), 30804#(<= main_~i~0 7), 30805#(<= main_~i~0 8), 30806#(<= main_~i~0 9), 30807#(<= main_~i~0 10), 30808#(<= main_~i~0 11), 30809#(<= main_~i~0 12), 30810#(<= main_~i~0 13), 30811#(<= main_~i~0 14), 30812#(<= main_~i~0 15), 30813#(<= main_~i~0 16), 30814#(<= main_~i~0 17), 30815#(<= main_~i~0 18), 30816#(<= main_~i~0 19), 30817#(<= main_~i~0 20), 30818#(<= main_~i~0 21), 30819#(<= main_~i~0 22), 30820#(<= main_~i~0 23), 30821#(<= main_~i~0 24), 30822#(<= main_~i~0 25), 30823#(<= main_~i~0 26), 30824#(<= main_~i~0 27), 30825#(<= main_~i~0 28), 30826#(<= main_~i~0 29), 30827#(<= main_~i~0 30), 30828#(<= main_~i~0 31), 30829#(<= main_~i~0 32), 30830#(<= main_~i~0 33), 30831#(<= main_~i~0 34), 30832#(<= main_~i~0 35), 30833#(<= main_~i~0 36), 30834#(<= main_~i~0 37), 30835#(<= main_~i~0 38), 30836#(<= main_~i~0 39), 30837#(<= main_~i~0 40), 30838#(<= main_~i~0 41), 30839#(<= main_~i~0 42), 30840#(<= main_~i~0 43), 30841#(<= main_~i~0 44), 30842#(<= main_~i~0 45), 30843#(<= main_~i~0 46), 30844#(<= main_~i~0 47), 30845#(<= main_~i~0 48), 30846#(<= main_~i~0 49), 30847#(<= main_~i~0 50)] [2018-02-02 10:35:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:21,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-02 10:35:21,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-02 10:35:21,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:35:21,179 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 66 states. [2018-02-02 10:35:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:21,845 INFO L93 Difference]: Finished difference Result 593 states and 655 transitions. [2018-02-02 10:35:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 10:35:21,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 272 [2018-02-02 10:35:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:21,846 INFO L225 Difference]: With dead ends: 593 [2018-02-02 10:35:21,846 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 10:35:21,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:35:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 10:35:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 277. [2018-02-02 10:35:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:35:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-02-02 10:35:21,849 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 272 [2018-02-02 10:35:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:21,849 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-02-02 10:35:21,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-02 10:35:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-02-02 10:35:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-02-02 10:35:21,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:21,850 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:21,850 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 42889786, now seen corresponding path program 63 times [2018-02-02 10:35:21,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:21,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:22,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:22,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-02 10:35:22,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:22,939 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 11), 31745#(<= main_~i~0 12), 31746#(<= main_~i~0 13), 31747#(<= main_~i~0 14), 31748#(<= main_~i~0 15), 31749#(<= main_~i~0 16), 31750#(<= main_~i~0 17), 31751#(<= main_~i~0 18), 31752#(<= main_~i~0 19), 31753#(<= main_~i~0 20), 31754#(<= main_~i~0 21), 31755#(<= main_~i~0 22), 31756#(<= main_~i~0 23), 31757#(<= main_~i~0 24), 31758#(<= main_~i~0 25), 31759#(<= main_~i~0 26), 31760#(<= main_~i~0 27), 31761#(<= main_~i~0 28), 31762#(<= main_~i~0 29), 31763#(<= main_~i~0 30), 31764#(<= main_~i~0 31), 31765#(<= main_~i~0 32), 31766#(<= main_~i~0 33), 31767#(<= main_~i~0 34), 31768#(<= main_~i~0 35), 31769#(<= main_~i~0 36), 31770#(<= main_~i~0 37), 31771#(<= main_~i~0 38), 31772#(<= main_~i~0 39), 31773#(<= main_~i~0 40), 31774#(<= main_~i~0 41), 31775#(<= main_~i~0 42), 31776#(<= main_~i~0 43), 31777#(<= main_~i~0 44), 31778#(<= main_~i~0 45), 31779#(<= main_~i~0 46), 31780#(<= main_~i~0 47), 31781#(<= main_~i~0 48), 31782#(<= main_~i~0 49), 31783#(<= main_~i~0 50), 31784#(<= main_~i~0 51), 31785#(<= main_~i~0 52), 31786#(<= main_~i~0 53), 31787#(<= main_~i~0 54), 31788#(<= main_~i~0 55), 31789#(<= main_~i~0 56), 31790#(<= main_~i~0 57), 31791#(<= main_~i~0 58), 31792#(<= main_~i~0 59), 31793#(<= main_~i~0 60), 31794#(<= main_~i~0 61), 31795#(<= main_~i~0 62), 31796#(<= main_~i~0 63), 31797#(<= main_~i~0 64), 31731#true, 31732#false, 31733#(<= main_~i~0 0), 31734#(<= main_~i~0 1), 31735#(<= main_~i~0 2), 31736#(<= main_~i~0 3), 31737#(<= main_~i~0 4), 31738#(<= main_~i~0 5), 31739#(<= main_~i~0 6), 31740#(<= main_~i~0 7), 31741#(<= main_~i~0 8), 31742#(<= main_~i~0 9), 31743#(<= main_~i~0 10)] [2018-02-02 10:35:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:22,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-02 10:35:22,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-02 10:35:22,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 10:35:22,940 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 67 states. [2018-02-02 10:35:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:23,751 INFO L93 Difference]: Finished difference Result 602 states and 665 transitions. [2018-02-02 10:35:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-02 10:35:23,751 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 276 [2018-02-02 10:35:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:23,753 INFO L225 Difference]: With dead ends: 602 [2018-02-02 10:35:23,753 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 10:35:23,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 10:35:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 10:35:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 281. [2018-02-02 10:35:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:35:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-02-02 10:35:23,755 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-02-02 10:35:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:23,756 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-02-02 10:35:23,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-02 10:35:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-02-02 10:35:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-02-02 10:35:23,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:23,756 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:23,757 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 720899635, now seen corresponding path program 64 times [2018-02-02 10:35:23,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:23,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:24,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:24,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-02 10:35:24,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:24,884 INFO L182 omatonBuilderFactory]: Interpolants [32681#true, 32682#false, 32683#(<= main_~i~0 0), 32684#(<= main_~i~0 1), 32685#(<= main_~i~0 2), 32686#(<= main_~i~0 3), 32687#(<= main_~i~0 4), 32688#(<= main_~i~0 5), 32689#(<= main_~i~0 6), 32690#(<= main_~i~0 7), 32691#(<= main_~i~0 8), 32692#(<= main_~i~0 9), 32693#(<= main_~i~0 10), 32694#(<= main_~i~0 11), 32695#(<= main_~i~0 12), 32696#(<= main_~i~0 13), 32697#(<= main_~i~0 14), 32698#(<= main_~i~0 15), 32699#(<= main_~i~0 16), 32700#(<= main_~i~0 17), 32701#(<= main_~i~0 18), 32702#(<= main_~i~0 19), 32703#(<= main_~i~0 20), 32704#(<= main_~i~0 21), 32705#(<= main_~i~0 22), 32706#(<= main_~i~0 23), 32707#(<= main_~i~0 24), 32708#(<= main_~i~0 25), 32709#(<= main_~i~0 26), 32710#(<= main_~i~0 27), 32711#(<= main_~i~0 28), 32712#(<= main_~i~0 29), 32713#(<= main_~i~0 30), 32714#(<= main_~i~0 31), 32715#(<= main_~i~0 32), 32716#(<= main_~i~0 33), 32717#(<= main_~i~0 34), 32718#(<= main_~i~0 35), 32719#(<= main_~i~0 36), 32720#(<= main_~i~0 37), 32721#(<= main_~i~0 38), 32722#(<= main_~i~0 39), 32723#(<= main_~i~0 40), 32724#(<= main_~i~0 41), 32725#(<= main_~i~0 42), 32726#(<= main_~i~0 43), 32727#(<= main_~i~0 44), 32728#(<= main_~i~0 45), 32729#(<= main_~i~0 46), 32730#(<= main_~i~0 47), 32731#(<= main_~i~0 48), 32732#(<= main_~i~0 49), 32733#(<= main_~i~0 50), 32734#(<= main_~i~0 51), 32735#(<= main_~i~0 52), 32736#(<= main_~i~0 53), 32737#(<= main_~i~0 54), 32738#(<= main_~i~0 55), 32739#(<= main_~i~0 56), 32740#(<= main_~i~0 57), 32741#(<= main_~i~0 58), 32742#(<= main_~i~0 59), 32743#(<= main_~i~0 60), 32744#(<= main_~i~0 61), 32745#(<= main_~i~0 62), 32746#(<= main_~i~0 63), 32747#(<= main_~i~0 64), 32748#(<= main_~i~0 65)] [2018-02-02 10:35:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:24,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-02 10:35:24,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-02 10:35:24,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:35:24,885 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 68 states. [2018-02-02 10:35:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:25,623 INFO L93 Difference]: Finished difference Result 611 states and 675 transitions. [2018-02-02 10:35:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-02 10:35:25,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 280 [2018-02-02 10:35:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:25,624 INFO L225 Difference]: With dead ends: 611 [2018-02-02 10:35:25,625 INFO L226 Difference]: Without dead ends: 611 [2018-02-02 10:35:25,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:35:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-02 10:35:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 285. [2018-02-02 10:35:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 10:35:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-02-02 10:35:25,627 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 280 [2018-02-02 10:35:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:25,627 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-02-02 10:35:25,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-02 10:35:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-02-02 10:35:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-02-02 10:35:25,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:25,628 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:25,628 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1932458580, now seen corresponding path program 65 times [2018-02-02 10:35:25,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:25,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:26,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:26,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-02 10:35:26,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:26,853 INFO L182 omatonBuilderFactory]: Interpolants [33664#(<= main_~i~0 17), 33665#(<= main_~i~0 18), 33666#(<= main_~i~0 19), 33667#(<= main_~i~0 20), 33668#(<= main_~i~0 21), 33669#(<= main_~i~0 22), 33670#(<= main_~i~0 23), 33671#(<= main_~i~0 24), 33672#(<= main_~i~0 25), 33673#(<= main_~i~0 26), 33674#(<= main_~i~0 27), 33675#(<= main_~i~0 28), 33676#(<= main_~i~0 29), 33677#(<= main_~i~0 30), 33678#(<= main_~i~0 31), 33679#(<= main_~i~0 32), 33680#(<= main_~i~0 33), 33681#(<= main_~i~0 34), 33682#(<= main_~i~0 35), 33683#(<= main_~i~0 36), 33684#(<= main_~i~0 37), 33685#(<= main_~i~0 38), 33686#(<= main_~i~0 39), 33687#(<= main_~i~0 40), 33688#(<= main_~i~0 41), 33689#(<= main_~i~0 42), 33690#(<= main_~i~0 43), 33691#(<= main_~i~0 44), 33692#(<= main_~i~0 45), 33693#(<= main_~i~0 46), 33694#(<= main_~i~0 47), 33695#(<= main_~i~0 48), 33696#(<= main_~i~0 49), 33697#(<= main_~i~0 50), 33698#(<= main_~i~0 51), 33699#(<= main_~i~0 52), 33700#(<= main_~i~0 53), 33701#(<= main_~i~0 54), 33702#(<= main_~i~0 55), 33703#(<= main_~i~0 56), 33704#(<= main_~i~0 57), 33705#(<= main_~i~0 58), 33706#(<= main_~i~0 59), 33707#(<= main_~i~0 60), 33708#(<= main_~i~0 61), 33709#(<= main_~i~0 62), 33710#(<= main_~i~0 63), 33711#(<= main_~i~0 64), 33712#(<= main_~i~0 65), 33713#(<= main_~i~0 66), 33645#true, 33646#false, 33647#(<= main_~i~0 0), 33648#(<= main_~i~0 1), 33649#(<= main_~i~0 2), 33650#(<= main_~i~0 3), 33651#(<= main_~i~0 4), 33652#(<= main_~i~0 5), 33653#(<= main_~i~0 6), 33654#(<= main_~i~0 7), 33655#(<= main_~i~0 8), 33656#(<= main_~i~0 9), 33657#(<= main_~i~0 10), 33658#(<= main_~i~0 11), 33659#(<= main_~i~0 12), 33660#(<= main_~i~0 13), 33661#(<= main_~i~0 14), 33662#(<= main_~i~0 15), 33663#(<= main_~i~0 16)] [2018-02-02 10:35:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:26,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-02 10:35:26,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-02 10:35:26,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 10:35:26,854 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 69 states. [2018-02-02 10:35:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:27,568 INFO L93 Difference]: Finished difference Result 620 states and 685 transitions. [2018-02-02 10:35:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-02 10:35:27,568 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 284 [2018-02-02 10:35:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:27,569 INFO L225 Difference]: With dead ends: 620 [2018-02-02 10:35:27,569 INFO L226 Difference]: Without dead ends: 620 [2018-02-02 10:35:27,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 10:35:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-02-02 10:35:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 289. [2018-02-02 10:35:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 10:35:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-02-02 10:35:27,571 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-02-02 10:35:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:27,571 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-02-02 10:35:27,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-02 10:35:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-02-02 10:35:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-02 10:35:27,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:27,572 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:27,572 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -503342939, now seen corresponding path program 66 times [2018-02-02 10:35:27,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:27,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:28,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:28,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-02 10:35:28,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:28,799 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 63), 34689#(<= main_~i~0 64), 34690#(<= main_~i~0 65), 34691#(<= main_~i~0 66), 34692#(<= main_~i~0 67), 34623#true, 34624#false, 34625#(<= main_~i~0 0), 34626#(<= main_~i~0 1), 34627#(<= main_~i~0 2), 34628#(<= main_~i~0 3), 34629#(<= main_~i~0 4), 34630#(<= main_~i~0 5), 34631#(<= main_~i~0 6), 34632#(<= main_~i~0 7), 34633#(<= main_~i~0 8), 34634#(<= main_~i~0 9), 34635#(<= main_~i~0 10), 34636#(<= main_~i~0 11), 34637#(<= main_~i~0 12), 34638#(<= main_~i~0 13), 34639#(<= main_~i~0 14), 34640#(<= main_~i~0 15), 34641#(<= main_~i~0 16), 34642#(<= main_~i~0 17), 34643#(<= main_~i~0 18), 34644#(<= main_~i~0 19), 34645#(<= main_~i~0 20), 34646#(<= main_~i~0 21), 34647#(<= main_~i~0 22), 34648#(<= main_~i~0 23), 34649#(<= main_~i~0 24), 34650#(<= main_~i~0 25), 34651#(<= main_~i~0 26), 34652#(<= main_~i~0 27), 34653#(<= main_~i~0 28), 34654#(<= main_~i~0 29), 34655#(<= main_~i~0 30), 34656#(<= main_~i~0 31), 34657#(<= main_~i~0 32), 34658#(<= main_~i~0 33), 34659#(<= main_~i~0 34), 34660#(<= main_~i~0 35), 34661#(<= main_~i~0 36), 34662#(<= main_~i~0 37), 34663#(<= main_~i~0 38), 34664#(<= main_~i~0 39), 34665#(<= main_~i~0 40), 34666#(<= main_~i~0 41), 34667#(<= main_~i~0 42), 34668#(<= main_~i~0 43), 34669#(<= main_~i~0 44), 34670#(<= main_~i~0 45), 34671#(<= main_~i~0 46), 34672#(<= main_~i~0 47), 34673#(<= main_~i~0 48), 34674#(<= main_~i~0 49), 34675#(<= main_~i~0 50), 34676#(<= main_~i~0 51), 34677#(<= main_~i~0 52), 34678#(<= main_~i~0 53), 34679#(<= main_~i~0 54), 34680#(<= main_~i~0 55), 34681#(<= main_~i~0 56), 34682#(<= main_~i~0 57), 34683#(<= main_~i~0 58), 34684#(<= main_~i~0 59), 34685#(<= main_~i~0 60), 34686#(<= main_~i~0 61), 34687#(<= main_~i~0 62)] [2018-02-02 10:35:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:28,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-02 10:35:28,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-02 10:35:28,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:35:28,800 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 70 states. [2018-02-02 10:35:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:29,681 INFO L93 Difference]: Finished difference Result 629 states and 695 transitions. [2018-02-02 10:35:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-02 10:35:29,681 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 288 [2018-02-02 10:35:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:29,682 INFO L225 Difference]: With dead ends: 629 [2018-02-02 10:35:29,682 INFO L226 Difference]: Without dead ends: 629 [2018-02-02 10:35:29,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:35:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-02 10:35:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 293. [2018-02-02 10:35:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 10:35:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-02-02 10:35:29,685 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 288 [2018-02-02 10:35:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:29,685 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-02-02 10:35:29,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-02 10:35:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-02-02 10:35:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-02 10:35:29,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:29,686 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:29,686 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 122291998, now seen corresponding path program 67 times [2018-02-02 10:35:29,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:29,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:30,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:30,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-02 10:35:30,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:30,938 INFO L182 omatonBuilderFactory]: Interpolants [35615#true, 35616#false, 35617#(<= main_~i~0 0), 35618#(<= main_~i~0 1), 35619#(<= main_~i~0 2), 35620#(<= main_~i~0 3), 35621#(<= main_~i~0 4), 35622#(<= main_~i~0 5), 35623#(<= main_~i~0 6), 35624#(<= main_~i~0 7), 35625#(<= main_~i~0 8), 35626#(<= main_~i~0 9), 35627#(<= main_~i~0 10), 35628#(<= main_~i~0 11), 35629#(<= main_~i~0 12), 35630#(<= main_~i~0 13), 35631#(<= main_~i~0 14), 35632#(<= main_~i~0 15), 35633#(<= main_~i~0 16), 35634#(<= main_~i~0 17), 35635#(<= main_~i~0 18), 35636#(<= main_~i~0 19), 35637#(<= main_~i~0 20), 35638#(<= main_~i~0 21), 35639#(<= main_~i~0 22), 35640#(<= main_~i~0 23), 35641#(<= main_~i~0 24), 35642#(<= main_~i~0 25), 35643#(<= main_~i~0 26), 35644#(<= main_~i~0 27), 35645#(<= main_~i~0 28), 35646#(<= main_~i~0 29), 35647#(<= main_~i~0 30), 35648#(<= main_~i~0 31), 35649#(<= main_~i~0 32), 35650#(<= main_~i~0 33), 35651#(<= main_~i~0 34), 35652#(<= main_~i~0 35), 35653#(<= main_~i~0 36), 35654#(<= main_~i~0 37), 35655#(<= main_~i~0 38), 35656#(<= main_~i~0 39), 35657#(<= main_~i~0 40), 35658#(<= main_~i~0 41), 35659#(<= main_~i~0 42), 35660#(<= main_~i~0 43), 35661#(<= main_~i~0 44), 35662#(<= main_~i~0 45), 35663#(<= main_~i~0 46), 35664#(<= main_~i~0 47), 35665#(<= main_~i~0 48), 35666#(<= main_~i~0 49), 35667#(<= main_~i~0 50), 35668#(<= main_~i~0 51), 35669#(<= main_~i~0 52), 35670#(<= main_~i~0 53), 35671#(<= main_~i~0 54), 35672#(<= main_~i~0 55), 35673#(<= main_~i~0 56), 35674#(<= main_~i~0 57), 35675#(<= main_~i~0 58), 35676#(<= main_~i~0 59), 35677#(<= main_~i~0 60), 35678#(<= main_~i~0 61), 35679#(<= main_~i~0 62), 35680#(<= main_~i~0 63), 35681#(<= main_~i~0 64), 35682#(<= main_~i~0 65), 35683#(<= main_~i~0 66), 35684#(<= main_~i~0 67), 35685#(<= main_~i~0 68)] [2018-02-02 10:35:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:30,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-02 10:35:30,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-02 10:35:30,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 10:35:30,939 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 71 states. [2018-02-02 10:35:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:31,805 INFO L93 Difference]: Finished difference Result 638 states and 705 transitions. [2018-02-02 10:35:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-02 10:35:31,805 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 292 [2018-02-02 10:35:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:31,806 INFO L225 Difference]: With dead ends: 638 [2018-02-02 10:35:31,806 INFO L226 Difference]: Without dead ends: 638 [2018-02-02 10:35:31,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 10:35:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-02-02 10:35:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 297. [2018-02-02 10:35:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:35:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-02-02 10:35:31,809 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 292 [2018-02-02 10:35:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:31,809 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-02-02 10:35:31,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-02 10:35:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-02-02 10:35:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-02-02 10:35:31,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:31,810 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:31,810 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1940483817, now seen corresponding path program 68 times [2018-02-02 10:35:31,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:31,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:35:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:33,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:35:33,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-02 10:35:33,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:35:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:35:33,121 INFO L182 omatonBuilderFactory]: Interpolants [36621#true, 36622#false, 36623#(<= main_~i~0 0), 36624#(<= main_~i~0 1), 36625#(<= main_~i~0 2), 36626#(<= main_~i~0 3), 36627#(<= main_~i~0 4), 36628#(<= main_~i~0 5), 36629#(<= main_~i~0 6), 36630#(<= main_~i~0 7), 36631#(<= main_~i~0 8), 36632#(<= main_~i~0 9), 36633#(<= main_~i~0 10), 36634#(<= main_~i~0 11), 36635#(<= main_~i~0 12), 36636#(<= main_~i~0 13), 36637#(<= main_~i~0 14), 36638#(<= main_~i~0 15), 36639#(<= main_~i~0 16), 36640#(<= main_~i~0 17), 36641#(<= main_~i~0 18), 36642#(<= main_~i~0 19), 36643#(<= main_~i~0 20), 36644#(<= main_~i~0 21), 36645#(<= main_~i~0 22), 36646#(<= main_~i~0 23), 36647#(<= main_~i~0 24), 36648#(<= main_~i~0 25), 36649#(<= main_~i~0 26), 36650#(<= main_~i~0 27), 36651#(<= main_~i~0 28), 36652#(<= main_~i~0 29), 36653#(<= main_~i~0 30), 36654#(<= main_~i~0 31), 36655#(<= main_~i~0 32), 36656#(<= main_~i~0 33), 36657#(<= main_~i~0 34), 36658#(<= main_~i~0 35), 36659#(<= main_~i~0 36), 36660#(<= main_~i~0 37), 36661#(<= main_~i~0 38), 36662#(<= main_~i~0 39), 36663#(<= main_~i~0 40), 36664#(<= main_~i~0 41), 36665#(<= main_~i~0 42), 36666#(<= main_~i~0 43), 36667#(<= main_~i~0 44), 36668#(<= main_~i~0 45), 36669#(<= main_~i~0 46), 36670#(<= main_~i~0 47), 36671#(<= main_~i~0 48), 36672#(<= main_~i~0 49), 36673#(<= main_~i~0 50), 36674#(<= main_~i~0 51), 36675#(<= main_~i~0 52), 36676#(<= main_~i~0 53), 36677#(<= main_~i~0 54), 36678#(<= main_~i~0 55), 36679#(<= main_~i~0 56), 36680#(<= main_~i~0 57), 36681#(<= main_~i~0 58), 36682#(<= main_~i~0 59), 36683#(<= main_~i~0 60), 36684#(<= main_~i~0 61), 36685#(<= main_~i~0 62), 36686#(<= main_~i~0 63), 36687#(<= main_~i~0 64), 36688#(<= main_~i~0 65), 36689#(<= main_~i~0 66), 36690#(<= main_~i~0 67), 36691#(<= main_~i~0 68), 36692#(<= main_~i~0 69)] [2018-02-02 10:35:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:35:33,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-02 10:35:33,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-02 10:35:33,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:35:33,122 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 72 states. [2018-02-02 10:35:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:35:34,159 INFO L93 Difference]: Finished difference Result 647 states and 715 transitions. [2018-02-02 10:35:34,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-02 10:35:34,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 296 [2018-02-02 10:35:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:35:34,160 INFO L225 Difference]: With dead ends: 647 [2018-02-02 10:35:34,160 INFO L226 Difference]: Without dead ends: 647 [2018-02-02 10:35:34,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:35:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-02-02 10:35:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 301. [2018-02-02 10:35:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 10:35:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-02-02 10:35:34,163 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 296 [2018-02-02 10:35:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:35:34,163 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-02-02 10:35:34,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-02 10:35:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-02-02 10:35:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-02-02 10:35:34,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:35:34,164 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:35:34,164 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:35:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1135310480, now seen corresponding path program 69 times [2018-02-02 10:35:34,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:35:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:35:34,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:35:35,144 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:35:35,147 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:35:35,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:35:35 BoogieIcfgContainer [2018-02-02 10:35:35,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:35:35,148 INFO L168 Benchmark]: Toolchain (without parser) took 58592.65 ms. Allocated memory was 402.1 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 358.8 MB in the beginning and 895.2 MB in the end (delta: -536.4 MB). Peak memory consumption was 953.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:35:35,149 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:35:35,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.93 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 350.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:35:35,150 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 402.1 MB. Free memory is still 350.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:35:35,150 INFO L168 Benchmark]: RCFGBuilder took 128.07 ms. Allocated memory is still 402.1 MB. Free memory was 350.9 MB in the beginning and 336.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:35:35,150 INFO L168 Benchmark]: TraceAbstraction took 58317.14 ms. Allocated memory was 402.1 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 336.3 MB in the beginning and 895.2 MB in the end (delta: -558.9 MB). Peak memory consumption was 931.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:35:35,151 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 124.93 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 350.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 402.1 MB. Free memory is still 350.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 128.07 ms. Allocated memory is still 402.1 MB. Free memory was 350.9 MB in the beginning and 336.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58317.14 ms. Allocated memory was 402.1 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 336.3 MB in the beginning and 895.2 MB in the end (delta: -558.9 MB). Peak memory consumption was 931.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 301 with TraceHistMax 71, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 301 with TraceHistMax 71, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 58.2s OverallTime, 71 OverallIterations, 71 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 643 SDtfs, 17713 SDslu, 12675 SDs, 0 SdLazy, 21809 SolverSat, 6031 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2625 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 622/224410 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, 70 MinimizatonAttempts, 12139 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 11040 NumberOfCodeBlocks, 11040 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 10970 ConstructedInterpolants, 0 QuantifiedInterpolants, 6173688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 2 PerfectInterpolantSequences, 622/224410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-35-35-157.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-35-35-157.csv Completed graceful shutdown