java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:56:41,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:56:41,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:56:41,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:56:41,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:56:41,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:56:41,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:56:41,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:56:41,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:56:41,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:56:41,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:56:41,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:56:41,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:56:41,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:56:41,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:56:41,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:56:41,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:56:41,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:56:41,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:56:41,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:56:41,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:56:41,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:56:41,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:56:41,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:56:41,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:56:41,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:56:41,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:56:41,404 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:56:41,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:56:41,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:56:41,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:56:41,405 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 19:56:41,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:56:41,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:56:41,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:56:41,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:56:41,416 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:56:41,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:56:41,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:56:41,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:56:41,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:56:41,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:56:41,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:56:41,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:56:41,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:56:41,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:56:41,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:56:41,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:56:41,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:56:41,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:56:41,454 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:56:41,456 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:56:41,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:56:41,457 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:56:41,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i [2018-02-02 19:56:41,550 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:56:41,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:56:41,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:56:41,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:56:41,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:56:41,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2d29dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41, skipping insertion in model container [2018-02-02 19:56:41,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,568 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:56:41,578 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:56:41,664 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:56:41,673 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:56:41,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41 WrapperNode [2018-02-02 19:56:41,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:56:41,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:56:41,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:56:41,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:56:41,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (1/1) ... [2018-02-02 19:56:41,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:56:41,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:56:41,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:56:41,699 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:56:41,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (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 19:56:41,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:56:41,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:56:41,736 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 19:56:41,736 INFO L136 BoogieDeclarations]: Found implementation of procedure printEven [2018-02-02 19:56:41,736 INFO L136 BoogieDeclarations]: Found implementation of procedure printOdd [2018-02-02 19:56:41,737 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure printEven [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure printOdd [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:56:41,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:56:41,857 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:56:41,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:56:41 BoogieIcfgContainer [2018-02-02 19:56:41,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:56:41,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:56:41,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:56:41,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:56:41,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:56:41" (1/3) ... [2018-02-02 19:56:41,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5549308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:56:41, skipping insertion in model container [2018-02-02 19:56:41,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:56:41" (2/3) ... [2018-02-02 19:56:41,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5549308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:56:41, skipping insertion in model container [2018-02-02 19:56:41,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:56:41" (3/3) ... [2018-02-02 19:56:41,864 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-02-02 19:56:41,871 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:56:41,877 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-02-02 19:56:41,909 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:56:41,909 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:56:41,909 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:56:41,909 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:56:41,909 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:56:41,909 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:56:41,909 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:56:41,910 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:56:41,910 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:56:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-02-02 19:56:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 19:56:41,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:41,931 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:41,931 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash 529177341, now seen corresponding path program 1 times [2018-02-02 19:56:41,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:41,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:42,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 19:56:42,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:56:42,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:56:42,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:42,053 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 19:56:42,053 INFO L182 omatonBuilderFactory]: Interpolants [45#true, 46#false, 47#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-02 19:56:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:56:42,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:56:42,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:56:42,065 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-02-02 19:56:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:42,137 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-02 19:56:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:56:42,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-02 19:56:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:42,145 INFO L225 Difference]: With dead ends: 60 [2018-02-02 19:56:42,145 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 19:56:42,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:56:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 19:56:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-02 19:56:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:56:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-02-02 19:56:42,218 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-02-02 19:56:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:42,218 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-02-02 19:56:42,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:56:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-02-02 19:56:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:56:42,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:42,219 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:42,219 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2078569521, now seen corresponding path program 1 times [2018-02-02 19:56:42,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:42,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:42,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 19:56:42,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:42,277 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 19:56:42,277 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 157#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 19:56:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:56:42,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:56:42,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:56:42,279 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-02-02 19:56:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:42,378 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-02-02 19:56:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:56:42,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:56:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:42,379 INFO L225 Difference]: With dead ends: 66 [2018-02-02 19:56:42,379 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 19:56:42,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:56:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 19:56:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-02 19:56:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:56:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-02 19:56:42,386 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-02-02 19:56:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:42,387 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-02 19:56:42,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:56:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-02 19:56:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:56:42,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:42,388 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:42,388 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1794788925, now seen corresponding path program 2 times [2018-02-02 19:56:42,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:42,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:42,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 19:56:42,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:42,451 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 19:56:42,451 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 284#true, 285#false, 286#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 287#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 19:56:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:56:42,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:56:42,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:56:42,452 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-02-02 19:56:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:42,586 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-02 19:56:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:56:42,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 19:56:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:42,589 INFO L225 Difference]: With dead ends: 81 [2018-02-02 19:56:42,590 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 19:56:42,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:56:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 19:56:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-02-02 19:56:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:56:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 19:56:42,598 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-02-02 19:56:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:42,599 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 19:56:42,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:56:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 19:56:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:56:42,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:42,600 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:42,601 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -424025969, now seen corresponding path program 3 times [2018-02-02 19:56:42,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:42,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:42,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 19:56:42,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:42,670 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 19:56:42,670 INFO L182 omatonBuilderFactory]: Interpolants [448#(<= main_~i~0 2), 449#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 450#(and (<= main_~i~0 3) (<= 1 main_~i~0)), 444#true, 445#false, 446#(<= main_~i~0 0), 447#(<= main_~i~0 1)] [2018-02-02 19:56:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:56:42,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:56:42,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:56:42,671 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 7 states. [2018-02-02 19:56:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:42,829 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-02-02 19:56:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:56:42,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 19:56:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:42,831 INFO L225 Difference]: With dead ends: 96 [2018-02-02 19:56:42,831 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:56:42,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:56:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:56:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-02 19:56:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:56:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-02-02 19:56:42,837 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-02-02 19:56:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:42,838 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-02-02 19:56:42,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:56:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-02-02 19:56:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:56:42,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:42,839 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:42,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1714228867, now seen corresponding path program 4 times [2018-02-02 19:56:42,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:42,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:42,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 19:56:42,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:42,913 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 19:56:42,913 INFO L182 omatonBuilderFactory]: Interpolants [641#true, 642#false, 643#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 644#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 645#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 646#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 647#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-02-02 19:56:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:42,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:56:42,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:56:42,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:56:42,914 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 7 states. [2018-02-02 19:56:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:43,138 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-02-02 19:56:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:56:43,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 19:56:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:43,139 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:56:43,139 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 19:56:43,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:56:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 19:56:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-02-02 19:56:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 19:56:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-02-02 19:56:43,143 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-02-02 19:56:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:43,144 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-02-02 19:56:43,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:56:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-02-02 19:56:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:56:43,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:43,144 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:43,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash -771406513, now seen corresponding path program 5 times [2018-02-02 19:56:43,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:43,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:43,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 19:56:43,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:43,212 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 19:56:43,212 INFO L182 omatonBuilderFactory]: Interpolants [864#(<= main_~i~0 1), 865#(<= main_~i~0 2), 866#(<= main_~i~0 3), 867#(<= main_~i~0 4), 868#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 869#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 861#true, 862#false, 863#(<= main_~i~0 0)] [2018-02-02 19:56:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:56:43,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:56:43,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:56:43,213 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 9 states. [2018-02-02 19:56:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:43,397 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-02-02 19:56:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:56:43,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 19:56:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:43,398 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:56:43,398 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:56:43,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:56:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:56:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-02 19:56:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:56:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-02-02 19:56:43,406 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-02-02 19:56:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:43,406 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-02-02 19:56:43,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:56:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-02-02 19:56:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:56:43,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:43,407 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:43,408 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:43,408 INFO L82 PathProgramCache]: Analyzing trace with hash -240614211, now seen corresponding path program 6 times [2018-02-02 19:56:43,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:43,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:43,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 19:56:43,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:43,490 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 19:56:43,490 INFO L182 omatonBuilderFactory]: Interpolants [1122#true, 1123#false, 1124#(<= main_~i~0 0), 1125#(<= main_~i~0 1), 1126#(<= main_~i~0 2), 1127#(<= main_~i~0 3), 1128#(<= main_~i~0 4), 1129#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1130#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1131#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-02-02 19:56:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:56:43,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:56:43,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:56:43,491 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 10 states. [2018-02-02 19:56:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:43,666 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-02-02 19:56:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:56:43,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 19:56:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:43,667 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:56:43,667 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:56:43,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:56:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:56:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-02 19:56:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 19:56:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-02-02 19:56:43,675 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-02-02 19:56:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:43,675 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-02-02 19:56:43,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:56:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-02-02 19:56:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:56:43,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:43,676 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:43,676 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:43,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1558821391, now seen corresponding path program 7 times [2018-02-02 19:56:43,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:43,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:43,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:56:43,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:43,755 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 19:56:43,755 INFO L182 omatonBuilderFactory]: Interpolants [1424#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1425#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 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)] [2018-02-02 19:56:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:43,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:56:43,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:56:43,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:56:43,756 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-02-02 19:56:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:43,947 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-02-02 19:56:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:56:43,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-02 19:56:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:43,948 INFO L225 Difference]: With dead ends: 156 [2018-02-02 19:56:43,948 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 19:56:43,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:56:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 19:56:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-02 19:56:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 19:56:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-02-02 19:56:43,954 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-02-02 19:56:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:43,954 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-02-02 19:56:43,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:56:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-02-02 19:56:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:56:43,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:43,955 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:43,955 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash -821098499, now seen corresponding path program 8 times [2018-02-02 19:56:43,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:43,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:44,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:44,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:56:44,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:44,090 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 19:56:44,090 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1745#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1746#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1747#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1748#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1749#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1750#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 1740#true, 1741#false, 1742#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1743#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 19:56:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:44,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:56:44,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:56:44,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:56:44,091 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-02-02 19:56:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:44,697 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-02-02 19:56:44,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:56:44,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 19:56:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:44,699 INFO L225 Difference]: With dead ends: 171 [2018-02-02 19:56:44,699 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 19:56:44,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:56:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 19:56:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-02 19:56:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 19:56:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-02-02 19:56:44,706 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-02-02 19:56:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:44,706 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-02-02 19:56:44,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:56:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-02-02 19:56:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 19:56:44,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:44,708 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:44,711 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash -413974833, now seen corresponding path program 9 times [2018-02-02 19:56:44,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:44,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:44,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:44,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 19:56:44,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:44,809 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 19:56:44,810 INFO L182 omatonBuilderFactory]: Interpolants [2080#true, 2081#false, 2082#(<= main_~i~0 0), 2083#(<= main_~i~0 1), 2084#(<= main_~i~0 2), 2085#(<= main_~i~0 3), 2086#(<= main_~i~0 4), 2087#(<= main_~i~0 5), 2088#(<= main_~i~0 6), 2089#(<= main_~i~0 7), 2090#(<= main_~i~0 8), 2091#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2092#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-02-02 19:56:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:44,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:56:44,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:56:44,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:56:44,811 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-02-02 19:56:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:45,122 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-02-02 19:56:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:56:45,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 19:56:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:45,123 INFO L225 Difference]: With dead ends: 186 [2018-02-02 19:56:45,123 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 19:56:45,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:56:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 19:56:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-02-02 19:56:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 19:56:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-02-02 19:56:45,128 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-02-02 19:56:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:45,129 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-02-02 19:56:45,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:56:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-02-02 19:56:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 19:56:45,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:45,130 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:45,130 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash -442860739, now seen corresponding path program 10 times [2018-02-02 19:56:45,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:45,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:45,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:45,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:56:45,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:45,231 INFO L182 omatonBuilderFactory]: Interpolants [2469#true, 2470#false, 2471#(<= main_~i~0 0), 2472#(<= main_~i~0 1), 2473#(<= main_~i~0 2), 2474#(<= main_~i~0 3), 2475#(<= main_~i~0 4), 2476#(<= main_~i~0 5), 2477#(<= main_~i~0 6), 2478#(<= main_~i~0 7), 2479#(<= main_~i~0 8), 2480#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2481#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2482#(and (<= 2 main_~i~0) (<= main_~i~0 10))] [2018-02-02 19:56:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:45,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:56:45,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:56:45,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:56:45,232 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 14 states. [2018-02-02 19:56:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:45,493 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-02-02 19:56:45,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:56:45,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 19:56:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:45,494 INFO L225 Difference]: With dead ends: 201 [2018-02-02 19:56:45,494 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 19:56:45,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:56:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 19:56:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-02-02 19:56:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 19:56:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-02-02 19:56:45,500 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-02-02 19:56:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:45,500 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-02-02 19:56:45,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:56:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-02-02 19:56:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:56:45,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:45,502 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:45,502 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash -634530929, now seen corresponding path program 11 times [2018-02-02 19:56:45,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:45,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:45,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:45,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:56:45,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:45,601 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 19:56:45,601 INFO L182 omatonBuilderFactory]: Interpolants [2890#true, 2891#false, 2892#(<= main_~i~0 0), 2893#(<= main_~i~0 1), 2894#(<= main_~i~0 2), 2895#(<= main_~i~0 3), 2896#(<= main_~i~0 4), 2897#(<= main_~i~0 5), 2898#(<= main_~i~0 6), 2899#(<= main_~i~0 7), 2900#(<= main_~i~0 8), 2901#(<= main_~i~0 9), 2902#(<= main_~i~0 10), 2903#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2904#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-02-02 19:56:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:45,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:56:45,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:56:45,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:56:45,602 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 15 states. [2018-02-02 19:56:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:45,921 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-02-02 19:56:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:56:45,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-02 19:56:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:45,922 INFO L225 Difference]: With dead ends: 216 [2018-02-02 19:56:45,922 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 19:56:45,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:56:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 19:56:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-02-02 19:56:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 19:56:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-02-02 19:56:45,926 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-02-02 19:56:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:45,926 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-02-02 19:56:45,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:56:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-02-02 19:56:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 19:56:45,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:45,927 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:45,927 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2145312381, now seen corresponding path program 12 times [2018-02-02 19:56:45,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:45,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:46,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:46,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:56:46,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:46,057 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 19:56:46,057 INFO L182 omatonBuilderFactory]: Interpolants [3343#true, 3344#false, 3345#(<= main_~i~0 0), 3346#(<= main_~i~0 1), 3347#(<= main_~i~0 2), 3348#(<= main_~i~0 3), 3349#(<= main_~i~0 4), 3350#(<= main_~i~0 5), 3351#(<= main_~i~0 6), 3352#(<= main_~i~0 7), 3353#(<= main_~i~0 8), 3354#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 3355#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 3356#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 3357#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 3358#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-02-02 19:56:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:46,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:56:46,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:56:46,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:56:46,058 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 16 states. [2018-02-02 19:56:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:46,470 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-02-02 19:56:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:56:46,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-02-02 19:56:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:46,471 INFO L225 Difference]: With dead ends: 231 [2018-02-02 19:56:46,471 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 19:56:46,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:56:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 19:56:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-02 19:56:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 19:56:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-02-02 19:56:46,477 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-02-02 19:56:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:46,478 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-02-02 19:56:46,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:56:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-02-02 19:56:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:56:46,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:46,479 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:46,479 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1734703183, now seen corresponding path program 13 times [2018-02-02 19:56:46,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:46,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:46,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:46,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:56:46,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:46,678 INFO L182 omatonBuilderFactory]: Interpolants [3840#(<= main_~i~0 10), 3841#(<= main_~i~0 11), 3842#(<= main_~i~0 12), 3843#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3844#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3828#true, 3829#false, 3830#(<= main_~i~0 0), 3831#(<= main_~i~0 1), 3832#(<= main_~i~0 2), 3833#(<= main_~i~0 3), 3834#(<= main_~i~0 4), 3835#(<= main_~i~0 5), 3836#(<= main_~i~0 6), 3837#(<= main_~i~0 7), 3838#(<= main_~i~0 8), 3839#(<= main_~i~0 9)] [2018-02-02 19:56:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:46,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:56:46,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:56:46,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:56:46,679 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-02-02 19:56:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:47,012 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-02-02 19:56:47,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:56:47,013 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-02 19:56:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:47,013 INFO L225 Difference]: With dead ends: 246 [2018-02-02 19:56:47,013 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 19:56:47,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:56:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 19:56:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-02-02 19:56:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 19:56:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-02-02 19:56:47,017 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-02-02 19:56:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:47,017 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-02-02 19:56:47,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:56:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-02-02 19:56:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 19:56:47,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:47,018 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:47,018 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1083166275, now seen corresponding path program 14 times [2018-02-02 19:56:47,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:47,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:47,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:47,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:56:47,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:47,124 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 19:56:47,124 INFO L182 omatonBuilderFactory]: Interpolants [4352#(<= main_~i~0 5), 4353#(<= main_~i~0 6), 4354#(<= main_~i~0 7), 4355#(<= main_~i~0 8), 4356#(<= main_~i~0 9), 4357#(<= main_~i~0 10), 4358#(<= main_~i~0 11), 4359#(<= main_~i~0 12), 4360#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 4361#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 4362#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 4345#true, 4346#false, 4347#(<= main_~i~0 0), 4348#(<= main_~i~0 1), 4349#(<= main_~i~0 2), 4350#(<= main_~i~0 3), 4351#(<= main_~i~0 4)] [2018-02-02 19:56:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:47,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:56:47,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:56:47,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:56:47,125 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 18 states. [2018-02-02 19:56:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:47,460 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-02-02 19:56:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:56:47,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-02 19:56:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:47,461 INFO L225 Difference]: With dead ends: 261 [2018-02-02 19:56:47,461 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 19:56:47,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:56:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 19:56:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-02 19:56:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 19:56:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-02 19:56:47,467 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-02-02 19:56:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:47,467 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-02 19:56:47,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:56:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-02 19:56:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 19:56:47,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:47,469 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:47,469 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1239821583, now seen corresponding path program 15 times [2018-02-02 19:56:47,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:47,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:47,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:47,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:56:47,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:47,644 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 19:56:47,645 INFO L182 omatonBuilderFactory]: Interpolants [4896#(<= main_~i~0 0), 4897#(<= main_~i~0 1), 4898#(<= main_~i~0 2), 4899#(<= main_~i~0 3), 4900#(<= main_~i~0 4), 4901#(<= main_~i~0 5), 4902#(<= main_~i~0 6), 4903#(<= main_~i~0 7), 4904#(<= main_~i~0 8), 4905#(<= main_~i~0 9), 4906#(<= main_~i~0 10), 4907#(<= main_~i~0 11), 4908#(<= main_~i~0 12), 4909#(<= main_~i~0 13), 4910#(<= main_~i~0 14), 4911#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4912#(and (<= 1 main_~i~0) (<= main_~i~0 15)), 4894#true, 4895#false] [2018-02-02 19:56:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:47,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:56:47,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:56:47,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:56:47,646 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 19 states. [2018-02-02 19:56:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:48,170 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-02-02 19:56:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:56:48,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-02-02 19:56:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:48,204 INFO L225 Difference]: With dead ends: 276 [2018-02-02 19:56:48,204 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 19:56:48,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:56:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 19:56:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-02-02 19:56:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 19:56:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-02-02 19:56:48,210 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-02-02 19:56:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:48,210 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-02-02 19:56:48,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:56:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-02-02 19:56:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 19:56:48,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:48,211 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:48,211 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash -589138691, now seen corresponding path program 16 times [2018-02-02 19:56:48,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:48,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:48,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:48,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:56:48,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:48,526 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 19:56:48,526 INFO L182 omatonBuilderFactory]: Interpolants [5475#true, 5476#false, 5477#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 5478#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 5479#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 5480#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 5481#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 5482#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 5483#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 5484#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 5485#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 5486#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 5487#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 5488#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 5489#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 5490#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 5491#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 5492#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 5493#(and (<= main_~i~0 16) (<= 16 main_~i~0))] [2018-02-02 19:56:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:48,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:56:48,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:56:48,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:56:48,528 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 19 states. [2018-02-02 19:56:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:49,796 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-02-02 19:56:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:56:49,797 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-02-02 19:56:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:49,797 INFO L225 Difference]: With dead ends: 291 [2018-02-02 19:56:49,797 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 19:56:49,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:56:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 19:56:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-02-02 19:56:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 19:56:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-02-02 19:56:49,803 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-02-02 19:56:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:49,803 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-02-02 19:56:49,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:56:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-02-02 19:56:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 19:56:49,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:49,805 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:49,805 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2053377585, now seen corresponding path program 17 times [2018-02-02 19:56:49,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:49,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:49,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:50,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 19:56:50,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:50,000 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 19:56:50,000 INFO L182 omatonBuilderFactory]: Interpolants [6055#true, 6056#false, 6057#(<= main_~i~0 0), 6058#(<= main_~i~0 1), 6059#(<= main_~i~0 2), 6060#(<= main_~i~0 3), 6061#(<= main_~i~0 4), 6062#(<= main_~i~0 5), 6063#(<= main_~i~0 6), 6064#(<= main_~i~0 7), 6065#(<= main_~i~0 8), 6066#(<= main_~i~0 9), 6067#(<= main_~i~0 10), 6068#(<= main_~i~0 11), 6069#(<= main_~i~0 12), 6070#(<= main_~i~0 13), 6071#(<= main_~i~0 14), 6072#(<= main_~i~0 15), 6073#(<= main_~i~0 16), 6074#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6075#(and (<= main_~i~0 17) (<= 1 main_~i~0))] [2018-02-02 19:56:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:50,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:56:50,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:56:50,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:56:50,001 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 21 states. [2018-02-02 19:56:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:50,496 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-02-02 19:56:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:56:50,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-02-02 19:56:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:50,497 INFO L225 Difference]: With dead ends: 306 [2018-02-02 19:56:50,497 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 19:56:50,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:56:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 19:56:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-02-02 19:56:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 19:56:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-02-02 19:56:50,502 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-02-02 19:56:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:50,502 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-02-02 19:56:50,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:56:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-02-02 19:56:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 19:56:50,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:50,504 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:50,504 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1741269053, now seen corresponding path program 18 times [2018-02-02 19:56:50,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:50,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:50,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:50,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 19:56:50,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:50,743 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 19:56:50,743 INFO L182 omatonBuilderFactory]: Interpolants [6720#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6721#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6700#true, 6701#false, 6702#(<= main_~i~0 0), 6703#(<= main_~i~0 1), 6704#(<= main_~i~0 2), 6705#(<= main_~i~0 3), 6706#(<= main_~i~0 4), 6707#(<= main_~i~0 5), 6708#(<= main_~i~0 6), 6709#(<= main_~i~0 7), 6710#(<= main_~i~0 8), 6711#(<= main_~i~0 9), 6712#(<= main_~i~0 10), 6713#(<= main_~i~0 11), 6714#(<= main_~i~0 12), 6715#(<= main_~i~0 13), 6716#(<= main_~i~0 14), 6717#(<= main_~i~0 15), 6718#(<= main_~i~0 16), 6719#(and (<= 0 main_~i~0) (<= main_~i~0 16))] [2018-02-02 19:56:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:50,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:56:50,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:56:50,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:56:50,744 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 22 states. [2018-02-02 19:56:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:51,403 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-02-02 19:56:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:56:51,403 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-02-02 19:56:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:51,405 INFO L225 Difference]: With dead ends: 321 [2018-02-02 19:56:51,405 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 19:56:51,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:56:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 19:56:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-02-02 19:56:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 19:56:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-02-02 19:56:51,411 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-02-02 19:56:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:51,412 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-02-02 19:56:51,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:56:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-02-02 19:56:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 19:56:51,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:51,413 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:51,413 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash 661833359, now seen corresponding path program 19 times [2018-02-02 19:56:51,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56: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 19:56:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:51,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:51,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 19:56:51,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:51,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 19:56:51,624 INFO L182 omatonBuilderFactory]: Interpolants [7392#(<= main_~i~0 13), 7393#(<= main_~i~0 14), 7394#(<= main_~i~0 15), 7395#(<= main_~i~0 16), 7396#(<= main_~i~0 17), 7397#(<= main_~i~0 18), 7398#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 7399#(and (<= 1 main_~i~0) (<= main_~i~0 19)), 7377#true, 7378#false, 7379#(<= main_~i~0 0), 7380#(<= main_~i~0 1), 7381#(<= main_~i~0 2), 7382#(<= main_~i~0 3), 7383#(<= main_~i~0 4), 7384#(<= main_~i~0 5), 7385#(<= main_~i~0 6), 7386#(<= main_~i~0 7), 7387#(<= main_~i~0 8), 7388#(<= main_~i~0 9), 7389#(<= main_~i~0 10), 7390#(<= main_~i~0 11), 7391#(<= main_~i~0 12)] [2018-02-02 19:56:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:51,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:56:51,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:56:51,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:56:51,625 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-02-02 19:56:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:52,110 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-02-02 19:56:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:56:52,111 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-02-02 19:56:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:52,112 INFO L225 Difference]: With dead ends: 336 [2018-02-02 19:56:52,112 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 19:56:52,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:56:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 19:56:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-02-02 19:56:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-02 19:56:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-02-02 19:56:52,119 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-02-02 19:56:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:52,119 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-02-02 19:56:52,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:56:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-02-02 19:56:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 19:56:52,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:52,121 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:52,121 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2034644099, now seen corresponding path program 20 times [2018-02-02 19:56:52,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:52,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:52,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:52,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:56:52,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:52,355 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 19:56:52,356 INFO L182 omatonBuilderFactory]: Interpolants [8096#(<= main_~i~0 8), 8097#(<= main_~i~0 9), 8098#(<= main_~i~0 10), 8099#(<= main_~i~0 11), 8100#(<= main_~i~0 12), 8101#(<= main_~i~0 13), 8102#(<= main_~i~0 14), 8103#(<= main_~i~0 15), 8104#(<= main_~i~0 16), 8105#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 8106#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 8107#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 8108#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 8109#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 8086#true, 8087#false, 8088#(<= main_~i~0 0), 8089#(<= main_~i~0 1), 8090#(<= main_~i~0 2), 8091#(<= main_~i~0 3), 8092#(<= main_~i~0 4), 8093#(<= main_~i~0 5), 8094#(<= main_~i~0 6), 8095#(<= main_~i~0 7)] [2018-02-02 19:56:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:52,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:56:52,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:56:52,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:56:52,357 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 24 states. [2018-02-02 19:56:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:53,107 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-02-02 19:56:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:56:53,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-02-02 19:56:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:53,109 INFO L225 Difference]: With dead ends: 351 [2018-02-02 19:56:53,109 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 19:56:53,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:56:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 19:56:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-02-02 19:56:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 19:56:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-02-02 19:56:53,113 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-02-02 19:56:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:53,113 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-02-02 19:56:53,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:56:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-02-02 19:56:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 19:56:53,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:53,114 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:53,114 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 89566031, now seen corresponding path program 21 times [2018-02-02 19:56:53,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:53,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:53,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:53,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 19:56:53,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:53,347 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~0 3), 8833#(<= main_~i~0 4), 8834#(<= main_~i~0 5), 8835#(<= main_~i~0 6), 8836#(<= main_~i~0 7), 8837#(<= main_~i~0 8), 8838#(<= main_~i~0 9), 8839#(<= main_~i~0 10), 8840#(<= main_~i~0 11), 8841#(<= main_~i~0 12), 8842#(<= main_~i~0 13), 8843#(<= main_~i~0 14), 8844#(<= main_~i~0 15), 8845#(<= main_~i~0 16), 8846#(<= main_~i~0 17), 8847#(<= main_~i~0 18), 8848#(<= main_~i~0 19), 8849#(<= main_~i~0 20), 8850#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8851#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8827#true, 8828#false, 8829#(<= main_~i~0 0), 8830#(<= main_~i~0 1), 8831#(<= main_~i~0 2)] [2018-02-02 19:56:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:53,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:56:53,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:56:53,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:56:53,349 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 25 states. [2018-02-02 19:56:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:54,094 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-02-02 19:56:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:56:54,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-02-02 19:56:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:54,096 INFO L225 Difference]: With dead ends: 366 [2018-02-02 19:56:54,096 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 19:56:54,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:56:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 19:56:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-02 19:56:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 19:56:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-02-02 19:56:54,103 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-02-02 19:56:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:54,103 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-02-02 19:56:54,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:56:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-02-02 19:56:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 19:56:54,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:54,105 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:54,105 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 927391421, now seen corresponding path program 22 times [2018-02-02 19:56:54,106 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:54,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:54,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:54,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:56:54,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:54,421 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 19:56:54,422 INFO L182 omatonBuilderFactory]: Interpolants [9600#true, 9601#false, 9602#(<= main_~i~0 0), 9603#(<= main_~i~0 1), 9604#(<= main_~i~0 2), 9605#(<= main_~i~0 3), 9606#(<= main_~i~0 4), 9607#(<= main_~i~0 5), 9608#(<= main_~i~0 6), 9609#(<= main_~i~0 7), 9610#(<= main_~i~0 8), 9611#(<= main_~i~0 9), 9612#(<= main_~i~0 10), 9613#(<= main_~i~0 11), 9614#(<= main_~i~0 12), 9615#(<= main_~i~0 13), 9616#(<= main_~i~0 14), 9617#(<= main_~i~0 15), 9618#(<= main_~i~0 16), 9619#(<= main_~i~0 17), 9620#(<= main_~i~0 18), 9621#(<= main_~i~0 19), 9622#(<= main_~i~0 20), 9623#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 9624#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 9625#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-02-02 19:56:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:54,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:56:54,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:56:54,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:56:54,423 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 26 states. [2018-02-02 19:56:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:55,126 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-02-02 19:56:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:56:55,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-02-02 19:56:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:55,127 INFO L225 Difference]: With dead ends: 381 [2018-02-02 19:56:55,127 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 19:56:55,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 19:56:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 19:56:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-02-02 19:56:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 19:56:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-02 19:56:55,133 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-02-02 19:56:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:55,134 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-02 19:56:55,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:56:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-02 19:56:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 19:56:55,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:55,135 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:55,135 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2117312527, now seen corresponding path program 23 times [2018-02-02 19:56:55,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:55,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:55,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:55,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 19:56:55,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:55,419 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 19:56:55,419 INFO L182 omatonBuilderFactory]: Interpolants [10405#true, 10406#false, 10407#(<= main_~i~0 0), 10408#(<= main_~i~0 1), 10409#(<= main_~i~0 2), 10410#(<= main_~i~0 3), 10411#(<= main_~i~0 4), 10412#(<= main_~i~0 5), 10413#(<= main_~i~0 6), 10414#(<= main_~i~0 7), 10415#(<= main_~i~0 8), 10416#(<= main_~i~0 9), 10417#(<= main_~i~0 10), 10418#(<= main_~i~0 11), 10419#(<= main_~i~0 12), 10420#(<= main_~i~0 13), 10421#(<= main_~i~0 14), 10422#(<= main_~i~0 15), 10423#(<= main_~i~0 16), 10424#(<= main_~i~0 17), 10425#(<= main_~i~0 18), 10426#(<= main_~i~0 19), 10427#(<= main_~i~0 20), 10428#(<= main_~i~0 21), 10429#(<= main_~i~0 22), 10430#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 10431#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-02-02 19:56:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:55,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:56:55,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:56:55,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:56:55,420 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 27 states. [2018-02-02 19:56:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:56,132 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-02-02 19:56:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:56:56,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-02 19:56:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:56,133 INFO L225 Difference]: With dead ends: 396 [2018-02-02 19:56:56,133 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 19:56:56,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 19:56:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 19:56:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-02-02 19:56:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-02 19:56:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-02-02 19:56:56,137 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-02-02 19:56:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:56,137 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-02-02 19:56:56,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:56:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-02-02 19:56:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 19:56:56,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:56,138 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:56,138 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1912282627, now seen corresponding path program 24 times [2018-02-02 19:56:56,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:56,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:56,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:56,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:56:56,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:56,352 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 19:56:56,352 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 11265#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 11266#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 11267#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 11268#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 11269#(and (<= 8 main_~i~0) (<= main_~i~0 24)), 11242#true, 11243#false, 11244#(<= main_~i~0 0), 11245#(<= main_~i~0 1), 11246#(<= main_~i~0 2), 11247#(<= main_~i~0 3), 11248#(<= main_~i~0 4), 11249#(<= main_~i~0 5), 11250#(<= main_~i~0 6), 11251#(<= main_~i~0 7), 11252#(<= main_~i~0 8), 11253#(<= main_~i~0 9), 11254#(<= main_~i~0 10), 11255#(<= main_~i~0 11), 11256#(<= main_~i~0 12), 11257#(<= main_~i~0 13), 11258#(<= main_~i~0 14), 11259#(<= main_~i~0 15), 11260#(<= main_~i~0 16), 11261#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 11262#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 11263#(and (<= 2 main_~i~0) (<= main_~i~0 18))] [2018-02-02 19:56:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:56,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:56:56,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:56:56,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:56:56,353 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 28 states. [2018-02-02 19:56:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:57,441 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-02-02 19:56:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:56:57,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 128 [2018-02-02 19:56:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:57,443 INFO L225 Difference]: With dead ends: 411 [2018-02-02 19:56:57,443 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 19:56:57,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 19:56:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 19:56:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-02-02 19:56:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 19:56:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-02-02 19:56:57,447 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-02-02 19:56:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:57,447 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-02-02 19:56:57,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:56:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-02-02 19:56:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 19:56:57,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:57,448 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:57,448 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 972399823, now seen corresponding path program 25 times [2018-02-02 19:56:57,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:57,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:57,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:57,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 19:56:57,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:57,711 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 19:56:57,711 INFO L182 omatonBuilderFactory]: Interpolants [12111#true, 12112#false, 12113#(<= main_~i~0 0), 12114#(<= main_~i~0 1), 12115#(<= main_~i~0 2), 12116#(<= main_~i~0 3), 12117#(<= main_~i~0 4), 12118#(<= main_~i~0 5), 12119#(<= main_~i~0 6), 12120#(<= main_~i~0 7), 12121#(<= main_~i~0 8), 12122#(<= main_~i~0 9), 12123#(<= main_~i~0 10), 12124#(<= main_~i~0 11), 12125#(<= main_~i~0 12), 12126#(<= main_~i~0 13), 12127#(<= main_~i~0 14), 12128#(<= main_~i~0 15), 12129#(<= main_~i~0 16), 12130#(<= main_~i~0 17), 12131#(<= main_~i~0 18), 12132#(<= main_~i~0 19), 12133#(<= main_~i~0 20), 12134#(<= main_~i~0 21), 12135#(<= main_~i~0 22), 12136#(<= main_~i~0 23), 12137#(<= main_~i~0 24), 12138#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12139#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-02-02 19:56:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:57,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 19:56:57,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 19:56:57,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:56:57,712 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-02-02 19:56:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:58,503 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-02-02 19:56:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:56:58,504 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-02 19:56:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:58,505 INFO L225 Difference]: With dead ends: 426 [2018-02-02 19:56:58,505 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 19:56:58,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 19:56:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 19:56:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-02-02 19:56:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 19:56:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-02-02 19:56:58,513 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-02-02 19:56:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:58,513 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-02-02 19:56:58,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 19:56:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-02-02 19:56:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-02-02 19:56:58,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:58,515 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:58,515 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -158870211, now seen corresponding path program 26 times [2018-02-02 19:56:58,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:58,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:58,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:58,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:56:58,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:58,829 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 19:56:58,829 INFO L182 omatonBuilderFactory]: Interpolants [13012#true, 13013#false, 13014#(<= main_~i~0 0), 13015#(<= main_~i~0 1), 13016#(<= main_~i~0 2), 13017#(<= main_~i~0 3), 13018#(<= main_~i~0 4), 13019#(<= main_~i~0 5), 13020#(<= main_~i~0 6), 13021#(<= main_~i~0 7), 13022#(<= main_~i~0 8), 13023#(<= main_~i~0 9), 13024#(<= main_~i~0 10), 13025#(<= main_~i~0 11), 13026#(<= main_~i~0 12), 13027#(<= main_~i~0 13), 13028#(<= main_~i~0 14), 13029#(<= main_~i~0 15), 13030#(<= main_~i~0 16), 13031#(<= main_~i~0 17), 13032#(<= main_~i~0 18), 13033#(<= main_~i~0 19), 13034#(<= main_~i~0 20), 13035#(<= main_~i~0 21), 13036#(<= main_~i~0 22), 13037#(<= main_~i~0 23), 13038#(<= main_~i~0 24), 13039#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 13040#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 13041#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-02-02 19:56:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:58,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:56:58,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:56:58,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:56:58,831 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 30 states. [2018-02-02 19:56:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:59,846 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-02-02 19:56:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 19:56:59,847 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 138 [2018-02-02 19:56:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:59,848 INFO L225 Difference]: With dead ends: 441 [2018-02-02 19:56:59,849 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 19:56:59,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 19:56:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 19:56:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-02-02 19:56:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 19:56:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-02-02 19:56:59,856 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-02-02 19:56:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:59,856 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-02-02 19:56:59,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:56:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-02-02 19:56:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 19:56:59,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:59,858 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 19:56:59,858 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:56:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -376915569, now seen corresponding path program 27 times [2018-02-02 19:56:59,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:59,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:00,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:00,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 19:57:00,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:00,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 19:57:00,150 INFO L182 omatonBuilderFactory]: Interpolants [13952#(<= main_~i~0 5), 13953#(<= main_~i~0 6), 13954#(<= main_~i~0 7), 13955#(<= main_~i~0 8), 13956#(<= main_~i~0 9), 13957#(<= main_~i~0 10), 13958#(<= main_~i~0 11), 13959#(<= main_~i~0 12), 13960#(<= main_~i~0 13), 13961#(<= main_~i~0 14), 13962#(<= main_~i~0 15), 13963#(<= main_~i~0 16), 13964#(<= main_~i~0 17), 13965#(<= main_~i~0 18), 13966#(<= main_~i~0 19), 13967#(<= main_~i~0 20), 13968#(<= main_~i~0 21), 13969#(<= main_~i~0 22), 13970#(<= main_~i~0 23), 13971#(<= main_~i~0 24), 13972#(<= main_~i~0 25), 13973#(<= main_~i~0 26), 13974#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 13975#(and (<= 1 main_~i~0) (<= main_~i~0 27)), 13945#true, 13946#false, 13947#(<= main_~i~0 0), 13948#(<= main_~i~0 1), 13949#(<= main_~i~0 2), 13950#(<= main_~i~0 3), 13951#(<= main_~i~0 4)] [2018-02-02 19:57:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:00,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:57:00,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:57:00,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:57:00,151 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 31 states. [2018-02-02 19:57:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:00,957 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-02-02 19:57:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:57:00,957 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-02-02 19:57:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:00,959 INFO L225 Difference]: With dead ends: 456 [2018-02-02 19:57:00,959 INFO L226 Difference]: Without dead ends: 456 [2018-02-02 19:57:00,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 19:57:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-02 19:57:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-02-02 19:57:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 19:57:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-02-02 19:57:00,965 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-02-02 19:57:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:00,965 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-02-02 19:57:00,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:57:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-02-02 19:57:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 19:57:00,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:00,966 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:00,966 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1935915133, now seen corresponding path program 28 times [2018-02-02 19:57:00,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:00,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:01,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:01,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 19:57:01,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:01,395 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 19:57:01,395 INFO L182 omatonBuilderFactory]: Interpolants [14912#(<= main_~i~0 0), 14913#(<= main_~i~0 1), 14914#(<= main_~i~0 2), 14915#(<= main_~i~0 3), 14916#(<= main_~i~0 4), 14917#(<= main_~i~0 5), 14918#(<= main_~i~0 6), 14919#(<= main_~i~0 7), 14920#(<= main_~i~0 8), 14921#(<= main_~i~0 9), 14922#(<= main_~i~0 10), 14923#(<= main_~i~0 11), 14924#(<= main_~i~0 12), 14925#(<= main_~i~0 13), 14926#(<= main_~i~0 14), 14927#(<= main_~i~0 15), 14928#(<= main_~i~0 16), 14929#(<= main_~i~0 17), 14930#(<= main_~i~0 18), 14931#(<= main_~i~0 19), 14932#(<= main_~i~0 20), 14933#(<= main_~i~0 21), 14934#(<= main_~i~0 22), 14935#(<= main_~i~0 23), 14936#(<= main_~i~0 24), 14937#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 14938#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 14939#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 14940#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 14941#(and (<= 4 main_~i~0) (<= main_~i~0 28)), 14910#true, 14911#false] [2018-02-02 19:57:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:01,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:57:01,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:57:01,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:57:01,396 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 32 states. [2018-02-02 19:57:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:02,695 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-02-02 19:57:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:57:02,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2018-02-02 19:57:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:02,697 INFO L225 Difference]: With dead ends: 471 [2018-02-02 19:57:02,697 INFO L226 Difference]: Without dead ends: 471 [2018-02-02 19:57:02,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 19:57:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-02-02 19:57:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-02-02 19:57:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 19:57:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-02-02 19:57:02,703 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-02-02 19:57:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:02,703 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-02-02 19:57:02,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:57:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-02-02 19:57:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-02 19:57:02,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:02,704 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:02,704 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 114875983, now seen corresponding path program 29 times [2018-02-02 19:57:02,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:02,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:03,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:03,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 19:57:03,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:03,052 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 19:57:03,052 INFO L182 omatonBuilderFactory]: Interpolants [15936#(<= main_~i~0 27), 15937#(<= main_~i~0 28), 15938#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 15939#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 15907#true, 15908#false, 15909#(<= main_~i~0 0), 15910#(<= main_~i~0 1), 15911#(<= main_~i~0 2), 15912#(<= main_~i~0 3), 15913#(<= main_~i~0 4), 15914#(<= main_~i~0 5), 15915#(<= main_~i~0 6), 15916#(<= main_~i~0 7), 15917#(<= main_~i~0 8), 15918#(<= main_~i~0 9), 15919#(<= main_~i~0 10), 15920#(<= main_~i~0 11), 15921#(<= main_~i~0 12), 15922#(<= main_~i~0 13), 15923#(<= main_~i~0 14), 15924#(<= main_~i~0 15), 15925#(<= main_~i~0 16), 15926#(<= main_~i~0 17), 15927#(<= main_~i~0 18), 15928#(<= main_~i~0 19), 15929#(<= main_~i~0 20), 15930#(<= main_~i~0 21), 15931#(<= main_~i~0 22), 15932#(<= main_~i~0 23), 15933#(<= main_~i~0 24), 15934#(<= main_~i~0 25), 15935#(<= main_~i~0 26)] [2018-02-02 19:57:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:03,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:57:03,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:57:03,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:57:03,054 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 33 states. [2018-02-02 19:57:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:04,228 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-02-02 19:57:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:57:04,230 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2018-02-02 19:57:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:04,231 INFO L225 Difference]: With dead ends: 486 [2018-02-02 19:57:04,231 INFO L226 Difference]: Without dead ends: 486 [2018-02-02 19:57:04,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 19:57:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-02 19:57:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-02-02 19:57:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 19:57:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-02-02 19:57:04,237 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-02-02 19:57:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:04,238 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-02-02 19:57:04,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:57:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-02-02 19:57:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 19:57:04,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:04,239 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:04,239 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -567505987, now seen corresponding path program 30 times [2018-02-02 19:57:04,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:04,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:04,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:04,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 19:57:04,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:04,683 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 19:57:04,684 INFO L182 omatonBuilderFactory]: Interpolants [16960#(<= main_~i~0 22), 16961#(<= main_~i~0 23), 16962#(<= main_~i~0 24), 16963#(<= main_~i~0 25), 16964#(<= main_~i~0 26), 16965#(<= main_~i~0 27), 16966#(<= main_~i~0 28), 16967#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 16968#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 16969#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 16936#true, 16937#false, 16938#(<= main_~i~0 0), 16939#(<= main_~i~0 1), 16940#(<= main_~i~0 2), 16941#(<= main_~i~0 3), 16942#(<= main_~i~0 4), 16943#(<= main_~i~0 5), 16944#(<= main_~i~0 6), 16945#(<= main_~i~0 7), 16946#(<= main_~i~0 8), 16947#(<= main_~i~0 9), 16948#(<= main_~i~0 10), 16949#(<= main_~i~0 11), 16950#(<= main_~i~0 12), 16951#(<= main_~i~0 13), 16952#(<= main_~i~0 14), 16953#(<= main_~i~0 15), 16954#(<= main_~i~0 16), 16955#(<= main_~i~0 17), 16956#(<= main_~i~0 18), 16957#(<= main_~i~0 19), 16958#(<= main_~i~0 20), 16959#(<= main_~i~0 21)] [2018-02-02 19:57:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:04,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:57:04,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:57:04,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:57:04,685 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 34 states. [2018-02-02 19:57:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:05,641 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-02-02 19:57:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:57:05,641 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 158 [2018-02-02 19:57:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:05,643 INFO L225 Difference]: With dead ends: 501 [2018-02-02 19:57:05,643 INFO L226 Difference]: Without dead ends: 501 [2018-02-02 19:57:05,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 19:57:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-02 19:57:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-02-02 19:57:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-02 19:57:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-02-02 19:57:05,649 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-02-02 19:57:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:05,650 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-02-02 19:57:05,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:57:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-02-02 19:57:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-02 19:57:05,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:05,651 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:05,652 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1798171889, now seen corresponding path program 31 times [2018-02-02 19:57:05,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:05,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:06,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:06,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 19:57:06,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:06,086 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 19:57:06,087 INFO L182 omatonBuilderFactory]: Interpolants [17997#true, 17998#false, 17999#(<= main_~i~0 0), 18000#(<= main_~i~0 1), 18001#(<= main_~i~0 2), 18002#(<= main_~i~0 3), 18003#(<= main_~i~0 4), 18004#(<= main_~i~0 5), 18005#(<= main_~i~0 6), 18006#(<= main_~i~0 7), 18007#(<= main_~i~0 8), 18008#(<= main_~i~0 9), 18009#(<= main_~i~0 10), 18010#(<= main_~i~0 11), 18011#(<= main_~i~0 12), 18012#(<= main_~i~0 13), 18013#(<= main_~i~0 14), 18014#(<= main_~i~0 15), 18015#(<= main_~i~0 16), 18016#(<= main_~i~0 17), 18017#(<= main_~i~0 18), 18018#(<= main_~i~0 19), 18019#(<= main_~i~0 20), 18020#(<= main_~i~0 21), 18021#(<= main_~i~0 22), 18022#(<= main_~i~0 23), 18023#(<= main_~i~0 24), 18024#(<= main_~i~0 25), 18025#(<= main_~i~0 26), 18026#(<= main_~i~0 27), 18027#(<= main_~i~0 28), 18028#(<= main_~i~0 29), 18029#(<= main_~i~0 30), 18030#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 18031#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-02-02 19:57:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:06,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:57:06,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:57:06,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:57:06,088 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-02-02 19:57:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:07,058 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-02-02 19:57:07,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:57:07,058 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-02-02 19:57:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:07,059 INFO L225 Difference]: With dead ends: 516 [2018-02-02 19:57:07,059 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 19:57:07,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 19:57:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 19:57:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-02-02 19:57:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-02 19:57:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-02-02 19:57:07,064 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-02-02 19:57:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:07,065 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-02-02 19:57:07,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:57:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-02-02 19:57:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 19:57:07,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:07,066 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:07,066 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 662064893, now seen corresponding path program 32 times [2018-02-02 19:57:07,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:07,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:07,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:07,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 19:57:07,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:07,579 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 19:57:07,579 INFO L182 omatonBuilderFactory]: Interpolants [19090#true, 19091#false, 19092#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 19093#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 19094#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 19095#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 19096#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 19097#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 19098#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 19099#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 19100#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 19101#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 19102#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 19103#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 19104#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 19105#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 19106#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 19107#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 19108#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 19109#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 19110#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 19111#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 19112#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 19113#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 19114#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 19115#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 19116#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 19117#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 19118#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 19119#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 19120#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 19121#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 19122#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 19123#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 19124#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-02-02 19:57:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:07,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:57:07,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:57:07,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:57:07,580 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-02-02 19:57:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:12,352 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-02-02 19:57:12,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 19:57:12,352 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-02-02 19:57:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:12,353 INFO L225 Difference]: With dead ends: 531 [2018-02-02 19:57:12,353 INFO L226 Difference]: Without dead ends: 531 [2018-02-02 19:57:12,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:57:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-02 19:57:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-02-02 19:57:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 19:57:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-02-02 19:57:12,360 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-02-02 19:57:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:12,360 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-02-02 19:57:12,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:57:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-02-02 19:57:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-02 19:57:12,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:12,362 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:12,362 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash -547334193, now seen corresponding path program 33 times [2018-02-02 19:57:12,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:12,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:12,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:12,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 19:57:12,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:12,773 INFO L182 omatonBuilderFactory]: Interpolants [20160#(<= main_~i~0 8), 20161#(<= main_~i~0 9), 20162#(<= main_~i~0 10), 20163#(<= main_~i~0 11), 20164#(<= main_~i~0 12), 20165#(<= main_~i~0 13), 20166#(<= main_~i~0 14), 20167#(<= main_~i~0 15), 20168#(<= main_~i~0 16), 20169#(<= main_~i~0 17), 20170#(<= main_~i~0 18), 20171#(<= main_~i~0 19), 20172#(<= main_~i~0 20), 20173#(<= main_~i~0 21), 20174#(<= main_~i~0 22), 20175#(<= main_~i~0 23), 20176#(<= main_~i~0 24), 20177#(<= main_~i~0 25), 20178#(<= main_~i~0 26), 20179#(<= main_~i~0 27), 20180#(<= main_~i~0 28), 20181#(<= main_~i~0 29), 20182#(<= main_~i~0 30), 20183#(<= main_~i~0 31), 20184#(<= main_~i~0 32), 20185#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20186#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20150#true, 20151#false, 20152#(<= main_~i~0 0), 20153#(<= main_~i~0 1), 20154#(<= main_~i~0 2), 20155#(<= main_~i~0 3), 20156#(<= main_~i~0 4), 20157#(<= main_~i~0 5), 20158#(<= main_~i~0 6), 20159#(<= main_~i~0 7)] [2018-02-02 19:57:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:12,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:57:12,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:57:12,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:57:12,774 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 37 states. [2018-02-02 19:57:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:13,807 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-02-02 19:57:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 19:57:13,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2018-02-02 19:57:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:13,809 INFO L225 Difference]: With dead ends: 546 [2018-02-02 19:57:13,809 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 19:57:13,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 19:57:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 19:57:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-02-02 19:57:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 19:57:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-02-02 19:57:13,815 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-02-02 19:57:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:13,815 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-02-02 19:57:13,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:57:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-02-02 19:57:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 19:57:13,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:13,816 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:13,816 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1764425155, now seen corresponding path program 34 times [2018-02-02 19:57:13,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:13,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:14,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:14,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 19:57:14,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:14,215 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 19:57:14,215 INFO L182 omatonBuilderFactory]: Interpolants [21312#(<= main_~i~0 3), 21313#(<= main_~i~0 4), 21314#(<= main_~i~0 5), 21315#(<= main_~i~0 6), 21316#(<= main_~i~0 7), 21317#(<= main_~i~0 8), 21318#(<= main_~i~0 9), 21319#(<= main_~i~0 10), 21320#(<= main_~i~0 11), 21321#(<= main_~i~0 12), 21322#(<= main_~i~0 13), 21323#(<= main_~i~0 14), 21324#(<= main_~i~0 15), 21325#(<= main_~i~0 16), 21326#(<= main_~i~0 17), 21327#(<= main_~i~0 18), 21328#(<= main_~i~0 19), 21329#(<= main_~i~0 20), 21330#(<= main_~i~0 21), 21331#(<= main_~i~0 22), 21332#(<= main_~i~0 23), 21333#(<= main_~i~0 24), 21334#(<= main_~i~0 25), 21335#(<= main_~i~0 26), 21336#(<= main_~i~0 27), 21337#(<= main_~i~0 28), 21338#(<= main_~i~0 29), 21339#(<= main_~i~0 30), 21340#(<= main_~i~0 31), 21341#(<= main_~i~0 32), 21342#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 21343#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 21344#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 21307#true, 21308#false, 21309#(<= main_~i~0 0), 21310#(<= main_~i~0 1), 21311#(<= main_~i~0 2)] [2018-02-02 19:57:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:14,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 19:57:14,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 19:57:14,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:57:14,216 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 38 states. [2018-02-02 19:57:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:15,360 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-02-02 19:57:15,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 19:57:15,360 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 178 [2018-02-02 19:57:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:15,361 INFO L225 Difference]: With dead ends: 561 [2018-02-02 19:57:15,361 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 19:57:15,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 19:57:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 19:57:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-02-02 19:57:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-02 19:57:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-02-02 19:57:15,366 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-02-02 19:57:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:15,366 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-02-02 19:57:15,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 19:57:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-02-02 19:57:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 19:57:15,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:15,367 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:15,367 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 997174415, now seen corresponding path program 35 times [2018-02-02 19:57:15,367 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:15,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:15,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:15,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 19:57:15,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:15,816 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 19:57:15,816 INFO L182 omatonBuilderFactory]: Interpolants [22528#(<= main_~i~0 30), 22529#(<= main_~i~0 31), 22530#(<= main_~i~0 32), 22531#(<= main_~i~0 33), 22532#(<= main_~i~0 34), 22533#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 22534#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 22496#true, 22497#false, 22498#(<= main_~i~0 0), 22499#(<= main_~i~0 1), 22500#(<= main_~i~0 2), 22501#(<= main_~i~0 3), 22502#(<= main_~i~0 4), 22503#(<= main_~i~0 5), 22504#(<= main_~i~0 6), 22505#(<= main_~i~0 7), 22506#(<= main_~i~0 8), 22507#(<= main_~i~0 9), 22508#(<= main_~i~0 10), 22509#(<= main_~i~0 11), 22510#(<= main_~i~0 12), 22511#(<= main_~i~0 13), 22512#(<= main_~i~0 14), 22513#(<= main_~i~0 15), 22514#(<= main_~i~0 16), 22515#(<= main_~i~0 17), 22516#(<= main_~i~0 18), 22517#(<= main_~i~0 19), 22518#(<= main_~i~0 20), 22519#(<= main_~i~0 21), 22520#(<= main_~i~0 22), 22521#(<= main_~i~0 23), 22522#(<= main_~i~0 24), 22523#(<= main_~i~0 25), 22524#(<= main_~i~0 26), 22525#(<= main_~i~0 27), 22526#(<= main_~i~0 28), 22527#(<= main_~i~0 29)] [2018-02-02 19:57:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:15,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:57:15,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:57:15,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:57:15,817 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 39 states. [2018-02-02 19:57:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:16,897 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-02-02 19:57:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:57:16,897 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 183 [2018-02-02 19:57:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:16,899 INFO L225 Difference]: With dead ends: 576 [2018-02-02 19:57:16,899 INFO L226 Difference]: Without dead ends: 576 [2018-02-02 19:57:16,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 19:57:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-02 19:57:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-02-02 19:57:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-02 19:57:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-02-02 19:57:16,903 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-02-02 19:57:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:16,903 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-02-02 19:57:16,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:57:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-02-02 19:57:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 19:57:16,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:16,904 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:16,904 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash 182232445, now seen corresponding path program 36 times [2018-02-02 19:57:16,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:16,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:17,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:17,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 19:57:17,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:17,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 19:57:17,371 INFO L182 omatonBuilderFactory]: Interpolants [23744#(<= main_~i~0 25), 23745#(<= main_~i~0 26), 23746#(<= main_~i~0 27), 23747#(<= main_~i~0 28), 23748#(<= main_~i~0 29), 23749#(<= main_~i~0 30), 23750#(<= main_~i~0 31), 23751#(<= main_~i~0 32), 23752#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 23753#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 23754#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 23755#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 23756#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 23717#true, 23718#false, 23719#(<= main_~i~0 0), 23720#(<= main_~i~0 1), 23721#(<= main_~i~0 2), 23722#(<= main_~i~0 3), 23723#(<= main_~i~0 4), 23724#(<= main_~i~0 5), 23725#(<= main_~i~0 6), 23726#(<= main_~i~0 7), 23727#(<= main_~i~0 8), 23728#(<= main_~i~0 9), 23729#(<= main_~i~0 10), 23730#(<= main_~i~0 11), 23731#(<= main_~i~0 12), 23732#(<= main_~i~0 13), 23733#(<= main_~i~0 14), 23734#(<= main_~i~0 15), 23735#(<= main_~i~0 16), 23736#(<= main_~i~0 17), 23737#(<= main_~i~0 18), 23738#(<= main_~i~0 19), 23739#(<= main_~i~0 20), 23740#(<= main_~i~0 21), 23741#(<= main_~i~0 22), 23742#(<= main_~i~0 23), 23743#(<= main_~i~0 24)] [2018-02-02 19:57:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:17,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 19:57:17,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 19:57:17,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:57:17,372 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 40 states. [2018-02-02 19:57:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:18,731 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-02-02 19:57:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 19:57:18,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 188 [2018-02-02 19:57:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:18,733 INFO L225 Difference]: With dead ends: 591 [2018-02-02 19:57:18,733 INFO L226 Difference]: Without dead ends: 591 [2018-02-02 19:57:18,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 19:57:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-02 19:57:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-02-02 19:57:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-02 19:57:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-02-02 19:57:18,737 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-02-02 19:57:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:18,737 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-02-02 19:57:18,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 19:57:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-02-02 19:57:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 19:57:18,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:18,739 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:18,739 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash -957607601, now seen corresponding path program 37 times [2018-02-02 19:57:18,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:18,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:19,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:19,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 19:57:19,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:19,229 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 19:57:19,230 INFO L182 omatonBuilderFactory]: Interpolants [24970#true, 24971#false, 24972#(<= main_~i~0 0), 24973#(<= main_~i~0 1), 24974#(<= main_~i~0 2), 24975#(<= main_~i~0 3), 24976#(<= main_~i~0 4), 24977#(<= main_~i~0 5), 24978#(<= main_~i~0 6), 24979#(<= main_~i~0 7), 24980#(<= main_~i~0 8), 24981#(<= main_~i~0 9), 24982#(<= main_~i~0 10), 24983#(<= main_~i~0 11), 24984#(<= main_~i~0 12), 24985#(<= main_~i~0 13), 24986#(<= main_~i~0 14), 24987#(<= main_~i~0 15), 24988#(<= main_~i~0 16), 24989#(<= main_~i~0 17), 24990#(<= main_~i~0 18), 24991#(<= main_~i~0 19), 24992#(<= main_~i~0 20), 24993#(<= main_~i~0 21), 24994#(<= main_~i~0 22), 24995#(<= main_~i~0 23), 24996#(<= main_~i~0 24), 24997#(<= main_~i~0 25), 24998#(<= main_~i~0 26), 24999#(<= main_~i~0 27), 25000#(<= main_~i~0 28), 25001#(<= main_~i~0 29), 25002#(<= main_~i~0 30), 25003#(<= main_~i~0 31), 25004#(<= main_~i~0 32), 25005#(<= main_~i~0 33), 25006#(<= main_~i~0 34), 25007#(<= main_~i~0 35), 25008#(<= main_~i~0 36), 25009#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 25010#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-02-02 19:57:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:19,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:57:19,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:57:19,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:57:19,230 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-02-02 19:57:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:20,496 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-02-02 19:57:20,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 19:57:20,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-02-02 19:57:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:20,497 INFO L225 Difference]: With dead ends: 606 [2018-02-02 19:57:20,498 INFO L226 Difference]: Without dead ends: 606 [2018-02-02 19:57:20,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 19:57:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-02 19:57:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-02-02 19:57:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-02 19:57:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-02-02 19:57:20,503 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-02-02 19:57:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:20,503 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-02-02 19:57:20,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:57:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-02-02 19:57:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-02 19:57:20,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:20,504 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:20,504 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 38 times [2018-02-02 19:57:20,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:20,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:20,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:20,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:57:20,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:20,968 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 19:57:20,968 INFO L182 omatonBuilderFactory]: Interpolants [26255#true, 26256#false, 26257#(<= main_~i~0 0), 26258#(<= main_~i~0 1), 26259#(<= main_~i~0 2), 26260#(<= main_~i~0 3), 26261#(<= main_~i~0 4), 26262#(<= main_~i~0 5), 26263#(<= main_~i~0 6), 26264#(<= main_~i~0 7), 26265#(<= main_~i~0 8), 26266#(<= main_~i~0 9), 26267#(<= main_~i~0 10), 26268#(<= main_~i~0 11), 26269#(<= main_~i~0 12), 26270#(<= main_~i~0 13), 26271#(<= main_~i~0 14), 26272#(<= main_~i~0 15), 26273#(<= main_~i~0 16), 26274#(<= main_~i~0 17), 26275#(<= main_~i~0 18), 26276#(<= main_~i~0 19), 26277#(<= main_~i~0 20), 26278#(<= main_~i~0 21), 26279#(<= main_~i~0 22), 26280#(<= main_~i~0 23), 26281#(<= main_~i~0 24), 26282#(<= main_~i~0 25), 26283#(<= main_~i~0 26), 26284#(<= main_~i~0 27), 26285#(<= main_~i~0 28), 26286#(<= main_~i~0 29), 26287#(<= main_~i~0 30), 26288#(<= main_~i~0 31), 26289#(<= main_~i~0 32), 26290#(<= main_~i~0 33), 26291#(<= main_~i~0 34), 26292#(<= main_~i~0 35), 26293#(<= main_~i~0 36), 26294#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 26295#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 26296#(and (<= 2 main_~i~0) (<= main_~i~0 38))] [2018-02-02 19:57:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:20,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:57:20,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:57:20,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:57:20,969 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 42 states. [2018-02-02 19:57:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:22,407 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-02-02 19:57:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 19:57:22,407 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 198 [2018-02-02 19:57:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:22,408 INFO L225 Difference]: With dead ends: 621 [2018-02-02 19:57:22,408 INFO L226 Difference]: Without dead ends: 621 [2018-02-02 19:57:22,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 19:57:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-02 19:57:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-02-02 19:57:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 19:57:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-02-02 19:57:22,413 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-02-02 19:57:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:22,414 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-02-02 19:57:22,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:57:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-02-02 19:57:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-02 19:57:22,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:22,415 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:22,415 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 683771407, now seen corresponding path program 39 times [2018-02-02 19:57:22,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:22,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:23,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:23,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 19:57:23,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:23,003 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 19:57:23,003 INFO L182 omatonBuilderFactory]: Interpolants [27584#(<= main_~i~0 10), 27585#(<= main_~i~0 11), 27586#(<= main_~i~0 12), 27587#(<= main_~i~0 13), 27588#(<= main_~i~0 14), 27589#(<= main_~i~0 15), 27590#(<= main_~i~0 16), 27591#(<= main_~i~0 17), 27592#(<= main_~i~0 18), 27593#(<= main_~i~0 19), 27594#(<= main_~i~0 20), 27595#(<= main_~i~0 21), 27596#(<= main_~i~0 22), 27597#(<= main_~i~0 23), 27598#(<= main_~i~0 24), 27599#(<= main_~i~0 25), 27600#(<= main_~i~0 26), 27601#(<= main_~i~0 27), 27602#(<= main_~i~0 28), 27603#(<= main_~i~0 29), 27604#(<= main_~i~0 30), 27605#(<= main_~i~0 31), 27606#(<= main_~i~0 32), 27607#(<= main_~i~0 33), 27608#(<= main_~i~0 34), 27609#(<= main_~i~0 35), 27610#(<= main_~i~0 36), 27611#(<= main_~i~0 37), 27612#(<= main_~i~0 38), 27613#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 27614#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 27572#true, 27573#false, 27574#(<= main_~i~0 0), 27575#(<= main_~i~0 1), 27576#(<= main_~i~0 2), 27577#(<= main_~i~0 3), 27578#(<= main_~i~0 4), 27579#(<= main_~i~0 5), 27580#(<= main_~i~0 6), 27581#(<= main_~i~0 7), 27582#(<= main_~i~0 8), 27583#(<= main_~i~0 9)] [2018-02-02 19:57:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:23,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 19:57:23,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 19:57:23,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:57:23,004 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 43 states. [2018-02-02 19:57:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:24,284 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-02-02 19:57:24,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 19:57:24,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 203 [2018-02-02 19:57:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:24,285 INFO L225 Difference]: With dead ends: 636 [2018-02-02 19:57:24,285 INFO L226 Difference]: Without dead ends: 636 [2018-02-02 19:57:24,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 19:57:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-02-02 19:57:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-02-02 19:57:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-02-02 19:57:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-02-02 19:57:24,293 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-02-02 19:57:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:24,293 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-02-02 19:57:24,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 19:57:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-02-02 19:57:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-02 19:57:24,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:24,295 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:24,295 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash -298402819, now seen corresponding path program 40 times [2018-02-02 19:57:24,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:24,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:24,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:24,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 19:57:24,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:24,785 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 19:57:24,785 INFO L182 omatonBuilderFactory]: Interpolants [28928#(<= main_~i~0 5), 28929#(<= main_~i~0 6), 28930#(<= main_~i~0 7), 28931#(<= main_~i~0 8), 28932#(<= main_~i~0 9), 28933#(<= main_~i~0 10), 28934#(<= main_~i~0 11), 28935#(<= main_~i~0 12), 28936#(<= main_~i~0 13), 28937#(<= main_~i~0 14), 28938#(<= main_~i~0 15), 28939#(<= main_~i~0 16), 28940#(<= main_~i~0 17), 28941#(<= main_~i~0 18), 28942#(<= main_~i~0 19), 28943#(<= main_~i~0 20), 28944#(<= main_~i~0 21), 28945#(<= main_~i~0 22), 28946#(<= main_~i~0 23), 28947#(<= main_~i~0 24), 28948#(<= main_~i~0 25), 28949#(<= main_~i~0 26), 28950#(<= main_~i~0 27), 28951#(<= main_~i~0 28), 28952#(<= main_~i~0 29), 28953#(<= main_~i~0 30), 28954#(<= main_~i~0 31), 28955#(<= main_~i~0 32), 28956#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 28957#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 28958#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 28959#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 28960#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 28961#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 28962#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 28963#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 28964#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 28921#true, 28922#false, 28923#(<= main_~i~0 0), 28924#(<= main_~i~0 1), 28925#(<= main_~i~0 2), 28926#(<= main_~i~0 3), 28927#(<= main_~i~0 4)] [2018-02-02 19:57:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:24,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 19:57:24,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 19:57:24,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:57:24,786 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 44 states. [2018-02-02 19:57:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:26,708 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-02-02 19:57:26,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 19:57:26,709 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-02-02 19:57:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:26,710 INFO L225 Difference]: With dead ends: 651 [2018-02-02 19:57:26,710 INFO L226 Difference]: Without dead ends: 651 [2018-02-02 19:57:26,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 19:57:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-02-02 19:57:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-02-02 19:57:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-02 19:57:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-02-02 19:57:26,714 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-02-02 19:57:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:26,715 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-02-02 19:57:26,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 19:57:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-02-02 19:57:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 19:57:26,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:26,716 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:26,716 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1356597967, now seen corresponding path program 41 times [2018-02-02 19:57:26,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:26,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:27,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:27,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 19:57:27,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:27,257 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 19:57:27,257 INFO L182 omatonBuilderFactory]: Interpolants [30336#(<= main_~i~0 32), 30337#(<= main_~i~0 33), 30338#(<= main_~i~0 34), 30339#(<= main_~i~0 35), 30340#(<= main_~i~0 36), 30341#(<= main_~i~0 37), 30342#(<= main_~i~0 38), 30343#(<= main_~i~0 39), 30344#(<= main_~i~0 40), 30345#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30346#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30302#true, 30303#false, 30304#(<= main_~i~0 0), 30305#(<= main_~i~0 1), 30306#(<= main_~i~0 2), 30307#(<= main_~i~0 3), 30308#(<= main_~i~0 4), 30309#(<= main_~i~0 5), 30310#(<= main_~i~0 6), 30311#(<= main_~i~0 7), 30312#(<= main_~i~0 8), 30313#(<= main_~i~0 9), 30314#(<= main_~i~0 10), 30315#(<= main_~i~0 11), 30316#(<= main_~i~0 12), 30317#(<= main_~i~0 13), 30318#(<= main_~i~0 14), 30319#(<= main_~i~0 15), 30320#(<= main_~i~0 16), 30321#(<= main_~i~0 17), 30322#(<= main_~i~0 18), 30323#(<= main_~i~0 19), 30324#(<= main_~i~0 20), 30325#(<= main_~i~0 21), 30326#(<= main_~i~0 22), 30327#(<= main_~i~0 23), 30328#(<= main_~i~0 24), 30329#(<= main_~i~0 25), 30330#(<= main_~i~0 26), 30331#(<= main_~i~0 27), 30332#(<= main_~i~0 28), 30333#(<= main_~i~0 29), 30334#(<= main_~i~0 30), 30335#(<= main_~i~0 31)] [2018-02-02 19:57:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:27,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 19:57:27,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 19:57:27,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:57:27,258 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 45 states. [2018-02-02 19:57:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:28,627 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-02-02 19:57:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 19:57:28,627 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-02-02 19:57:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:28,629 INFO L225 Difference]: With dead ends: 666 [2018-02-02 19:57:28,629 INFO L226 Difference]: Without dead ends: 666 [2018-02-02 19:57:28,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 19:57:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-02 19:57:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-02-02 19:57:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-02 19:57:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-02-02 19:57:28,633 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-02-02 19:57:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:28,633 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-02-02 19:57:28,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 19:57:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-02-02 19:57:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-02-02 19:57:28,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:28,634 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:28,634 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:28,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1303457597, now seen corresponding path program 42 times [2018-02-02 19:57:28,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:28,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:29,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:29,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 19:57:29,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:29,162 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 19:57:29,162 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 27), 31745#(<= main_~i~0 28), 31746#(<= main_~i~0 29), 31747#(<= main_~i~0 30), 31748#(<= main_~i~0 31), 31749#(<= main_~i~0 32), 31750#(<= main_~i~0 33), 31751#(<= main_~i~0 34), 31752#(<= main_~i~0 35), 31753#(<= main_~i~0 36), 31754#(<= main_~i~0 37), 31755#(<= main_~i~0 38), 31756#(<= main_~i~0 39), 31757#(<= main_~i~0 40), 31758#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 31759#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 31760#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 31715#true, 31716#false, 31717#(<= main_~i~0 0), 31718#(<= main_~i~0 1), 31719#(<= main_~i~0 2), 31720#(<= main_~i~0 3), 31721#(<= main_~i~0 4), 31722#(<= main_~i~0 5), 31723#(<= main_~i~0 6), 31724#(<= main_~i~0 7), 31725#(<= main_~i~0 8), 31726#(<= main_~i~0 9), 31727#(<= main_~i~0 10), 31728#(<= main_~i~0 11), 31729#(<= main_~i~0 12), 31730#(<= main_~i~0 13), 31731#(<= main_~i~0 14), 31732#(<= main_~i~0 15), 31733#(<= main_~i~0 16), 31734#(<= main_~i~0 17), 31735#(<= main_~i~0 18), 31736#(<= main_~i~0 19), 31737#(<= main_~i~0 20), 31738#(<= main_~i~0 21), 31739#(<= main_~i~0 22), 31740#(<= main_~i~0 23), 31741#(<= main_~i~0 24), 31742#(<= main_~i~0 25), 31743#(<= main_~i~0 26)] [2018-02-02 19:57:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:29,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 19:57:29,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 19:57:29,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:57:29,163 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 46 states. [2018-02-02 19:57:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:30,639 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-02-02 19:57:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 19:57:30,639 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 218 [2018-02-02 19:57:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:30,641 INFO L225 Difference]: With dead ends: 681 [2018-02-02 19:57:30,641 INFO L226 Difference]: Without dead ends: 681 [2018-02-02 19:57:30,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-02-02 19:57:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-02 19:57:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-02-02 19:57:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-02 19:57:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-02-02 19:57:30,645 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-02-02 19:57:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:30,646 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-02-02 19:57:30,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 19:57:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-02-02 19:57:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-02 19:57:30,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:30,647 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:30,647 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash 942120847, now seen corresponding path program 43 times [2018-02-02 19:57:30,647 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:30,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:31,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:31,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 19:57:31,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:31,195 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 19:57:31,196 INFO L182 omatonBuilderFactory]: Interpolants [33160#true, 33161#false, 33162#(<= main_~i~0 0), 33163#(<= main_~i~0 1), 33164#(<= main_~i~0 2), 33165#(<= main_~i~0 3), 33166#(<= main_~i~0 4), 33167#(<= main_~i~0 5), 33168#(<= main_~i~0 6), 33169#(<= main_~i~0 7), 33170#(<= main_~i~0 8), 33171#(<= main_~i~0 9), 33172#(<= main_~i~0 10), 33173#(<= main_~i~0 11), 33174#(<= main_~i~0 12), 33175#(<= main_~i~0 13), 33176#(<= main_~i~0 14), 33177#(<= main_~i~0 15), 33178#(<= main_~i~0 16), 33179#(<= main_~i~0 17), 33180#(<= main_~i~0 18), 33181#(<= main_~i~0 19), 33182#(<= main_~i~0 20), 33183#(<= main_~i~0 21), 33184#(<= main_~i~0 22), 33185#(<= main_~i~0 23), 33186#(<= main_~i~0 24), 33187#(<= main_~i~0 25), 33188#(<= main_~i~0 26), 33189#(<= main_~i~0 27), 33190#(<= main_~i~0 28), 33191#(<= main_~i~0 29), 33192#(<= main_~i~0 30), 33193#(<= main_~i~0 31), 33194#(<= main_~i~0 32), 33195#(<= main_~i~0 33), 33196#(<= main_~i~0 34), 33197#(<= main_~i~0 35), 33198#(<= main_~i~0 36), 33199#(<= main_~i~0 37), 33200#(<= main_~i~0 38), 33201#(<= main_~i~0 39), 33202#(<= main_~i~0 40), 33203#(<= main_~i~0 41), 33204#(<= main_~i~0 42), 33205#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 33206#(and (<= 1 main_~i~0) (<= main_~i~0 43))] [2018-02-02 19:57:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:31,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 19:57:31,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 19:57:31,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:57:31,196 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-02-02 19:57:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:32,823 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-02-02 19:57:32,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 19:57:32,824 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-02-02 19:57:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:32,825 INFO L225 Difference]: With dead ends: 696 [2018-02-02 19:57:32,826 INFO L226 Difference]: Without dead ends: 696 [2018-02-02 19:57:32,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 19:57:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-02 19:57:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-02-02 19:57:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-02-02 19:57:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-02-02 19:57:32,831 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-02-02 19:57:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:32,831 INFO L432 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-02-02 19:57:32,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 19:57:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-02-02 19:57:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-02 19:57:32,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:32,833 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:32,833 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 304386685, now seen corresponding path program 44 times [2018-02-02 19:57:32,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:32,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:33,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:33,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 19:57:33,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:33,585 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 19:57:33,586 INFO L182 omatonBuilderFactory]: Interpolants [34637#true, 34638#false, 34639#(<= main_~i~0 0), 34640#(<= main_~i~0 1), 34641#(<= main_~i~0 2), 34642#(<= main_~i~0 3), 34643#(<= main_~i~0 4), 34644#(<= main_~i~0 5), 34645#(<= main_~i~0 6), 34646#(<= main_~i~0 7), 34647#(<= main_~i~0 8), 34648#(<= main_~i~0 9), 34649#(<= main_~i~0 10), 34650#(<= main_~i~0 11), 34651#(<= main_~i~0 12), 34652#(<= main_~i~0 13), 34653#(<= main_~i~0 14), 34654#(<= main_~i~0 15), 34655#(<= main_~i~0 16), 34656#(<= main_~i~0 17), 34657#(<= main_~i~0 18), 34658#(<= main_~i~0 19), 34659#(<= main_~i~0 20), 34660#(<= main_~i~0 21), 34661#(<= main_~i~0 22), 34662#(<= main_~i~0 23), 34663#(<= main_~i~0 24), 34664#(<= main_~i~0 25), 34665#(<= main_~i~0 26), 34666#(<= main_~i~0 27), 34667#(<= main_~i~0 28), 34668#(<= main_~i~0 29), 34669#(<= main_~i~0 30), 34670#(<= main_~i~0 31), 34671#(<= main_~i~0 32), 34672#(<= main_~i~0 33), 34673#(<= main_~i~0 34), 34674#(<= main_~i~0 35), 34675#(<= main_~i~0 36), 34676#(<= main_~i~0 37), 34677#(<= main_~i~0 38), 34678#(<= main_~i~0 39), 34679#(<= main_~i~0 40), 34680#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 34681#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 34682#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 34683#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 34684#(and (<= main_~i~0 44) (<= 4 main_~i~0))] [2018-02-02 19:57:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:33,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 19:57:33,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 19:57:33,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 19:57:33,586 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 48 states. [2018-02-02 19:57:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:35,502 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-02-02 19:57:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 19:57:35,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2018-02-02 19:57:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:35,504 INFO L225 Difference]: With dead ends: 711 [2018-02-02 19:57:35,504 INFO L226 Difference]: Without dead ends: 711 [2018-02-02 19:57:35,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-02-02 19:57:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-02 19:57:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-02-02 19:57:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-02 19:57:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-02-02 19:57:35,510 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-02-02 19:57:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:35,510 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-02-02 19:57:35,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 19:57:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-02-02 19:57:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-02 19:57:35,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:35,511 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:35,511 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1601158065, now seen corresponding path program 45 times [2018-02-02 19:57:35,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:35,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:36,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:36,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 19:57:36,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:36,152 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 19:57:36,152 INFO L182 omatonBuilderFactory]: Interpolants [36146#true, 36147#false, 36148#(<= main_~i~0 0), 36149#(<= main_~i~0 1), 36150#(<= main_~i~0 2), 36151#(<= main_~i~0 3), 36152#(<= main_~i~0 4), 36153#(<= main_~i~0 5), 36154#(<= main_~i~0 6), 36155#(<= main_~i~0 7), 36156#(<= main_~i~0 8), 36157#(<= main_~i~0 9), 36158#(<= main_~i~0 10), 36159#(<= main_~i~0 11), 36160#(<= main_~i~0 12), 36161#(<= main_~i~0 13), 36162#(<= main_~i~0 14), 36163#(<= main_~i~0 15), 36164#(<= main_~i~0 16), 36165#(<= main_~i~0 17), 36166#(<= main_~i~0 18), 36167#(<= main_~i~0 19), 36168#(<= main_~i~0 20), 36169#(<= main_~i~0 21), 36170#(<= main_~i~0 22), 36171#(<= main_~i~0 23), 36172#(<= main_~i~0 24), 36173#(<= main_~i~0 25), 36174#(<= main_~i~0 26), 36175#(<= main_~i~0 27), 36176#(<= main_~i~0 28), 36177#(<= main_~i~0 29), 36178#(<= main_~i~0 30), 36179#(<= main_~i~0 31), 36180#(<= main_~i~0 32), 36181#(<= main_~i~0 33), 36182#(<= main_~i~0 34), 36183#(<= main_~i~0 35), 36184#(<= main_~i~0 36), 36185#(<= main_~i~0 37), 36186#(<= main_~i~0 38), 36187#(<= main_~i~0 39), 36188#(<= main_~i~0 40), 36189#(<= main_~i~0 41), 36190#(<= main_~i~0 42), 36191#(<= main_~i~0 43), 36192#(<= main_~i~0 44), 36193#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 36194#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-02-02 19:57:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:36,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 19:57:36,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 19:57:36,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:57:36,153 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 49 states. [2018-02-02 19:57:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:37,745 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-02-02 19:57:37,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 19:57:37,745 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 233 [2018-02-02 19:57:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:37,747 INFO L225 Difference]: With dead ends: 726 [2018-02-02 19:57:37,747 INFO L226 Difference]: Without dead ends: 726 [2018-02-02 19:57:37,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 19:57:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-02-02 19:57:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-02-02 19:57:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-02-02 19:57:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-02-02 19:57:37,754 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-02-02 19:57:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:37,754 INFO L432 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-02-02 19:57:37,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 19:57:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-02-02 19:57:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-02 19:57:37,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:37,758 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:37,758 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:37,758 INFO L82 PathProgramCache]: Analyzing trace with hash -853219907, now seen corresponding path program 46 times [2018-02-02 19:57:37,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:37,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:38,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:38,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 19:57:38,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:38,461 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 19:57:38,461 INFO L182 omatonBuilderFactory]: Interpolants [37687#true, 37688#false, 37689#(<= main_~i~0 0), 37690#(<= main_~i~0 1), 37691#(<= main_~i~0 2), 37692#(<= main_~i~0 3), 37693#(<= main_~i~0 4), 37694#(<= main_~i~0 5), 37695#(<= main_~i~0 6), 37696#(<= main_~i~0 7), 37697#(<= main_~i~0 8), 37698#(<= main_~i~0 9), 37699#(<= main_~i~0 10), 37700#(<= main_~i~0 11), 37701#(<= main_~i~0 12), 37702#(<= main_~i~0 13), 37703#(<= main_~i~0 14), 37704#(<= main_~i~0 15), 37705#(<= main_~i~0 16), 37706#(<= main_~i~0 17), 37707#(<= main_~i~0 18), 37708#(<= main_~i~0 19), 37709#(<= main_~i~0 20), 37710#(<= main_~i~0 21), 37711#(<= main_~i~0 22), 37712#(<= main_~i~0 23), 37713#(<= main_~i~0 24), 37714#(<= main_~i~0 25), 37715#(<= main_~i~0 26), 37716#(<= main_~i~0 27), 37717#(<= main_~i~0 28), 37718#(<= main_~i~0 29), 37719#(<= main_~i~0 30), 37720#(<= main_~i~0 31), 37721#(<= main_~i~0 32), 37722#(<= main_~i~0 33), 37723#(<= main_~i~0 34), 37724#(<= main_~i~0 35), 37725#(<= main_~i~0 36), 37726#(<= main_~i~0 37), 37727#(<= main_~i~0 38), 37728#(<= main_~i~0 39), 37729#(<= main_~i~0 40), 37730#(<= main_~i~0 41), 37731#(<= main_~i~0 42), 37732#(<= main_~i~0 43), 37733#(<= main_~i~0 44), 37734#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 37735#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 37736#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-02-02 19:57:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:38,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 19:57:38,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 19:57:38,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 19:57:38,462 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 50 states. [2018-02-02 19:57:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:40,277 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-02-02 19:57:40,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 19:57:40,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 238 [2018-02-02 19:57:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:40,279 INFO L225 Difference]: With dead ends: 741 [2018-02-02 19:57:40,279 INFO L226 Difference]: Without dead ends: 741 [2018-02-02 19:57:40,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-02 19:57:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-02-02 19:57:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-02-02 19:57:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-02-02 19:57:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-02-02 19:57:40,284 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-02-02 19:57:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:40,284 INFO L432 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-02-02 19:57:40,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 19:57:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-02-02 19:57:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-02 19:57:40,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:40,285 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:40,285 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -721290993, now seen corresponding path program 47 times [2018-02-02 19:57:40,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:40,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:40,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:40,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 19:57:40,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:40,963 INFO L182 omatonBuilderFactory]: Interpolants [39296#(<= main_~i~0 34), 39297#(<= main_~i~0 35), 39298#(<= main_~i~0 36), 39299#(<= main_~i~0 37), 39300#(<= main_~i~0 38), 39301#(<= main_~i~0 39), 39302#(<= main_~i~0 40), 39303#(<= main_~i~0 41), 39304#(<= main_~i~0 42), 39305#(<= main_~i~0 43), 39306#(<= main_~i~0 44), 39307#(<= main_~i~0 45), 39308#(<= main_~i~0 46), 39309#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 39310#(and (<= 1 main_~i~0) (<= main_~i~0 47)), 39260#true, 39261#false, 39262#(<= main_~i~0 0), 39263#(<= main_~i~0 1), 39264#(<= main_~i~0 2), 39265#(<= main_~i~0 3), 39266#(<= main_~i~0 4), 39267#(<= main_~i~0 5), 39268#(<= main_~i~0 6), 39269#(<= main_~i~0 7), 39270#(<= main_~i~0 8), 39271#(<= main_~i~0 9), 39272#(<= main_~i~0 10), 39273#(<= main_~i~0 11), 39274#(<= main_~i~0 12), 39275#(<= main_~i~0 13), 39276#(<= main_~i~0 14), 39277#(<= main_~i~0 15), 39278#(<= main_~i~0 16), 39279#(<= main_~i~0 17), 39280#(<= main_~i~0 18), 39281#(<= main_~i~0 19), 39282#(<= main_~i~0 20), 39283#(<= main_~i~0 21), 39284#(<= main_~i~0 22), 39285#(<= main_~i~0 23), 39286#(<= main_~i~0 24), 39287#(<= main_~i~0 25), 39288#(<= main_~i~0 26), 39289#(<= main_~i~0 27), 39290#(<= main_~i~0 28), 39291#(<= main_~i~0 29), 39292#(<= main_~i~0 30), 39293#(<= main_~i~0 31), 39294#(<= main_~i~0 32), 39295#(<= main_~i~0 33)] [2018-02-02 19:57:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:40,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 19:57:40,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 19:57:40,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 19:57:40,963 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 51 states. [2018-02-02 19:57:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:42,732 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-02-02 19:57:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 19:57:42,732 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 243 [2018-02-02 19:57:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:42,734 INFO L225 Difference]: With dead ends: 756 [2018-02-02 19:57:42,734 INFO L226 Difference]: Without dead ends: 756 [2018-02-02 19:57:42,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-02-02 19:57:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-02 19:57:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-02-02 19:57:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-02-02 19:57:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-02-02 19:57:42,739 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-02-02 19:57:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:42,740 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-02-02 19:57:42,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 19:57:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-02-02 19:57:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-02 19:57:42,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:42,741 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:42,741 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 658909437, now seen corresponding path program 48 times [2018-02-02 19:57:42,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:42,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:43,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:43,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 19:57:43,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:43,574 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 19:57:43,575 INFO L182 omatonBuilderFactory]: Interpolants [40865#true, 40866#false, 40867#(<= main_~i~0 0), 40868#(<= main_~i~0 1), 40869#(<= main_~i~0 2), 40870#(<= main_~i~0 3), 40871#(<= main_~i~0 4), 40872#(<= main_~i~0 5), 40873#(<= main_~i~0 6), 40874#(<= main_~i~0 7), 40875#(<= main_~i~0 8), 40876#(<= main_~i~0 9), 40877#(<= main_~i~0 10), 40878#(<= main_~i~0 11), 40879#(<= main_~i~0 12), 40880#(<= main_~i~0 13), 40881#(<= main_~i~0 14), 40882#(<= main_~i~0 15), 40883#(<= main_~i~0 16), 40884#(<= main_~i~0 17), 40885#(<= main_~i~0 18), 40886#(<= main_~i~0 19), 40887#(<= main_~i~0 20), 40888#(<= main_~i~0 21), 40889#(<= main_~i~0 22), 40890#(<= main_~i~0 23), 40891#(<= main_~i~0 24), 40892#(<= main_~i~0 25), 40893#(<= main_~i~0 26), 40894#(<= main_~i~0 27), 40895#(<= main_~i~0 28), 40896#(<= main_~i~0 29), 40897#(<= main_~i~0 30), 40898#(<= main_~i~0 31), 40899#(<= main_~i~0 32), 40900#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 40901#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 40902#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 40903#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 40904#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 40905#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 40906#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 40907#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 40908#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 40909#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 40910#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 40911#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 40912#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 40913#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 40914#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 40915#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 40916#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-02-02 19:57:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:43,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 19:57:43,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 19:57:43,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 19:57:43,575 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 52 states. [2018-02-02 19:57:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:47,468 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-02-02 19:57:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 19:57:47,468 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 248 [2018-02-02 19:57:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:47,469 INFO L225 Difference]: With dead ends: 771 [2018-02-02 19:57:47,470 INFO L226 Difference]: Without dead ends: 771 [2018-02-02 19:57:47,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-02-02 19:57:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-02 19:57:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-02-02 19:57:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-02-02 19:57:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-02-02 19:57:47,475 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-02-02 19:57:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:47,475 INFO L432 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-02-02 19:57:47,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 19:57:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-02-02 19:57:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-02 19:57:47,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:47,476 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:47,476 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1768472015, now seen corresponding path program 49 times [2018-02-02 19:57:47,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:47,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:48,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:48,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 19:57:48,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:48,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 19:57:48,189 INFO L182 omatonBuilderFactory]: Interpolants [42502#true, 42503#false, 42504#(<= main_~i~0 0), 42505#(<= main_~i~0 1), 42506#(<= main_~i~0 2), 42507#(<= main_~i~0 3), 42508#(<= main_~i~0 4), 42509#(<= main_~i~0 5), 42510#(<= main_~i~0 6), 42511#(<= main_~i~0 7), 42512#(<= main_~i~0 8), 42513#(<= main_~i~0 9), 42514#(<= main_~i~0 10), 42515#(<= main_~i~0 11), 42516#(<= main_~i~0 12), 42517#(<= main_~i~0 13), 42518#(<= main_~i~0 14), 42519#(<= main_~i~0 15), 42520#(<= main_~i~0 16), 42521#(<= main_~i~0 17), 42522#(<= main_~i~0 18), 42523#(<= main_~i~0 19), 42524#(<= main_~i~0 20), 42525#(<= main_~i~0 21), 42526#(<= main_~i~0 22), 42527#(<= main_~i~0 23), 42528#(<= main_~i~0 24), 42529#(<= main_~i~0 25), 42530#(<= main_~i~0 26), 42531#(<= main_~i~0 27), 42532#(<= main_~i~0 28), 42533#(<= main_~i~0 29), 42534#(<= main_~i~0 30), 42535#(<= main_~i~0 31), 42536#(<= main_~i~0 32), 42537#(<= main_~i~0 33), 42538#(<= main_~i~0 34), 42539#(<= main_~i~0 35), 42540#(<= main_~i~0 36), 42541#(<= main_~i~0 37), 42542#(<= main_~i~0 38), 42543#(<= main_~i~0 39), 42544#(<= main_~i~0 40), 42545#(<= main_~i~0 41), 42546#(<= main_~i~0 42), 42547#(<= main_~i~0 43), 42548#(<= main_~i~0 44), 42549#(<= main_~i~0 45), 42550#(<= main_~i~0 46), 42551#(<= main_~i~0 47), 42552#(<= main_~i~0 48), 42553#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 42554#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-02-02 19:57:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:48,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 19:57:48,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 19:57:48,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 19:57:48,190 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-02-02 19:57:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:50,195 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-02-02 19:57:50,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 19:57:50,195 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-02-02 19:57:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:50,197 INFO L225 Difference]: With dead ends: 786 [2018-02-02 19:57:50,197 INFO L226 Difference]: Without dead ends: 786 [2018-02-02 19:57:50,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-02 19:57:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-02-02 19:57:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-02-02 19:57:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-02-02 19:57:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-02-02 19:57:50,203 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-02-02 19:57:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:50,203 INFO L432 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-02-02 19:57:50,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 19:57:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-02-02 19:57:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-02 19:57:50,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:50,205 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:50,205 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash 538729533, now seen corresponding path program 50 times [2018-02-02 19:57:50,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:50,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:51,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:51,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 19:57:51,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:51,022 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 19:57:51,022 INFO L182 omatonBuilderFactory]: Interpolants [44171#true, 44172#false, 44173#(<= main_~i~0 0), 44174#(<= main_~i~0 1), 44175#(<= main_~i~0 2), 44176#(<= main_~i~0 3), 44177#(<= main_~i~0 4), 44178#(<= main_~i~0 5), 44179#(<= main_~i~0 6), 44180#(<= main_~i~0 7), 44181#(<= main_~i~0 8), 44182#(<= main_~i~0 9), 44183#(<= main_~i~0 10), 44184#(<= main_~i~0 11), 44185#(<= main_~i~0 12), 44186#(<= main_~i~0 13), 44187#(<= main_~i~0 14), 44188#(<= main_~i~0 15), 44189#(<= main_~i~0 16), 44190#(<= main_~i~0 17), 44191#(<= main_~i~0 18), 44192#(<= main_~i~0 19), 44193#(<= main_~i~0 20), 44194#(<= main_~i~0 21), 44195#(<= main_~i~0 22), 44196#(<= main_~i~0 23), 44197#(<= main_~i~0 24), 44198#(<= main_~i~0 25), 44199#(<= main_~i~0 26), 44200#(<= main_~i~0 27), 44201#(<= main_~i~0 28), 44202#(<= main_~i~0 29), 44203#(<= main_~i~0 30), 44204#(<= main_~i~0 31), 44205#(<= main_~i~0 32), 44206#(<= main_~i~0 33), 44207#(<= main_~i~0 34), 44208#(<= main_~i~0 35), 44209#(<= main_~i~0 36), 44210#(<= main_~i~0 37), 44211#(<= main_~i~0 38), 44212#(<= main_~i~0 39), 44213#(<= main_~i~0 40), 44214#(<= main_~i~0 41), 44215#(<= main_~i~0 42), 44216#(<= main_~i~0 43), 44217#(<= main_~i~0 44), 44218#(<= main_~i~0 45), 44219#(<= main_~i~0 46), 44220#(<= main_~i~0 47), 44221#(<= main_~i~0 48), 44222#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 44223#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 44224#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-02-02 19:57:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:51,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 19:57:51,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 19:57:51,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 19:57:51,023 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 54 states. [2018-02-02 19:57:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:53,267 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-02-02 19:57:53,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 19:57:53,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 258 [2018-02-02 19:57:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:53,300 INFO L225 Difference]: With dead ends: 801 [2018-02-02 19:57:53,300 INFO L226 Difference]: Without dead ends: 801 [2018-02-02 19:57:53,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-02-02 19:57:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-02-02 19:57:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-02-02 19:57:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-02 19:57:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-02-02 19:57:53,310 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-02-02 19:57:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:53,311 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-02-02 19:57:53,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 19:57:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-02-02 19:57:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-02 19:57:53,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:53,313 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:53,313 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -89091441, now seen corresponding path program 51 times [2018-02-02 19:57:53,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:53,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:54,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:54,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 19:57:54,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:54,126 INFO L182 omatonBuilderFactory]: Interpolants [45872#true, 45873#false, 45874#(<= main_~i~0 0), 45875#(<= main_~i~0 1), 45876#(<= main_~i~0 2), 45877#(<= main_~i~0 3), 45878#(<= main_~i~0 4), 45879#(<= main_~i~0 5), 45880#(<= main_~i~0 6), 45881#(<= main_~i~0 7), 45882#(<= main_~i~0 8), 45883#(<= main_~i~0 9), 45884#(<= main_~i~0 10), 45885#(<= main_~i~0 11), 45886#(<= main_~i~0 12), 45887#(<= main_~i~0 13), 45888#(<= main_~i~0 14), 45889#(<= main_~i~0 15), 45890#(<= main_~i~0 16), 45891#(<= main_~i~0 17), 45892#(<= main_~i~0 18), 45893#(<= main_~i~0 19), 45894#(<= main_~i~0 20), 45895#(<= main_~i~0 21), 45896#(<= main_~i~0 22), 45897#(<= main_~i~0 23), 45898#(<= main_~i~0 24), 45899#(<= main_~i~0 25), 45900#(<= main_~i~0 26), 45901#(<= main_~i~0 27), 45902#(<= main_~i~0 28), 45903#(<= main_~i~0 29), 45904#(<= main_~i~0 30), 45905#(<= main_~i~0 31), 45906#(<= main_~i~0 32), 45907#(<= main_~i~0 33), 45908#(<= main_~i~0 34), 45909#(<= main_~i~0 35), 45910#(<= main_~i~0 36), 45911#(<= main_~i~0 37), 45912#(<= main_~i~0 38), 45913#(<= main_~i~0 39), 45914#(<= main_~i~0 40), 45915#(<= main_~i~0 41), 45916#(<= main_~i~0 42), 45917#(<= main_~i~0 43), 45918#(<= main_~i~0 44), 45919#(<= main_~i~0 45), 45920#(<= main_~i~0 46), 45921#(<= main_~i~0 47), 45922#(<= main_~i~0 48), 45923#(<= main_~i~0 49), 45924#(<= main_~i~0 50), 45925#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 45926#(and (<= 1 main_~i~0) (<= main_~i~0 51))] [2018-02-02 19:57:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:54,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 19:57:54,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 19:57:54,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:57:54,127 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 55 states. [2018-02-02 19:57:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:56,284 INFO L93 Difference]: Finished difference Result 816 states and 1080 transitions. [2018-02-02 19:57:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 19:57:56,285 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 263 [2018-02-02 19:57:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:56,287 INFO L225 Difference]: With dead ends: 816 [2018-02-02 19:57:56,287 INFO L226 Difference]: Without dead ends: 816 [2018-02-02 19:57:56,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-02-02 19:57:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-02-02 19:57:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 760. [2018-02-02 19:57:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-02-02 19:57:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1022 transitions. [2018-02-02 19:57:56,293 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1022 transitions. Word has length 263 [2018-02-02 19:57:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:56,293 INFO L432 AbstractCegarLoop]: Abstraction has 760 states and 1022 transitions. [2018-02-02 19:57:56,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 19:57:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1022 transitions. [2018-02-02 19:57:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-02-02 19:57:56,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:56,295 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:56,295 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1312522109, now seen corresponding path program 52 times [2018-02-02 19:57:56,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:56,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:57:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:57,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:57:57,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 19:57:57,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:57:57,166 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 19:57:57,166 INFO L182 omatonBuilderFactory]: Interpolants [47616#(<= main_~i~0 9), 47617#(<= main_~i~0 10), 47618#(<= main_~i~0 11), 47619#(<= main_~i~0 12), 47620#(<= main_~i~0 13), 47621#(<= main_~i~0 14), 47622#(<= main_~i~0 15), 47623#(<= main_~i~0 16), 47624#(<= main_~i~0 17), 47625#(<= main_~i~0 18), 47626#(<= main_~i~0 19), 47627#(<= main_~i~0 20), 47628#(<= main_~i~0 21), 47629#(<= main_~i~0 22), 47630#(<= main_~i~0 23), 47631#(<= main_~i~0 24), 47632#(<= main_~i~0 25), 47633#(<= main_~i~0 26), 47634#(<= main_~i~0 27), 47635#(<= main_~i~0 28), 47636#(<= main_~i~0 29), 47637#(<= main_~i~0 30), 47638#(<= main_~i~0 31), 47639#(<= main_~i~0 32), 47640#(<= main_~i~0 33), 47641#(<= main_~i~0 34), 47642#(<= main_~i~0 35), 47643#(<= main_~i~0 36), 47644#(<= main_~i~0 37), 47645#(<= main_~i~0 38), 47646#(<= main_~i~0 39), 47647#(<= main_~i~0 40), 47648#(<= main_~i~0 41), 47649#(<= main_~i~0 42), 47650#(<= main_~i~0 43), 47651#(<= main_~i~0 44), 47652#(<= main_~i~0 45), 47653#(<= main_~i~0 46), 47654#(<= main_~i~0 47), 47655#(<= main_~i~0 48), 47656#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 47657#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 47658#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 47659#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 47660#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 47605#true, 47606#false, 47607#(<= main_~i~0 0), 47608#(<= main_~i~0 1), 47609#(<= main_~i~0 2), 47610#(<= main_~i~0 3), 47611#(<= main_~i~0 4), 47612#(<= main_~i~0 5), 47613#(<= main_~i~0 6), 47614#(<= main_~i~0 7), 47615#(<= main_~i~0 8)] [2018-02-02 19:57:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:57:57,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 19:57:57,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 19:57:57,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 19:57:57,167 INFO L87 Difference]: Start difference. First operand 760 states and 1022 transitions. Second operand 56 states. [2018-02-02 19:57:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:57:59,587 INFO L93 Difference]: Finished difference Result 831 states and 1100 transitions. [2018-02-02 19:57:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 19:57:59,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 268 [2018-02-02 19:57:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:57:59,589 INFO L225 Difference]: With dead ends: 831 [2018-02-02 19:57:59,589 INFO L226 Difference]: Without dead ends: 831 [2018-02-02 19:57:59,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-02-02 19:57:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-02-02 19:57:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 774. [2018-02-02 19:57:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-02-02 19:57:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1041 transitions. [2018-02-02 19:57:59,596 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1041 transitions. Word has length 268 [2018-02-02 19:57:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:57:59,596 INFO L432 AbstractCegarLoop]: Abstraction has 774 states and 1041 transitions. [2018-02-02 19:57:59,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 19:57:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2018-02-02 19:57:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-02 19:57:59,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:57:59,598 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-02 19:57:59,598 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 19:57:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash -289048753, now seen corresponding path program 53 times [2018-02-02 19:57:59,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:57:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:57:59,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:00,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:00,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-02 19:58:00,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:00,451 INFO L182 omatonBuilderFactory]: Interpolants [49408#(<= main_~i~0 36), 49409#(<= main_~i~0 37), 49410#(<= main_~i~0 38), 49411#(<= main_~i~0 39), 49412#(<= main_~i~0 40), 49413#(<= main_~i~0 41), 49414#(<= main_~i~0 42), 49415#(<= main_~i~0 43), 49416#(<= main_~i~0 44), 49417#(<= main_~i~0 45), 49418#(<= main_~i~0 46), 49419#(<= main_~i~0 47), 49420#(<= main_~i~0 48), 49421#(<= main_~i~0 49), 49422#(<= main_~i~0 50), 49423#(<= main_~i~0 51), 49424#(<= main_~i~0 52), 49425#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 49426#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 49370#true, 49371#false, 49372#(<= main_~i~0 0), 49373#(<= main_~i~0 1), 49374#(<= main_~i~0 2), 49375#(<= main_~i~0 3), 49376#(<= main_~i~0 4), 49377#(<= main_~i~0 5), 49378#(<= main_~i~0 6), 49379#(<= main_~i~0 7), 49380#(<= main_~i~0 8), 49381#(<= main_~i~0 9), 49382#(<= main_~i~0 10), 49383#(<= main_~i~0 11), 49384#(<= main_~i~0 12), 49385#(<= main_~i~0 13), 49386#(<= main_~i~0 14), 49387#(<= main_~i~0 15), 49388#(<= main_~i~0 16), 49389#(<= main_~i~0 17), 49390#(<= main_~i~0 18), 49391#(<= main_~i~0 19), 49392#(<= main_~i~0 20), 49393#(<= main_~i~0 21), 49394#(<= main_~i~0 22), 49395#(<= main_~i~0 23), 49396#(<= main_~i~0 24), 49397#(<= main_~i~0 25), 49398#(<= main_~i~0 26), 49399#(<= main_~i~0 27), 49400#(<= main_~i~0 28), 49401#(<= main_~i~0 29), 49402#(<= main_~i~0 30), 49403#(<= main_~i~0 31), 49404#(<= main_~i~0 32), 49405#(<= main_~i~0 33), 49406#(<= main_~i~0 34), 49407#(<= main_~i~0 35)] [2018-02-02 19:58:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:00,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 19:58:00,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 19:58:00,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 19:58:00,452 INFO L87 Difference]: Start difference. First operand 774 states and 1041 transitions. Second operand 57 states. Received shutdown request... [2018-02-02 19:58:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:58:01,151 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:58:01,155 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:58:01,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:58:01 BoogieIcfgContainer [2018-02-02 19:58:01,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:58:01,156 INFO L168 Benchmark]: Toolchain (without parser) took 79605.71 ms. Allocated memory was 397.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 355.6 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 66.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:58:01,157 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:58:01,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.24 ms. Allocated memory is still 397.4 MB. Free memory was 355.6 MB in the beginning and 347.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:58:01,157 INFO L168 Benchmark]: Boogie Preprocessor took 20.51 ms. Allocated memory is still 397.4 MB. Free memory was 347.5 MB in the beginning and 346.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:58:01,158 INFO L168 Benchmark]: RCFGBuilder took 158.98 ms. Allocated memory is still 397.4 MB. Free memory was 346.1 MB in the beginning and 330.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:58:01,158 INFO L168 Benchmark]: TraceAbstraction took 79297.48 ms. Allocated memory was 397.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 330.8 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 41.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:58:01,159 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.09 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 126.24 ms. Allocated memory is still 397.4 MB. Free memory was 355.6 MB in the beginning and 347.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.51 ms. Allocated memory is still 397.4 MB. Free memory was 347.5 MB in the beginning and 346.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 158.98 ms. Allocated memory is still 397.4 MB. Free memory was 346.1 MB in the beginning and 330.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 79297.48 ms. Allocated memory was 397.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 330.8 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 41.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (774states) and interpolant automaton (currently 28 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (774states) and interpolant automaton (currently 28 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (774states) and interpolant automaton (currently 28 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (774states) and interpolant automaton (currently 28 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 79.2s OverallTime, 54 OverallIterations, 54 TraceHistogramMax, 58.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5163 SDtfs, 61039 SDslu, 37312 SDs, 0 SdLazy, 96470 SolverSat, 22419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2927 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2873 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27421 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/128313 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 1643 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 7587 NumberOfCodeBlocks, 7587 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 7533 ConstructedInterpolants, 0 QuantifiedInterpolants, 4585437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 1 PerfectInterpolantSequences, 0/128313 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/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-58-01-164.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-58-01-164.csv Completed graceful shutdown