java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:37:14,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:37:14,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:37:14,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:37:14,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:37:14,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:37:14,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:37:14,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:37:14,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:37:14,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:37:14,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:37:14,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:37:14,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:37:14,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:37:14,116 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:37:14,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:37:14,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:37:14,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:37:14,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:37:14,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:37:14,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:37:14,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:37:14,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:37:14,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:37:14,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:37:14,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:37:14,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:37:14,129 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:37:14,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:37:14,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:37:14,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:37:14,130 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:37:14,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:37:14,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:37:14,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:37:14,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:37:14,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:37:14,140 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:37:14,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:37:14,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:14,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:37:14,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:37:14,142 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:37:14,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:37:14,180 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:37:14,182 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:37:14,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:37:14,184 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:37:14,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-02-02 10:37:14,276 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:37:14,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:37:14,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:14,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:37:14,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:37:14,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8b24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14, skipping insertion in model container [2018-02-02 10:37:14,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,301 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:14,317 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:14,415 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:14,423 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:14,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14 WrapperNode [2018-02-02 10:37:14,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:14,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:37:14,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:37:14,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:37:14,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... [2018-02-02 10:37:14,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:37:14,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:37:14,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:37:14,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:37:14,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:14,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:37:14,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:37:14,485 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 10:37:14,485 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:37:14,485 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:37:14,485 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 10:37:14,485 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:37:14,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:37:14,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:37:14,602 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:37:14,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:14 BoogieIcfgContainer [2018-02-02 10:37:14,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:37:14,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:37:14,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:37:14,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:37:14,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:37:14" (1/3) ... [2018-02-02 10:37:14,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c1738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:14, skipping insertion in model container [2018-02-02 10:37:14,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:14" (2/3) ... [2018-02-02 10:37:14,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c1738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:14, skipping insertion in model container [2018-02-02 10:37:14,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:14" (3/3) ... [2018-02-02 10:37:14,610 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-02 10:37:14,618 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:37:14,625 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:37:14,659 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:37:14,660 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:37:14,660 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:37:14,660 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:37:14,660 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:37:14,660 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:37:14,660 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:37:14,660 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:37:14,661 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:37:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-02 10:37:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:37:14,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:14,681 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:14,681 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times [2018-02-02 10:37:14,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:14,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:14,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:37:14,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,792 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 37#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-02 10:37:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:37:14,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:37:14,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:37:14,803 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-02 10:37:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:14,851 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 10:37:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:37:14,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:37:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:14,857 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:37:14,857 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:37:14,858 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 10:37:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:37:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-02 10:37:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:37:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-02 10:37:14,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-02-02 10:37:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:14,883 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-02 10:37:14,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:37:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-02 10:37:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:37:14,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:14,884 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:14,884 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times [2018-02-02 10:37:14,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:14,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:14,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 10:37:14,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,969 INFO L182 omatonBuilderFactory]: Interpolants [118#true, 119#false, 120#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 121#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-02 10:37:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:14,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:37:14,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:37:14,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:37:14,970 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-02-02 10:37:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,035 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 10:37:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:37:15,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:37:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,037 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:37:15,037 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:37:15,038 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 10:37:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:37:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-02-02 10:37:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:37:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-02 10:37:15,043 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2018-02-02 10:37:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,044 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-02 10:37:15,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:37:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-02 10:37:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:37:15,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,045 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,045 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times [2018-02-02 10:37:15,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:15,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:37:15,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,094 INFO L182 omatonBuilderFactory]: Interpolants [212#true, 213#false, 214#(<= main_~i~0 0), 215#(and (= main_~x~0 0) (<= main_~i~0 0))] [2018-02-02 10:37:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:37:15,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:37:15,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:37:15,095 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-02-02 10:37:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,127 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 10:37:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:37:15,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:37:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,128 INFO L225 Difference]: With dead ends: 39 [2018-02-02 10:37:15,128 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:37:15,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:37:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:37:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 10:37:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:37:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 10:37:15,131 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-02-02 10:37:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,131 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 10:37:15,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:37:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 10:37:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:37:15,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,131 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,131 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times [2018-02-02 10:37:15,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:37:15,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,175 INFO L182 omatonBuilderFactory]: Interpolants [291#true, 292#false, 293#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 294#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 295#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-02-02 10:37:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:15,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:15,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:15,176 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-02 10:37:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,243 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-02 10:37:15,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:37:15,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:37:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,245 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:37:15,245 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:37:15,245 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 10:37:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:37:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-02 10:37:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:37:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 10:37:15,249 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2018-02-02 10:37:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,250 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 10:37:15,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 10:37:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:37:15,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,250 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,251 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2131223963, now seen corresponding path program 1 times [2018-02-02 10:37:15,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:37:15,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:15,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:37:15,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,268 INFO L182 omatonBuilderFactory]: Interpolants [396#true, 397#false, 398#(= main_~x~0 0)] [2018-02-02 10:37:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:37:15,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:37:15,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:37:15,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:37:15,268 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-02-02 10:37:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,289 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-02 10:37:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:37:15,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:37:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,290 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:37:15,290 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:37:15,291 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 10:37:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:37:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-02 10:37:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 10:37:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-02 10:37:15,295 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-02-02 10:37:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,295 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-02 10:37:15,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:37:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-02 10:37:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:37:15,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,296 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,296 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times [2018-02-02 10:37:15,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:37:15,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,349 INFO L182 omatonBuilderFactory]: Interpolants [496#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 497#(and (<= main_~i~0 3) (<= 1 main_~i~0)), 491#true, 492#false, 493#(<= main_~i~0 0), 494#(<= main_~i~0 1), 495#(<= main_~i~0 2)] [2018-02-02 10:37:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:15,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:15,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:15,350 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-02-02 10:37:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,415 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 10:37:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:37:15,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 10:37:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,416 INFO L225 Difference]: With dead ends: 89 [2018-02-02 10:37:15,416 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 10:37:15,417 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 10:37:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 10:37:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-02-02 10:37:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:37:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 10:37:15,420 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-02-02 10:37:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,420 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 10:37:15,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 10:37:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:37:15,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,421 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,421 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times [2018-02-02 10:37:15,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:37:15,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,464 INFO L182 omatonBuilderFactory]: Interpolants [643#true, 644#false, 645#(<= main_~i~0 0), 646#(<= main_~i~0 1), 647#(<= main_~i~0 (+ main_~x~0 1)), 648#(<= main_~i~0 main_~x~0)] [2018-02-02 10:37:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:37:15,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:37:15,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:37:15,465 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-02-02 10:37:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,523 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-02 10:37:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:37:15,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:37:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,524 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:37:15,524 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:37:15,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:37:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:37:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:37:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:37:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-02 10:37:15,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-02-02 10:37:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,529 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-02 10:37:15,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:37:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-02 10:37:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:37:15,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,530 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,530 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times [2018-02-02 10:37:15,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:37:15,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,603 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 762#true, 763#false, 764#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 765#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 766#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 767#(and (<= main_~i~0 3) (<= 3 main_~i~0))] [2018-02-02 10:37:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:15,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:15,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:15,604 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-02-02 10:37:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,714 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-02 10:37:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:37:15,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:37:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,717 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:37:15,717 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:37:15,717 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 10:37:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:37:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-02-02 10:37:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:37:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-02 10:37:15,721 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-02-02 10:37:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,721 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-02 10:37:15,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-02 10:37:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:37:15,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,722 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,722 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 155329936, now seen corresponding path program 2 times [2018-02-02 10:37:15,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:37:15,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:37:15,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,772 INFO L182 omatonBuilderFactory]: Interpolants [918#true, 919#false, 920#(<= main_~i~0 99999), 921#(and (<= main_~i~0 99999) (<= 0 main_~x~0)), 922#(and (<= 1 main_~x~0) (<= main_~i~0 99999)), 923#(and (<= 1 main_~x~0) (<= main_~x~0 99998))] [2018-02-02 10:37:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:37:15,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:37:15,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:37:15,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:37:15,773 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-02 10:37:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,811 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-02 10:37:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:37:15,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 10:37:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,812 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:37:15,812 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:37:15,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:37:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 10:37:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:37:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 10:37:15,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-02-02 10:37:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:15,815 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 10:37:15,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:37:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 10:37:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:37:15,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:15,816 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:15,816 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times [2018-02-02 10:37:15,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:15,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:15,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:37:15,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,875 INFO L182 omatonBuilderFactory]: Interpolants [1024#(<= main_~i~0 3), 1025#(<= main_~i~0 4), 1026#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1027#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1019#true, 1020#false, 1021#(<= main_~i~0 0), 1022#(<= main_~i~0 1), 1023#(<= main_~i~0 2)] [2018-02-02 10:37:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:15,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:37:15,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:37:15,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:37:15,876 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 9 states. [2018-02-02 10:37:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:15,996 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 10:37:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:37:15,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:37:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:15,997 INFO L225 Difference]: With dead ends: 43 [2018-02-02 10:37:15,997 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:37:15,997 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 10:37:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:37:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 10:37:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:37:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 10:37:16,000 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-02-02 10:37:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:16,001 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 10:37:16,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:37:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 10:37:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:37:16,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:16,002 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:16,002 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:16,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times [2018-02-02 10:37:16,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:16,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:16,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:37:16,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,078 INFO L182 omatonBuilderFactory]: Interpolants [1124#true, 1125#false, 1126#(<= main_~i~0 0), 1127#(<= main_~i~0 1), 1128#(<= main_~i~0 2), 1129#(<= main_~i~0 3), 1130#(<= main_~i~0 4), 1131#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1132#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1133#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-02-02 10:37:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:37:16,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:37:16,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:16,079 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 10 states. [2018-02-02 10:37:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:16,190 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 10:37:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:37:16,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-02 10:37:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:16,191 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:37:16,191 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:37:16,191 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 10:37:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:37:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 10:37:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:37:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 10:37:16,194 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-02-02 10:37:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:16,194 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 10:37:16,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:37:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 10:37:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:37:16,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:16,195 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:16,195 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times [2018-02-02 10:37:16,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:16,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:16,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:37:16,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,269 INFO L182 omatonBuilderFactory]: Interpolants [1248#(<= main_~i~0 4), 1249#(<= main_~i~0 5), 1250#(<= main_~i~0 6), 1251#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1252#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1242#true, 1243#false, 1244#(<= main_~i~0 0), 1245#(<= main_~i~0 1), 1246#(<= main_~i~0 2), 1247#(<= main_~i~0 3)] [2018-02-02 10:37:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:37:16,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:37:16,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:37:16,270 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-02-02 10:37:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:16,352 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 10:37:16,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:16,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 10:37:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:16,352 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:37:16,352 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:37:16,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:37:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:37:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:37:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:37:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 10:37:16,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-02-02 10:37:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:16,355 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 10:37:16,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:37:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 10:37:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:37:16,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:16,356 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:16,356 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times [2018-02-02 10:37:16,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:16,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:16,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:37:16,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,455 INFO L182 omatonBuilderFactory]: Interpolants [1376#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1377#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1378#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1379#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1380#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1381#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1382#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1383#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 1373#true, 1374#false, 1375#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-02 10:37:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:37:16,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:37:16,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:37:16,456 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-02-02 10:37:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:16,567 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 10:37:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:37:16,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 10:37:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:16,568 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:37:16,568 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:37:16,568 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 10:37:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:37:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 10:37:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 10:37:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 10:37:16,570 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-02-02 10:37:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:16,570 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 10:37:16,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:37:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 10:37:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:37:16,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:16,571 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:16,571 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times [2018-02-02 10:37:16,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:16,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:16,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:37:16,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,655 INFO L182 omatonBuilderFactory]: Interpolants [1504#(<= main_~i~0 2), 1505#(<= main_~i~0 3), 1506#(<= main_~i~0 4), 1507#(<= main_~i~0 5), 1508#(<= main_~i~0 6), 1509#(<= main_~i~0 7), 1510#(<= main_~i~0 8), 1511#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1512#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1500#true, 1501#false, 1502#(<= main_~i~0 0), 1503#(<= main_~i~0 1)] [2018-02-02 10:37:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:37:16,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:37:16,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:37:16,656 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2018-02-02 10:37:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:16,763 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-02 10:37:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:37:16,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 10:37:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:16,763 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:37:16,764 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:37:16,764 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 10:37:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:37:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 10:37:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:37:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-02 10:37:16,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-02-02 10:37:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:16,768 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-02 10:37:16,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:37:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-02 10:37:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:37:16,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:16,768 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:16,768 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times [2018-02-02 10:37:16,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:16,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:16,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:37:16,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,864 INFO L182 omatonBuilderFactory]: Interpolants [1664#(<= main_~i~0 5), 1665#(<= main_~i~0 6), 1666#(<= main_~i~0 7), 1667#(<= main_~i~0 8), 1668#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1669#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1670#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 1657#true, 1658#false, 1659#(<= main_~i~0 0), 1660#(<= main_~i~0 1), 1661#(<= main_~i~0 2), 1662#(<= main_~i~0 3), 1663#(<= main_~i~0 4)] [2018-02-02 10:37:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:16,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:37:16,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:37:16,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:37:16,865 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-02 10:37:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:17,017 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-02 10:37:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:37:17,017 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-02 10:37:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:17,017 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:37:17,018 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:37:17,018 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 10:37:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:37:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 10:37:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 10:37:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-02 10:37:17,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-02-02 10:37:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:17,021 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-02 10:37:17,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:37:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-02 10:37:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:37:17,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:17,023 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:17,023 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times [2018-02-02 10:37:17,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:17,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:17,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:37:17,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,121 INFO L182 omatonBuilderFactory]: Interpolants [1827#true, 1828#false, 1829#(<= main_~i~0 0), 1830#(<= main_~i~0 1), 1831#(<= main_~i~0 2), 1832#(<= main_~i~0 3), 1833#(<= main_~i~0 4), 1834#(<= main_~i~0 5), 1835#(<= main_~i~0 6), 1836#(<= main_~i~0 7), 1837#(<= main_~i~0 8), 1838#(<= main_~i~0 9), 1839#(<= main_~i~0 10), 1840#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 1841#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-02-02 10:37:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:37:17,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:37:17,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:37:17,122 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 15 states. [2018-02-02 10:37:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:17,254 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-02 10:37:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:37:17,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 10:37:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:17,255 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:37:17,255 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:37:17,255 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 10:37:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:37:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 10:37:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:37:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-02 10:37:17,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-02-02 10:37:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:17,257 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-02 10:37:17,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:37:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-02 10:37:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:37:17,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:17,257 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:17,257 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times [2018-02-02 10:37:17,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:17,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:17,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:37:17,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,362 INFO L182 omatonBuilderFactory]: Interpolants [2016#(<= main_~i~0 4), 2017#(<= main_~i~0 5), 2018#(<= main_~i~0 6), 2019#(<= main_~i~0 7), 2020#(<= main_~i~0 8), 2021#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2022#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2023#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2024#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2025#(and (<= 4 main_~i~0) (<= main_~i~0 12)), 2010#true, 2011#false, 2012#(<= main_~i~0 0), 2013#(<= main_~i~0 1), 2014#(<= main_~i~0 2), 2015#(<= main_~i~0 3)] [2018-02-02 10:37:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:37:17,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:37:17,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:37:17,362 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 16 states. [2018-02-02 10:37:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:17,540 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-02 10:37:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:37:17,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-02 10:37:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:17,541 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:37:17,541 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:37:17,541 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 10:37:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:37:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 10:37:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:37:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-02 10:37:17,543 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-02-02 10:37:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:17,543 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-02 10:37:17,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:37:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-02 10:37:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:37:17,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:17,544 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:17,544 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:17,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times [2018-02-02 10:37:17,545 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:17,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:17,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:37:17,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,675 INFO L182 omatonBuilderFactory]: Interpolants [2208#(<= main_~i~0 0), 2209#(<= main_~i~0 1), 2210#(<= main_~i~0 2), 2211#(<= main_~i~0 3), 2212#(<= main_~i~0 4), 2213#(<= main_~i~0 5), 2214#(<= main_~i~0 6), 2215#(<= main_~i~0 7), 2216#(<= main_~i~0 8), 2217#(<= main_~i~0 9), 2218#(<= main_~i~0 10), 2219#(<= main_~i~0 11), 2220#(<= main_~i~0 12), 2221#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2222#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 2206#true, 2207#false] [2018-02-02 10:37:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:17,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:37:17,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:37:17,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:37:17,676 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-02-02 10:37:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:17,890 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-02 10:37:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:37:17,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 10:37:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:17,891 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:37:17,891 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:37:17,891 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 10:37:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:37:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 10:37:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:37:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-02 10:37:17,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-02-02 10:37:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:17,893 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-02 10:37:17,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:37:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-02 10:37:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:37:17,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:17,894 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:17,894 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:17,895 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times [2018-02-02 10:37:17,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:17,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:18,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:37:18,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,025 INFO L182 omatonBuilderFactory]: Interpolants [2432#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 2415#true, 2416#false, 2417#(<= main_~i~0 0), 2418#(<= main_~i~0 1), 2419#(<= main_~i~0 2), 2420#(<= main_~i~0 3), 2421#(<= main_~i~0 4), 2422#(<= main_~i~0 5), 2423#(<= main_~i~0 6), 2424#(<= main_~i~0 7), 2425#(<= main_~i~0 8), 2426#(<= main_~i~0 9), 2427#(<= main_~i~0 10), 2428#(<= main_~i~0 11), 2429#(<= main_~i~0 12), 2430#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2431#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-02-02 10:37:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:37:18,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:37:18,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:37:18,026 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-02-02 10:37:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:18,246 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-02 10:37:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:37:18,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-02 10:37:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:18,247 INFO L225 Difference]: With dead ends: 88 [2018-02-02 10:37:18,247 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 10:37:18,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:37:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 10:37:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-02 10:37:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:37:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-02 10:37:18,249 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-02-02 10:37:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:18,249 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-02 10:37:18,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:37:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-02 10:37:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:37:18,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:18,250 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:18,250 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times [2018-02-02 10:37:18,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:18,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:18,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:37:18,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,360 INFO L182 omatonBuilderFactory]: Interpolants [2637#true, 2638#false, 2639#(<= main_~i~0 0), 2640#(<= main_~i~0 1), 2641#(<= main_~i~0 2), 2642#(<= main_~i~0 3), 2643#(<= main_~i~0 4), 2644#(<= main_~i~0 5), 2645#(<= main_~i~0 6), 2646#(<= main_~i~0 7), 2647#(<= main_~i~0 8), 2648#(<= main_~i~0 9), 2649#(<= main_~i~0 10), 2650#(<= main_~i~0 11), 2651#(<= main_~i~0 12), 2652#(<= main_~i~0 13), 2653#(<= main_~i~0 14), 2654#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 2655#(and (<= 1 main_~i~0) (<= main_~i~0 15))] [2018-02-02 10:37:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:37:18,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:37:18,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:37:18,360 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 19 states. [2018-02-02 10:37:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:18,531 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-02 10:37:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:37:18,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-02 10:37:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:18,531 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:37:18,531 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:37:18,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:37:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:37:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 10:37:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:37:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-02 10:37:18,533 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-02-02 10:37:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:18,533 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-02 10:37:18,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:37:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-02 10:37:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:37:18,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:18,533 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:18,533 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times [2018-02-02 10:37:18,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:18,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:18,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:37:18,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,692 INFO L182 omatonBuilderFactory]: Interpolants [2880#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 2881#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 2882#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 2883#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 2884#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 2885#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 2886#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 2887#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 2888#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 2889#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 2890#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 2872#true, 2873#false, 2874#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 2875#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 2876#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 2877#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 2878#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 2879#(and (<= 5 main_~i~0) (<= main_~i~0 5))] [2018-02-02 10:37:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:18,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:37:18,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:37:18,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:37:18,692 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-02-02 10:37:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:19,041 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-02 10:37:19,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:37:19,041 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-02 10:37:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:19,042 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:37:19,042 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:37:19,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:37:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:37:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-02 10:37:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:37:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-02-02 10:37:19,044 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-02-02 10:37:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:19,044 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-02-02 10:37:19,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:37:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-02-02 10:37:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:37:19,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:19,044 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:19,044 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times [2018-02-02 10:37:19,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:19,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:19,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:37:19,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,201 INFO L182 omatonBuilderFactory]: Interpolants [3104#(<= main_~i~0 15), 3105#(<= main_~i~0 16), 3106#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3107#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3087#true, 3088#false, 3089#(<= main_~i~0 0), 3090#(<= main_~i~0 1), 3091#(<= main_~i~0 2), 3092#(<= main_~i~0 3), 3093#(<= main_~i~0 4), 3094#(<= main_~i~0 5), 3095#(<= main_~i~0 6), 3096#(<= main_~i~0 7), 3097#(<= main_~i~0 8), 3098#(<= main_~i~0 9), 3099#(<= main_~i~0 10), 3100#(<= main_~i~0 11), 3101#(<= main_~i~0 12), 3102#(<= main_~i~0 13), 3103#(<= main_~i~0 14)] [2018-02-02 10:37:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:37:19,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:37:19,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:37:19,202 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 21 states. [2018-02-02 10:37:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:19,417 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-02-02 10:37:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:37:19,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-02-02 10:37:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:19,418 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:37:19,418 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:37:19,419 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 10:37:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:37:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-02 10:37:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:37:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-02-02 10:37:19,420 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-02-02 10:37:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:19,420 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-02-02 10:37:19,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:37:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-02-02 10:37:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:37:19,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:19,421 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:19,421 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times [2018-02-02 10:37:19,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:19,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:19,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:37:19,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,568 INFO L182 omatonBuilderFactory]: Interpolants [3360#(<= main_~i~0 10), 3361#(<= main_~i~0 11), 3362#(<= main_~i~0 12), 3363#(<= main_~i~0 13), 3364#(<= main_~i~0 14), 3365#(<= main_~i~0 15), 3366#(<= main_~i~0 16), 3367#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3368#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3369#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3348#true, 3349#false, 3350#(<= main_~i~0 0), 3351#(<= main_~i~0 1), 3352#(<= main_~i~0 2), 3353#(<= main_~i~0 3), 3354#(<= main_~i~0 4), 3355#(<= main_~i~0 5), 3356#(<= main_~i~0 6), 3357#(<= main_~i~0 7), 3358#(<= main_~i~0 8), 3359#(<= main_~i~0 9)] [2018-02-02 10:37:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:37:19,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:37:19,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:37:19,569 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 22 states. [2018-02-02 10:37:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:19,809 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-02-02 10:37:19,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:37:19,809 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-02-02 10:37:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:19,810 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:37:19,810 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:37:19,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:37:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:37:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-02 10:37:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:37:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-02 10:37:19,812 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-02-02 10:37:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:19,813 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-02 10:37:19,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:37:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-02 10:37:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:37:19,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:19,813 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:19,813 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times [2018-02-02 10:37:19,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:19,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:19,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:37:19,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,988 INFO L182 omatonBuilderFactory]: Interpolants [3622#true, 3623#false, 3624#(<= main_~i~0 0), 3625#(<= main_~i~0 1), 3626#(<= main_~i~0 2), 3627#(<= main_~i~0 3), 3628#(<= main_~i~0 4), 3629#(<= main_~i~0 5), 3630#(<= main_~i~0 6), 3631#(<= main_~i~0 7), 3632#(<= main_~i~0 8), 3633#(<= main_~i~0 9), 3634#(<= main_~i~0 10), 3635#(<= main_~i~0 11), 3636#(<= main_~i~0 12), 3637#(<= main_~i~0 13), 3638#(<= main_~i~0 14), 3639#(<= main_~i~0 15), 3640#(<= main_~i~0 16), 3641#(<= main_~i~0 17), 3642#(<= main_~i~0 18), 3643#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 3644#(and (<= 1 main_~i~0) (<= main_~i~0 19))] [2018-02-02 10:37:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:19,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:37:19,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:37:19,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:37:19,989 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-02-02 10:37:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:20,217 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-02-02 10:37:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:37:20,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-02 10:37:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:20,218 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:37:20,218 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:37:20,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:37:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:37:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:37:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:37:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-02 10:37:20,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-02-02 10:37:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:20,220 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-02 10:37:20,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:37:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-02 10:37:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:37:20,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:20,220 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:20,220 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times [2018-02-02 10:37:20,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:20,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:20,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:20,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:37:20,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:20,415 INFO L182 omatonBuilderFactory]: Interpolants [3909#true, 3910#false, 3911#(<= main_~i~0 0), 3912#(<= main_~i~0 1), 3913#(<= main_~i~0 2), 3914#(<= main_~i~0 3), 3915#(<= main_~i~0 4), 3916#(<= main_~i~0 5), 3917#(<= main_~i~0 6), 3918#(<= main_~i~0 7), 3919#(<= main_~i~0 8), 3920#(<= main_~i~0 9), 3921#(<= main_~i~0 10), 3922#(<= main_~i~0 11), 3923#(<= main_~i~0 12), 3924#(<= main_~i~0 13), 3925#(<= main_~i~0 14), 3926#(<= main_~i~0 15), 3927#(<= main_~i~0 16), 3928#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3929#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3930#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3931#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 3932#(and (<= 4 main_~i~0) (<= main_~i~0 20))] [2018-02-02 10:37:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:20,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:37:20,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:37:20,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:37:20,416 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-02-02 10:37:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:20,815 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-02-02 10:37:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:37:20,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-02 10:37:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:20,815 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:37:20,815 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 10:37:20,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:37:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 10:37:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 10:37:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:37:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-02-02 10:37:20,817 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-02-02 10:37:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:20,817 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-02-02 10:37:20,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:37:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-02-02 10:37:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:37:20,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:20,818 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:20,818 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times [2018-02-02 10:37:20,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:20,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:21,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:37:21,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,001 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= main_~i~0 13), 4225#(<= main_~i~0 14), 4226#(<= main_~i~0 15), 4227#(<= main_~i~0 16), 4228#(<= main_~i~0 17), 4229#(<= main_~i~0 18), 4230#(<= main_~i~0 19), 4231#(<= main_~i~0 20), 4232#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4233#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4209#true, 4210#false, 4211#(<= main_~i~0 0), 4212#(<= main_~i~0 1), 4213#(<= main_~i~0 2), 4214#(<= main_~i~0 3), 4215#(<= main_~i~0 4), 4216#(<= main_~i~0 5), 4217#(<= main_~i~0 6), 4218#(<= main_~i~0 7), 4219#(<= main_~i~0 8), 4220#(<= main_~i~0 9), 4221#(<= main_~i~0 10), 4222#(<= main_~i~0 11), 4223#(<= main_~i~0 12)] [2018-02-02 10:37:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:37:21,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:37:21,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:37:21,002 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-02-02 10:37:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:21,281 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-02-02 10:37:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:37:21,281 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-02 10:37:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:21,281 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:37:21,281 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:37:21,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:37:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:37:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:37:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:37:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-02-02 10:37:21,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-02-02 10:37:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:21,284 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-02-02 10:37:21,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:37:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-02-02 10:37:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 10:37:21,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:21,284 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:21,284 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times [2018-02-02 10:37:21,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:21,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:21,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:37:21,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,500 INFO L182 omatonBuilderFactory]: Interpolants [4544#(<= main_~i~0 20), 4545#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4546#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4547#(and (<= 2 main_~i~0) (<= main_~i~0 22)), 4522#true, 4523#false, 4524#(<= main_~i~0 0), 4525#(<= main_~i~0 1), 4526#(<= main_~i~0 2), 4527#(<= main_~i~0 3), 4528#(<= main_~i~0 4), 4529#(<= main_~i~0 5), 4530#(<= main_~i~0 6), 4531#(<= main_~i~0 7), 4532#(<= main_~i~0 8), 4533#(<= main_~i~0 9), 4534#(<= main_~i~0 10), 4535#(<= main_~i~0 11), 4536#(<= main_~i~0 12), 4537#(<= main_~i~0 13), 4538#(<= main_~i~0 14), 4539#(<= main_~i~0 15), 4540#(<= main_~i~0 16), 4541#(<= main_~i~0 17), 4542#(<= main_~i~0 18), 4543#(<= main_~i~0 19)] [2018-02-02 10:37:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:21,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:37:21,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:37:21,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:37:21,501 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-02-02 10:37:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:21,932 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-02-02 10:37:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:37:21,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-02 10:37:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:21,934 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:37:21,934 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:37:21,934 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 10:37:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:37:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 10:37:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:37:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-02-02 10:37:21,937 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-02-02 10:37:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:21,937 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-02-02 10:37:21,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:37:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-02-02 10:37:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 10:37:21,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:21,938 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:21,938 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times [2018-02-02 10:37:21,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:21,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:22,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:37:22,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,225 INFO L182 omatonBuilderFactory]: Interpolants [4864#(<= main_~i~0 14), 4865#(<= main_~i~0 15), 4866#(<= main_~i~0 16), 4867#(<= main_~i~0 17), 4868#(<= main_~i~0 18), 4869#(<= main_~i~0 19), 4870#(<= main_~i~0 20), 4871#(<= main_~i~0 21), 4872#(<= main_~i~0 22), 4873#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 4874#(and (<= 1 main_~i~0) (<= main_~i~0 23)), 4848#true, 4849#false, 4850#(<= main_~i~0 0), 4851#(<= main_~i~0 1), 4852#(<= main_~i~0 2), 4853#(<= main_~i~0 3), 4854#(<= main_~i~0 4), 4855#(<= main_~i~0 5), 4856#(<= main_~i~0 6), 4857#(<= main_~i~0 7), 4858#(<= main_~i~0 8), 4859#(<= main_~i~0 9), 4860#(<= main_~i~0 10), 4861#(<= main_~i~0 11), 4862#(<= main_~i~0 12), 4863#(<= main_~i~0 13)] [2018-02-02 10:37:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:37:22,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:37:22,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:37:22,227 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 27 states. [2018-02-02 10:37:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:22,570 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-02 10:37:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:37:22,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-02-02 10:37:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:22,571 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:37:22,571 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:37:22,571 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 10:37:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:37:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-02 10:37:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:37:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-02-02 10:37:22,573 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-02-02 10:37:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:22,573 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-02-02 10:37:22,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:37:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-02-02 10:37:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:37:22,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:22,574 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:22,574 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times [2018-02-02 10:37:22,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:22,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:22,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:37:22,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,838 INFO L182 omatonBuilderFactory]: Interpolants [5187#true, 5188#false, 5189#(<= main_~i~0 0), 5190#(<= main_~i~0 1), 5191#(<= main_~i~0 2), 5192#(<= main_~i~0 3), 5193#(<= main_~i~0 4), 5194#(<= main_~i~0 5), 5195#(<= main_~i~0 6), 5196#(<= main_~i~0 7), 5197#(<= main_~i~0 8), 5198#(<= main_~i~0 9), 5199#(<= main_~i~0 10), 5200#(<= main_~i~0 11), 5201#(<= main_~i~0 12), 5202#(<= main_~i~0 13), 5203#(<= main_~i~0 14), 5204#(<= main_~i~0 15), 5205#(<= main_~i~0 16), 5206#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5207#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5208#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5209#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 5210#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 5211#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 5212#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 5213#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 5214#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-02-02 10:37:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:22,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:37:22,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:37:22,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:37:22,840 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 28 states. [2018-02-02 10:37:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:23,372 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-02-02 10:37:23,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:37:23,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-02-02 10:37:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:23,373 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:37:23,373 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:37:23,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:37:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:37:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 10:37:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:37:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-02-02 10:37:23,376 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-02-02 10:37:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:23,377 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-02-02 10:37:23,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:37:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-02-02 10:37:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 10:37:23,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:23,378 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:23,378 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:23,378 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times [2018-02-02 10:37:23,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:23,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:23,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:23,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:37:23,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:23,643 INFO L182 omatonBuilderFactory]: Interpolants [5539#true, 5540#false, 5541#(<= main_~i~0 0), 5542#(<= main_~i~0 1), 5543#(<= main_~i~0 2), 5544#(<= main_~i~0 3), 5545#(<= main_~i~0 4), 5546#(<= main_~i~0 5), 5547#(<= main_~i~0 6), 5548#(<= main_~i~0 7), 5549#(<= main_~i~0 8), 5550#(<= main_~i~0 9), 5551#(<= main_~i~0 10), 5552#(<= main_~i~0 11), 5553#(<= main_~i~0 12), 5554#(<= main_~i~0 13), 5555#(<= main_~i~0 14), 5556#(<= main_~i~0 15), 5557#(<= main_~i~0 16), 5558#(<= main_~i~0 17), 5559#(<= main_~i~0 18), 5560#(<= main_~i~0 19), 5561#(<= main_~i~0 20), 5562#(<= main_~i~0 21), 5563#(<= main_~i~0 22), 5564#(<= main_~i~0 23), 5565#(<= main_~i~0 24), 5566#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5567#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-02-02 10:37:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:23,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:37:23,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:37:23,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:37:23,644 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-02-02 10:37:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:23,997 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-02-02 10:37:23,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:37:23,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-02 10:37:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:23,998 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:37:23,998 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:37:23,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:37:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:37:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:37:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:37:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-02-02 10:37:24,000 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-02-02 10:37:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:24,001 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-02-02 10:37:24,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:37:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-02-02 10:37:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 10:37:24,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:24,001 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:24,001 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times [2018-02-02 10:37:24,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:24,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:24,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:37:24,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,250 INFO L182 omatonBuilderFactory]: Interpolants [5904#true, 5905#false, 5906#(<= main_~i~0 0), 5907#(<= main_~i~0 1), 5908#(<= main_~i~0 2), 5909#(<= main_~i~0 3), 5910#(<= main_~i~0 4), 5911#(<= main_~i~0 5), 5912#(<= main_~i~0 6), 5913#(<= main_~i~0 7), 5914#(<= main_~i~0 8), 5915#(<= main_~i~0 9), 5916#(<= main_~i~0 10), 5917#(<= main_~i~0 11), 5918#(<= main_~i~0 12), 5919#(<= main_~i~0 13), 5920#(<= main_~i~0 14), 5921#(<= main_~i~0 15), 5922#(<= main_~i~0 16), 5923#(<= main_~i~0 17), 5924#(<= main_~i~0 18), 5925#(<= main_~i~0 19), 5926#(<= main_~i~0 20), 5927#(<= main_~i~0 21), 5928#(<= main_~i~0 22), 5929#(<= main_~i~0 23), 5930#(<= main_~i~0 24), 5931#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5932#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5933#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-02-02 10:37:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:37:24,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:37:24,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:37:24,252 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-02-02 10:37:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:24,637 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-02-02 10:37:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:37:24,637 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-02 10:37:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:24,637 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:37:24,637 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:37:24,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:37:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:37:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:37:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:37:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-02 10:37:24,640 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-02-02 10:37:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:24,640 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-02 10:37:24,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:37:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-02 10:37:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 10:37:24,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:24,640 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:24,640 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times [2018-02-02 10:37:24,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:24,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:24,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:37:24,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,933 INFO L182 omatonBuilderFactory]: Interpolants [6282#true, 6283#false, 6284#(<= main_~i~0 0), 6285#(<= main_~i~0 1), 6286#(<= main_~i~0 2), 6287#(<= main_~i~0 3), 6288#(<= main_~i~0 4), 6289#(<= main_~i~0 5), 6290#(<= main_~i~0 6), 6291#(<= main_~i~0 7), 6292#(<= main_~i~0 8), 6293#(<= main_~i~0 9), 6294#(<= main_~i~0 10), 6295#(<= main_~i~0 11), 6296#(<= main_~i~0 12), 6297#(<= main_~i~0 13), 6298#(<= main_~i~0 14), 6299#(<= main_~i~0 15), 6300#(<= main_~i~0 16), 6301#(<= main_~i~0 17), 6302#(<= main_~i~0 18), 6303#(<= main_~i~0 19), 6304#(<= main_~i~0 20), 6305#(<= main_~i~0 21), 6306#(<= main_~i~0 22), 6307#(<= main_~i~0 23), 6308#(<= main_~i~0 24), 6309#(<= main_~i~0 25), 6310#(<= main_~i~0 26), 6311#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 6312#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-02-02 10:37:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:24,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:37:24,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:37:24,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:37:24,934 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-02-02 10:37:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:25,351 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-02-02 10:37:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:37:25,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-02 10:37:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:25,352 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:37:25,352 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:37:25,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:37:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:37:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 10:37:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:37:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-02-02 10:37:25,355 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-02-02 10:37:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:25,355 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-02-02 10:37:25,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:37:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-02-02 10:37:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 10:37:25,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:25,356 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:25,356 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times [2018-02-02 10:37:25,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:25,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:25,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:25,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:37:25,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:25,620 INFO L182 omatonBuilderFactory]: Interpolants [6673#true, 6674#false, 6675#(<= main_~i~0 0), 6676#(<= main_~i~0 1), 6677#(<= main_~i~0 2), 6678#(<= main_~i~0 3), 6679#(<= main_~i~0 4), 6680#(<= main_~i~0 5), 6681#(<= main_~i~0 6), 6682#(<= main_~i~0 7), 6683#(<= main_~i~0 8), 6684#(<= main_~i~0 9), 6685#(<= main_~i~0 10), 6686#(<= main_~i~0 11), 6687#(<= main_~i~0 12), 6688#(<= main_~i~0 13), 6689#(<= main_~i~0 14), 6690#(<= main_~i~0 15), 6691#(<= main_~i~0 16), 6692#(<= main_~i~0 17), 6693#(<= main_~i~0 18), 6694#(<= main_~i~0 19), 6695#(<= main_~i~0 20), 6696#(<= main_~i~0 21), 6697#(<= main_~i~0 22), 6698#(<= main_~i~0 23), 6699#(<= main_~i~0 24), 6700#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 6701#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 6702#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 6703#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 6704#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-02-02 10:37:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:25,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:37:25,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:37:25,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:37:25,621 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 32 states. [2018-02-02 10:37:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:26,251 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-02-02 10:37:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:37:26,251 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-02-02 10:37:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:26,251 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:37:26,251 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:37:26,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:37:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:37:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:37:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:37:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-02 10:37:26,254 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-02-02 10:37:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:26,254 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-02 10:37:26,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:37:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-02 10:37:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 10:37:26,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:26,255 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:26,255 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times [2018-02-02 10:37:26,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:26,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:26,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:26,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:37:26,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:26,657 INFO L182 omatonBuilderFactory]: Interpolants [7104#(<= main_~i~0 25), 7105#(<= main_~i~0 26), 7106#(<= main_~i~0 27), 7107#(<= main_~i~0 28), 7108#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7109#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7077#true, 7078#false, 7079#(<= main_~i~0 0), 7080#(<= main_~i~0 1), 7081#(<= main_~i~0 2), 7082#(<= main_~i~0 3), 7083#(<= main_~i~0 4), 7084#(<= main_~i~0 5), 7085#(<= main_~i~0 6), 7086#(<= main_~i~0 7), 7087#(<= main_~i~0 8), 7088#(<= main_~i~0 9), 7089#(<= main_~i~0 10), 7090#(<= main_~i~0 11), 7091#(<= main_~i~0 12), 7092#(<= main_~i~0 13), 7093#(<= main_~i~0 14), 7094#(<= main_~i~0 15), 7095#(<= main_~i~0 16), 7096#(<= main_~i~0 17), 7097#(<= main_~i~0 18), 7098#(<= main_~i~0 19), 7099#(<= main_~i~0 20), 7100#(<= main_~i~0 21), 7101#(<= main_~i~0 22), 7102#(<= main_~i~0 23), 7103#(<= main_~i~0 24)] [2018-02-02 10:37:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:26,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:37:26,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:37:26,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:37:26,659 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 33 states. [2018-02-02 10:37:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:27,038 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-02-02 10:37:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:37:27,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-02-02 10:37:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:27,060 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:37:27,061 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:37:27,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:37:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:37:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:37:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:37:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-02-02 10:37:27,064 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-02-02 10:37:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:27,064 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-02-02 10:37:27,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:37:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-02-02 10:37:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 10:37:27,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:27,065 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:27,065 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times [2018-02-02 10:37:27,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:27,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:27,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:27,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:37:27,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:27,428 INFO L182 omatonBuilderFactory]: Interpolants [7494#true, 7495#false, 7496#(<= main_~i~0 0), 7497#(<= main_~i~0 1), 7498#(<= main_~i~0 2), 7499#(<= main_~i~0 3), 7500#(<= main_~i~0 4), 7501#(<= main_~i~0 5), 7502#(<= main_~i~0 6), 7503#(<= main_~i~0 7), 7504#(<= main_~i~0 8), 7505#(<= main_~i~0 9), 7506#(<= main_~i~0 10), 7507#(<= main_~i~0 11), 7508#(<= main_~i~0 12), 7509#(<= main_~i~0 13), 7510#(<= main_~i~0 14), 7511#(<= main_~i~0 15), 7512#(<= main_~i~0 16), 7513#(<= main_~i~0 17), 7514#(<= main_~i~0 18), 7515#(<= main_~i~0 19), 7516#(<= main_~i~0 20), 7517#(<= main_~i~0 21), 7518#(<= main_~i~0 22), 7519#(<= main_~i~0 23), 7520#(<= main_~i~0 24), 7521#(<= main_~i~0 25), 7522#(<= main_~i~0 26), 7523#(<= main_~i~0 27), 7524#(<= main_~i~0 28), 7525#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7526#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7527#(and (<= 2 main_~i~0) (<= main_~i~0 30))] [2018-02-02 10:37:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:27,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:37:27,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:37:27,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:37:27,429 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 34 states. [2018-02-02 10:37:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:27,903 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-02-02 10:37:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:37:27,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-02-02 10:37:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:27,903 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:37:27,904 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:37:27,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:37:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:37:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-02 10:37:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:37:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-02-02 10:37:27,906 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-02-02 10:37:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:27,906 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-02-02 10:37:27,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:37:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-02-02 10:37:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 10:37:27,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:27,907 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:27,907 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times [2018-02-02 10:37:27,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:27,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:28,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:28,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:37:28,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:28,342 INFO L182 omatonBuilderFactory]: Interpolants [7936#(<= main_~i~0 10), 7937#(<= main_~i~0 11), 7938#(<= main_~i~0 12), 7939#(<= main_~i~0 13), 7940#(<= main_~i~0 14), 7941#(<= main_~i~0 15), 7942#(<= main_~i~0 16), 7943#(<= main_~i~0 17), 7944#(<= main_~i~0 18), 7945#(<= main_~i~0 19), 7946#(<= main_~i~0 20), 7947#(<= main_~i~0 21), 7948#(<= main_~i~0 22), 7949#(<= main_~i~0 23), 7950#(<= main_~i~0 24), 7951#(<= main_~i~0 25), 7952#(<= main_~i~0 26), 7953#(<= main_~i~0 27), 7954#(<= main_~i~0 28), 7955#(<= main_~i~0 29), 7956#(<= main_~i~0 30), 7957#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 7958#(and (<= 1 main_~i~0) (<= main_~i~0 31)), 7924#true, 7925#false, 7926#(<= main_~i~0 0), 7927#(<= main_~i~0 1), 7928#(<= main_~i~0 2), 7929#(<= main_~i~0 3), 7930#(<= main_~i~0 4), 7931#(<= main_~i~0 5), 7932#(<= main_~i~0 6), 7933#(<= main_~i~0 7), 7934#(<= main_~i~0 8), 7935#(<= main_~i~0 9)] [2018-02-02 10:37:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:28,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:37:28,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:37:28,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:37:28,343 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-02-02 10:37:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:28,799 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-02 10:37:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:37:28,799 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-02 10:37:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:28,800 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:37:28,800 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:37:28,801 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 10:37:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:37:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-02-02 10:37:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:37:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-02-02 10:37:28,803 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-02-02 10:37:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:28,804 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-02-02 10:37:28,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:37:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-02-02 10:37:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 10:37:28,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:28,805 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:28,805 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times [2018-02-02 10:37:28,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:28,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:29,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:29,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:37:29,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:29,407 INFO L182 omatonBuilderFactory]: Interpolants [8384#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 8385#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 8386#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 8387#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 8388#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 8389#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 8390#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 8391#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 8392#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 8393#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 8394#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 8395#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 8396#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 8397#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 8398#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 8399#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 8400#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 8401#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 8367#true, 8368#false, 8369#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 8370#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 8371#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 8372#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 8373#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 8374#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 8375#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 8376#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 8377#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 8378#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 8379#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 8380#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 8381#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 8382#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 8383#(and (<= main_~i~0 14) (<= 14 main_~i~0))] [2018-02-02 10:37:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:29,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:37:29,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:37:29,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:37:29,408 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-02-02 10:37:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:30,731 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-02-02 10:37:30,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:37:30,732 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-02 10:37:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:30,732 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:37:30,732 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:37:30,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:37:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:37:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 10:37:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:37:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-02-02 10:37:30,734 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-02-02 10:37:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:30,734 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-02-02 10:37:30,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:37:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-02-02 10:37:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 10:37:30,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:30,735 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:30,735 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times [2018-02-02 10:37:30,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:30,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:31,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:31,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:37:31,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:31,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 10:37:31,086 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= main_~i~0 8), 8769#(<= main_~i~0 9), 8770#(<= main_~i~0 10), 8771#(<= main_~i~0 11), 8772#(<= main_~i~0 12), 8773#(<= main_~i~0 13), 8774#(<= main_~i~0 14), 8775#(<= main_~i~0 15), 8776#(<= main_~i~0 16), 8777#(<= main_~i~0 17), 8778#(<= main_~i~0 18), 8779#(<= main_~i~0 19), 8780#(<= main_~i~0 20), 8781#(<= main_~i~0 21), 8782#(<= main_~i~0 22), 8783#(<= main_~i~0 23), 8784#(<= main_~i~0 24), 8785#(<= main_~i~0 25), 8786#(<= main_~i~0 26), 8787#(<= main_~i~0 27), 8788#(<= main_~i~0 28), 8789#(<= main_~i~0 29), 8790#(<= main_~i~0 30), 8791#(<= main_~i~0 31), 8792#(<= main_~i~0 32), 8793#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 8794#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 8758#true, 8759#false, 8760#(<= main_~i~0 0), 8761#(<= main_~i~0 1), 8762#(<= main_~i~0 2), 8763#(<= main_~i~0 3), 8764#(<= main_~i~0 4), 8765#(<= main_~i~0 5), 8766#(<= main_~i~0 6), 8767#(<= main_~i~0 7)] [2018-02-02 10:37:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:31,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:37:31,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:37:31,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:37:31,087 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-02-02 10:37:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:31,585 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-02-02 10:37:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:37:31,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-02 10:37:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:31,586 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:37:31,586 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:37:31,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:37:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:37:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 10:37:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:37:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-02-02 10:37:31,587 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-02-02 10:37:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:31,588 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-02-02 10:37:31,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:37:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-02-02 10:37:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 10:37:31,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:31,588 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:31,588 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times [2018-02-02 10:37:31,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:31,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:32,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:32,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:37:32,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:32,050 INFO L182 omatonBuilderFactory]: Interpolants [9227#true, 9228#false, 9229#(<= main_~i~0 0), 9230#(<= main_~i~0 1), 9231#(<= main_~i~0 2), 9232#(<= main_~i~0 3), 9233#(<= main_~i~0 4), 9234#(<= main_~i~0 5), 9235#(<= main_~i~0 6), 9236#(<= main_~i~0 7), 9237#(<= main_~i~0 8), 9238#(<= main_~i~0 9), 9239#(<= main_~i~0 10), 9240#(<= main_~i~0 11), 9241#(<= main_~i~0 12), 9242#(<= main_~i~0 13), 9243#(<= main_~i~0 14), 9244#(<= main_~i~0 15), 9245#(<= main_~i~0 16), 9246#(<= main_~i~0 17), 9247#(<= main_~i~0 18), 9248#(<= main_~i~0 19), 9249#(<= main_~i~0 20), 9250#(<= main_~i~0 21), 9251#(<= main_~i~0 22), 9252#(<= main_~i~0 23), 9253#(<= main_~i~0 24), 9254#(<= main_~i~0 25), 9255#(<= main_~i~0 26), 9256#(<= main_~i~0 27), 9257#(<= main_~i~0 28), 9258#(<= main_~i~0 29), 9259#(<= main_~i~0 30), 9260#(<= main_~i~0 31), 9261#(<= main_~i~0 32), 9262#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 9263#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 9264#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-02-02 10:37:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:32,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:37:32,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:37:32,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:37:32,051 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-02-02 10:37:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:32,654 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-02-02 10:37:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:37:32,655 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-02 10:37:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:32,655 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:37:32,655 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 10:37:32,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:37:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 10:37:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-02 10:37:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:37:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-02 10:37:32,657 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-02-02 10:37:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:32,657 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-02 10:37:32,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:37:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-02 10:37:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 10:37:32,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:32,658 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:32,658 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times [2018-02-02 10:37:32,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:32,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:33,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 10:37:33,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,075 INFO L182 omatonBuilderFactory]: Interpolants [9728#(<= main_~i~0 17), 9729#(<= main_~i~0 18), 9730#(<= main_~i~0 19), 9731#(<= main_~i~0 20), 9732#(<= main_~i~0 21), 9733#(<= main_~i~0 22), 9734#(<= main_~i~0 23), 9735#(<= main_~i~0 24), 9736#(<= main_~i~0 25), 9737#(<= main_~i~0 26), 9738#(<= main_~i~0 27), 9739#(<= main_~i~0 28), 9740#(<= main_~i~0 29), 9741#(<= main_~i~0 30), 9742#(<= main_~i~0 31), 9743#(<= main_~i~0 32), 9744#(<= main_~i~0 33), 9745#(<= main_~i~0 34), 9746#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 9747#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 9709#true, 9710#false, 9711#(<= main_~i~0 0), 9712#(<= main_~i~0 1), 9713#(<= main_~i~0 2), 9714#(<= main_~i~0 3), 9715#(<= main_~i~0 4), 9716#(<= main_~i~0 5), 9717#(<= main_~i~0 6), 9718#(<= main_~i~0 7), 9719#(<= main_~i~0 8), 9720#(<= main_~i~0 9), 9721#(<= main_~i~0 10), 9722#(<= main_~i~0 11), 9723#(<= main_~i~0 12), 9724#(<= main_~i~0 13), 9725#(<= main_~i~0 14), 9726#(<= main_~i~0 15), 9727#(<= main_~i~0 16)] [2018-02-02 10:37:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 10:37:33,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 10:37:33,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:37:33,076 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 39 states. [2018-02-02 10:37:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:33,587 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-02-02 10:37:33,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:37:33,588 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-02-02 10:37:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:33,588 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:37:33,588 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:37:33,589 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 10:37:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:37:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-02 10:37:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:37:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-02-02 10:37:33,590 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-02-02 10:37:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:33,591 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-02-02 10:37:33,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 10:37:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-02-02 10:37:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:37:33,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:33,591 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:33,591 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times [2018-02-02 10:37:33,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:33,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:33,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 10:37:33,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,992 INFO L182 omatonBuilderFactory]: Interpolants [10240#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 10241#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 10242#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 10243#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 10204#true, 10205#false, 10206#(<= main_~i~0 0), 10207#(<= main_~i~0 1), 10208#(<= main_~i~0 2), 10209#(<= main_~i~0 3), 10210#(<= main_~i~0 4), 10211#(<= main_~i~0 5), 10212#(<= main_~i~0 6), 10213#(<= main_~i~0 7), 10214#(<= main_~i~0 8), 10215#(<= main_~i~0 9), 10216#(<= main_~i~0 10), 10217#(<= main_~i~0 11), 10218#(<= main_~i~0 12), 10219#(<= main_~i~0 13), 10220#(<= main_~i~0 14), 10221#(<= main_~i~0 15), 10222#(<= main_~i~0 16), 10223#(<= main_~i~0 17), 10224#(<= main_~i~0 18), 10225#(<= main_~i~0 19), 10226#(<= main_~i~0 20), 10227#(<= main_~i~0 21), 10228#(<= main_~i~0 22), 10229#(<= main_~i~0 23), 10230#(<= main_~i~0 24), 10231#(<= main_~i~0 25), 10232#(<= main_~i~0 26), 10233#(<= main_~i~0 27), 10234#(<= main_~i~0 28), 10235#(<= main_~i~0 29), 10236#(<= main_~i~0 30), 10237#(<= main_~i~0 31), 10238#(<= main_~i~0 32), 10239#(and (<= 0 main_~i~0) (<= main_~i~0 32))] [2018-02-02 10:37:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:33,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:37:33,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:37:33,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:37:33,993 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 40 states. [2018-02-02 10:37:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:34,698 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-02-02 10:37:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:37:34,698 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-02-02 10:37:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:34,699 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:37:34,699 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:37:34,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:37:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:37:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-02-02 10:37:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 10:37:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-02-02 10:37:34,701 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-02-02 10:37:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:34,702 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-02-02 10:37:34,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:37:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-02-02 10:37:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 10:37:34,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:34,702 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:34,702 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times [2018-02-02 10:37:34,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:34,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:35,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:35,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 10:37:35,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:35,112 INFO L182 omatonBuilderFactory]: Interpolants [10752#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 10712#true, 10713#false, 10714#(<= main_~i~0 0), 10715#(<= main_~i~0 1), 10716#(<= main_~i~0 2), 10717#(<= main_~i~0 3), 10718#(<= main_~i~0 4), 10719#(<= main_~i~0 5), 10720#(<= main_~i~0 6), 10721#(<= main_~i~0 7), 10722#(<= main_~i~0 8), 10723#(<= main_~i~0 9), 10724#(<= main_~i~0 10), 10725#(<= main_~i~0 11), 10726#(<= main_~i~0 12), 10727#(<= main_~i~0 13), 10728#(<= main_~i~0 14), 10729#(<= main_~i~0 15), 10730#(<= main_~i~0 16), 10731#(<= main_~i~0 17), 10732#(<= main_~i~0 18), 10733#(<= main_~i~0 19), 10734#(<= main_~i~0 20), 10735#(<= main_~i~0 21), 10736#(<= main_~i~0 22), 10737#(<= main_~i~0 23), 10738#(<= main_~i~0 24), 10739#(<= main_~i~0 25), 10740#(<= main_~i~0 26), 10741#(<= main_~i~0 27), 10742#(<= main_~i~0 28), 10743#(<= main_~i~0 29), 10744#(<= main_~i~0 30), 10745#(<= main_~i~0 31), 10746#(<= main_~i~0 32), 10747#(<= main_~i~0 33), 10748#(<= main_~i~0 34), 10749#(<= main_~i~0 35), 10750#(<= main_~i~0 36), 10751#(and (<= 0 main_~i~0) (<= main_~i~0 36))] [2018-02-02 10:37:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:35,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 10:37:35,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 10:37:35,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:37:35,113 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-02-02 10:37:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:35,692 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-02-02 10:37:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:37:35,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-02 10:37:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:35,693 INFO L225 Difference]: With dead ends: 203 [2018-02-02 10:37:35,693 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 10:37:35,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 10:37:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 10:37:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-02 10:37:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 10:37:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-02-02 10:37:35,695 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-02-02 10:37:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:35,695 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-02-02 10:37:35,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 10:37:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-02-02 10:37:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 10:37:35,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:35,695 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:35,695 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times [2018-02-02 10:37:35,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:35,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:36,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:36,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 10:37:36,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:36,108 INFO L182 omatonBuilderFactory]: Interpolants [11264#(<= main_~i~0 29), 11265#(<= main_~i~0 30), 11266#(<= main_~i~0 31), 11267#(<= main_~i~0 32), 11268#(<= main_~i~0 33), 11269#(<= main_~i~0 34), 11270#(<= main_~i~0 35), 11271#(<= main_~i~0 36), 11272#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 11273#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 11274#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 11233#true, 11234#false, 11235#(<= main_~i~0 0), 11236#(<= main_~i~0 1), 11237#(<= main_~i~0 2), 11238#(<= main_~i~0 3), 11239#(<= main_~i~0 4), 11240#(<= main_~i~0 5), 11241#(<= main_~i~0 6), 11242#(<= main_~i~0 7), 11243#(<= main_~i~0 8), 11244#(<= main_~i~0 9), 11245#(<= main_~i~0 10), 11246#(<= main_~i~0 11), 11247#(<= main_~i~0 12), 11248#(<= main_~i~0 13), 11249#(<= main_~i~0 14), 11250#(<= main_~i~0 15), 11251#(<= main_~i~0 16), 11252#(<= main_~i~0 17), 11253#(<= main_~i~0 18), 11254#(<= main_~i~0 19), 11255#(<= main_~i~0 20), 11256#(<= main_~i~0 21), 11257#(<= main_~i~0 22), 11258#(<= main_~i~0 23), 11259#(<= main_~i~0 24), 11260#(<= main_~i~0 25), 11261#(<= main_~i~0 26), 11262#(<= main_~i~0 27), 11263#(<= main_~i~0 28)] [2018-02-02 10:37:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:36,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 10:37:36,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 10:37:36,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:37:36,109 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-02-02 10:37:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:36,769 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-02-02 10:37:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:37:36,770 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-02 10:37:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:36,770 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:37:36,770 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:37:36,771 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 10:37:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:37:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-02 10:37:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:37:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-02-02 10:37:36,773 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-02-02 10:37:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:36,774 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-02-02 10:37:36,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 10:37:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-02-02 10:37:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 10:37:36,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:36,775 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:36,775 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times [2018-02-02 10:37:36,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:36,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:37,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:37,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:37:37,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:37,251 INFO L182 omatonBuilderFactory]: Interpolants [11776#(<= main_~i~0 7), 11777#(<= main_~i~0 8), 11778#(<= main_~i~0 9), 11779#(<= main_~i~0 10), 11780#(<= main_~i~0 11), 11781#(<= main_~i~0 12), 11782#(<= main_~i~0 13), 11783#(<= main_~i~0 14), 11784#(<= main_~i~0 15), 11785#(<= main_~i~0 16), 11786#(<= main_~i~0 17), 11787#(<= main_~i~0 18), 11788#(<= main_~i~0 19), 11789#(<= main_~i~0 20), 11790#(<= main_~i~0 21), 11791#(<= main_~i~0 22), 11792#(<= main_~i~0 23), 11793#(<= main_~i~0 24), 11794#(<= main_~i~0 25), 11795#(<= main_~i~0 26), 11796#(<= main_~i~0 27), 11797#(<= main_~i~0 28), 11798#(<= main_~i~0 29), 11799#(<= main_~i~0 30), 11800#(<= main_~i~0 31), 11801#(<= main_~i~0 32), 11802#(<= main_~i~0 33), 11803#(<= main_~i~0 34), 11804#(<= main_~i~0 35), 11805#(<= main_~i~0 36), 11806#(<= main_~i~0 37), 11807#(<= main_~i~0 38), 11808#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 11809#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 11767#true, 11768#false, 11769#(<= main_~i~0 0), 11770#(<= main_~i~0 1), 11771#(<= main_~i~0 2), 11772#(<= main_~i~0 3), 11773#(<= main_~i~0 4), 11774#(<= main_~i~0 5), 11775#(<= main_~i~0 6)] [2018-02-02 10:37:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:37,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 10:37:37,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 10:37:37,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:37:37,252 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-02-02 10:37:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:37,881 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-02 10:37:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:37:37,882 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-02 10:37:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:37,882 INFO L225 Difference]: With dead ends: 213 [2018-02-02 10:37:37,882 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 10:37:37,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 10:37:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 10:37:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-02 10:37:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:37:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-02-02 10:37:37,885 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-02-02 10:37:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:37,885 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-02-02 10:37:37,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 10:37:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-02-02 10:37:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 10:37:37,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:37,885 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:37,885 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times [2018-02-02 10:37:37,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:37,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:38,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:38,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 10:37:38,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:38,330 INFO L182 omatonBuilderFactory]: Interpolants [12352#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 12353#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 12354#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 12355#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 12356#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 12357#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 12314#true, 12315#false, 12316#(<= main_~i~0 0), 12317#(<= main_~i~0 1), 12318#(<= main_~i~0 2), 12319#(<= main_~i~0 3), 12320#(<= main_~i~0 4), 12321#(<= main_~i~0 5), 12322#(<= main_~i~0 6), 12323#(<= main_~i~0 7), 12324#(<= main_~i~0 8), 12325#(<= main_~i~0 9), 12326#(<= main_~i~0 10), 12327#(<= main_~i~0 11), 12328#(<= main_~i~0 12), 12329#(<= main_~i~0 13), 12330#(<= main_~i~0 14), 12331#(<= main_~i~0 15), 12332#(<= main_~i~0 16), 12333#(<= main_~i~0 17), 12334#(<= main_~i~0 18), 12335#(<= main_~i~0 19), 12336#(<= main_~i~0 20), 12337#(<= main_~i~0 21), 12338#(<= main_~i~0 22), 12339#(<= main_~i~0 23), 12340#(<= main_~i~0 24), 12341#(<= main_~i~0 25), 12342#(<= main_~i~0 26), 12343#(<= main_~i~0 27), 12344#(<= main_~i~0 28), 12345#(<= main_~i~0 29), 12346#(<= main_~i~0 30), 12347#(<= main_~i~0 31), 12348#(<= main_~i~0 32), 12349#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 12350#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 12351#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-02-02 10:37:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:38,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 10:37:38,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 10:37:38,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:37:38,331 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-02-02 10:37:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:39,333 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-02-02 10:37:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:37:39,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-02 10:37:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:39,334 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:37:39,334 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:37:39,334 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 10:37:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:37:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 10:37:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:37:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-02-02 10:37:39,336 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-02-02 10:37:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:39,337 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-02-02 10:37:39,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 10:37:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-02-02 10:37:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 10:37:39,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:39,337 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:39,337 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times [2018-02-02 10:37:39,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:39,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:39,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:39,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 10:37:39,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:39,895 INFO L182 omatonBuilderFactory]: Interpolants [12874#true, 12875#false, 12876#(<= main_~i~0 0), 12877#(<= main_~i~0 1), 12878#(<= main_~i~0 2), 12879#(<= main_~i~0 3), 12880#(<= main_~i~0 4), 12881#(<= main_~i~0 5), 12882#(<= main_~i~0 6), 12883#(<= main_~i~0 7), 12884#(<= main_~i~0 8), 12885#(<= main_~i~0 9), 12886#(<= main_~i~0 10), 12887#(<= main_~i~0 11), 12888#(<= main_~i~0 12), 12889#(<= main_~i~0 13), 12890#(<= main_~i~0 14), 12891#(<= main_~i~0 15), 12892#(<= main_~i~0 16), 12893#(<= main_~i~0 17), 12894#(<= main_~i~0 18), 12895#(<= main_~i~0 19), 12896#(<= main_~i~0 20), 12897#(<= main_~i~0 21), 12898#(<= main_~i~0 22), 12899#(<= main_~i~0 23), 12900#(<= main_~i~0 24), 12901#(<= main_~i~0 25), 12902#(<= main_~i~0 26), 12903#(<= main_~i~0 27), 12904#(<= main_~i~0 28), 12905#(<= main_~i~0 29), 12906#(<= main_~i~0 30), 12907#(<= main_~i~0 31), 12908#(<= main_~i~0 32), 12909#(<= main_~i~0 33), 12910#(<= main_~i~0 34), 12911#(<= main_~i~0 35), 12912#(<= main_~i~0 36), 12913#(<= main_~i~0 37), 12914#(<= main_~i~0 38), 12915#(<= main_~i~0 39), 12916#(<= main_~i~0 40), 12917#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 12918#(and (<= 1 main_~i~0) (<= main_~i~0 41))] [2018-02-02 10:37:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:39,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 10:37:39,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 10:37:39,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:37:39,897 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 45 states. [2018-02-02 10:37:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:40,575 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-02-02 10:37:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:37:40,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-02-02 10:37:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:40,576 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:37:40,576 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:37:40,576 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 10:37:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:37:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-02 10:37:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:37:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-02-02 10:37:40,578 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-02-02 10:37:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:40,578 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-02-02 10:37:40,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 10:37:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-02-02 10:37:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-02 10:37:40,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:40,579 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:40,579 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times [2018-02-02 10:37:40,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:40,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:41,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:41,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 10:37:41,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:41,100 INFO L182 omatonBuilderFactory]: Interpolants [13447#true, 13448#false, 13449#(<= main_~i~0 0), 13450#(<= main_~i~0 1), 13451#(<= main_~i~0 2), 13452#(<= main_~i~0 3), 13453#(<= main_~i~0 4), 13454#(<= main_~i~0 5), 13455#(<= main_~i~0 6), 13456#(<= main_~i~0 7), 13457#(<= main_~i~0 8), 13458#(<= main_~i~0 9), 13459#(<= main_~i~0 10), 13460#(<= main_~i~0 11), 13461#(<= main_~i~0 12), 13462#(<= main_~i~0 13), 13463#(<= main_~i~0 14), 13464#(<= main_~i~0 15), 13465#(<= main_~i~0 16), 13466#(<= main_~i~0 17), 13467#(<= main_~i~0 18), 13468#(<= main_~i~0 19), 13469#(<= main_~i~0 20), 13470#(<= main_~i~0 21), 13471#(<= main_~i~0 22), 13472#(<= main_~i~0 23), 13473#(<= main_~i~0 24), 13474#(<= main_~i~0 25), 13475#(<= main_~i~0 26), 13476#(<= main_~i~0 27), 13477#(<= main_~i~0 28), 13478#(<= main_~i~0 29), 13479#(<= main_~i~0 30), 13480#(<= main_~i~0 31), 13481#(<= main_~i~0 32), 13482#(<= main_~i~0 33), 13483#(<= main_~i~0 34), 13484#(<= main_~i~0 35), 13485#(<= main_~i~0 36), 13486#(<= main_~i~0 37), 13487#(<= main_~i~0 38), 13488#(<= main_~i~0 39), 13489#(<= main_~i~0 40), 13490#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 13491#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 13492#(and (<= 2 main_~i~0) (<= main_~i~0 42))] [2018-02-02 10:37:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:41,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 10:37:41,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 10:37:41,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:37:41,101 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 46 states. [2018-02-02 10:37:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:41,876 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-02-02 10:37:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:37:41,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-02-02 10:37:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:41,877 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:37:41,877 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:37:41,878 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 10:37:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:37:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-02 10:37:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:37:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-02-02 10:37:41,880 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-02-02 10:37:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:41,881 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-02-02 10:37:41,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 10:37:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-02-02 10:37:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-02 10:37:41,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:41,882 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:41,882 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times [2018-02-02 10:37:41,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:41,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:42,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:42,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 10:37:42,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:42,426 INFO L182 omatonBuilderFactory]: Interpolants [14033#true, 14034#false, 14035#(<= main_~i~0 0), 14036#(<= main_~i~0 1), 14037#(<= main_~i~0 2), 14038#(<= main_~i~0 3), 14039#(<= main_~i~0 4), 14040#(<= main_~i~0 5), 14041#(<= main_~i~0 6), 14042#(<= main_~i~0 7), 14043#(<= main_~i~0 8), 14044#(<= main_~i~0 9), 14045#(<= main_~i~0 10), 14046#(<= main_~i~0 11), 14047#(<= main_~i~0 12), 14048#(<= main_~i~0 13), 14049#(<= main_~i~0 14), 14050#(<= main_~i~0 15), 14051#(<= main_~i~0 16), 14052#(<= main_~i~0 17), 14053#(<= main_~i~0 18), 14054#(<= main_~i~0 19), 14055#(<= main_~i~0 20), 14056#(<= main_~i~0 21), 14057#(<= main_~i~0 22), 14058#(<= main_~i~0 23), 14059#(<= main_~i~0 24), 14060#(<= main_~i~0 25), 14061#(<= main_~i~0 26), 14062#(<= main_~i~0 27), 14063#(<= main_~i~0 28), 14064#(<= main_~i~0 29), 14065#(<= main_~i~0 30), 14066#(<= main_~i~0 31), 14067#(<= main_~i~0 32), 14068#(<= main_~i~0 33), 14069#(<= main_~i~0 34), 14070#(<= main_~i~0 35), 14071#(<= main_~i~0 36), 14072#(<= main_~i~0 37), 14073#(<= main_~i~0 38), 14074#(<= main_~i~0 39), 14075#(<= main_~i~0 40), 14076#(<= main_~i~0 41), 14077#(<= main_~i~0 42), 14078#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 14079#(and (<= 1 main_~i~0) (<= main_~i~0 43))] [2018-02-02 10:37:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:42,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 10:37:42,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 10:37:42,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:37:42,428 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-02-02 10:37:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:43,172 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-02-02 10:37:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 10:37:43,172 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-02 10:37:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:43,172 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:37:43,173 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:37:43,173 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 10:37:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:37:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-02-02 10:37:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:37:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-02-02 10:37:43,176 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-02-02 10:37:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:43,176 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-02-02 10:37:43,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 10:37:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-02-02 10:37:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 10:37:43,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:43,177 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:43,177 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times [2018-02-02 10:37:43,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:43,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:43,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:43,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 10:37:43,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:43,710 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 22), 14657#(<= main_~i~0 23), 14658#(<= main_~i~0 24), 14659#(<= main_~i~0 25), 14660#(<= main_~i~0 26), 14661#(<= main_~i~0 27), 14662#(<= main_~i~0 28), 14663#(<= main_~i~0 29), 14664#(<= main_~i~0 30), 14665#(<= main_~i~0 31), 14666#(<= main_~i~0 32), 14667#(<= main_~i~0 33), 14668#(<= main_~i~0 34), 14669#(<= main_~i~0 35), 14670#(<= main_~i~0 36), 14671#(<= main_~i~0 37), 14672#(<= main_~i~0 38), 14673#(<= main_~i~0 39), 14674#(<= main_~i~0 40), 14675#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 14676#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 14677#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 14678#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 14679#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 14632#true, 14633#false, 14634#(<= main_~i~0 0), 14635#(<= main_~i~0 1), 14636#(<= main_~i~0 2), 14637#(<= main_~i~0 3), 14638#(<= main_~i~0 4), 14639#(<= main_~i~0 5), 14640#(<= main_~i~0 6), 14641#(<= main_~i~0 7), 14642#(<= main_~i~0 8), 14643#(<= main_~i~0 9), 14644#(<= main_~i~0 10), 14645#(<= main_~i~0 11), 14646#(<= main_~i~0 12), 14647#(<= main_~i~0 13), 14648#(<= main_~i~0 14), 14649#(<= main_~i~0 15), 14650#(<= main_~i~0 16), 14651#(<= main_~i~0 17), 14652#(<= main_~i~0 18), 14653#(<= main_~i~0 19), 14654#(<= main_~i~0 20), 14655#(<= main_~i~0 21)] [2018-02-02 10:37:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:43,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 10:37:43,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 10:37:43,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:37:43,710 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 48 states. [2018-02-02 10:37:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:44,630 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-02-02 10:37:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:37:44,630 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-02-02 10:37:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:44,631 INFO L225 Difference]: With dead ends: 238 [2018-02-02 10:37:44,631 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 10:37:44,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-02-02 10:37:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 10:37:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-02 10:37:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 10:37:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-02-02 10:37:44,635 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-02-02 10:37:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:44,635 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-02-02 10:37:44,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 10:37:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-02-02 10:37:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 10:37:44,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:44,636 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:44,636 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times [2018-02-02 10:37:44,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:44,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:45,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:45,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 10:37:45,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:45,283 INFO L182 omatonBuilderFactory]: Interpolants [15244#true, 15245#false, 15246#(<= main_~i~0 0), 15247#(<= main_~i~0 1), 15248#(<= main_~i~0 2), 15249#(<= main_~i~0 3), 15250#(<= main_~i~0 4), 15251#(<= main_~i~0 5), 15252#(<= main_~i~0 6), 15253#(<= main_~i~0 7), 15254#(<= main_~i~0 8), 15255#(<= main_~i~0 9), 15256#(<= main_~i~0 10), 15257#(<= main_~i~0 11), 15258#(<= main_~i~0 12), 15259#(<= main_~i~0 13), 15260#(<= main_~i~0 14), 15261#(<= main_~i~0 15), 15262#(<= main_~i~0 16), 15263#(<= main_~i~0 17), 15264#(<= main_~i~0 18), 15265#(<= main_~i~0 19), 15266#(<= main_~i~0 20), 15267#(<= main_~i~0 21), 15268#(<= main_~i~0 22), 15269#(<= main_~i~0 23), 15270#(<= main_~i~0 24), 15271#(<= main_~i~0 25), 15272#(<= main_~i~0 26), 15273#(<= main_~i~0 27), 15274#(<= main_~i~0 28), 15275#(<= main_~i~0 29), 15276#(<= main_~i~0 30), 15277#(<= main_~i~0 31), 15278#(<= main_~i~0 32), 15279#(<= main_~i~0 33), 15280#(<= main_~i~0 34), 15281#(<= main_~i~0 35), 15282#(<= main_~i~0 36), 15283#(<= main_~i~0 37), 15284#(<= main_~i~0 38), 15285#(<= main_~i~0 39), 15286#(<= main_~i~0 40), 15287#(<= main_~i~0 41), 15288#(<= main_~i~0 42), 15289#(<= main_~i~0 43), 15290#(<= main_~i~0 44), 15291#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15292#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-02-02 10:37:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:45,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 10:37:45,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 10:37:45,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:37:45,284 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-02-02 10:37:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:46,041 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-02-02 10:37:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:37:46,041 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-02 10:37:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:46,042 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:37:46,042 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:37:46,043 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 10:37:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:37:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-02 10:37:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:37:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-02-02 10:37:46,044 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-02-02 10:37:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:46,044 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-02-02 10:37:46,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 10:37:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-02-02 10:37:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 10:37:46,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:46,045 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:46,045 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times [2018-02-02 10:37:46,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:46,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:46,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:46,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 10:37:46,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:46,646 INFO L182 omatonBuilderFactory]: Interpolants [15872#(<= main_~i~0 1), 15873#(<= main_~i~0 2), 15874#(<= main_~i~0 3), 15875#(<= main_~i~0 4), 15876#(<= main_~i~0 5), 15877#(<= main_~i~0 6), 15878#(<= main_~i~0 7), 15879#(<= main_~i~0 8), 15880#(<= main_~i~0 9), 15881#(<= main_~i~0 10), 15882#(<= main_~i~0 11), 15883#(<= main_~i~0 12), 15884#(<= main_~i~0 13), 15885#(<= main_~i~0 14), 15886#(<= main_~i~0 15), 15887#(<= main_~i~0 16), 15888#(<= main_~i~0 17), 15889#(<= main_~i~0 18), 15890#(<= main_~i~0 19), 15891#(<= main_~i~0 20), 15892#(<= main_~i~0 21), 15893#(<= main_~i~0 22), 15894#(<= main_~i~0 23), 15895#(<= main_~i~0 24), 15896#(<= main_~i~0 25), 15897#(<= main_~i~0 26), 15898#(<= main_~i~0 27), 15899#(<= main_~i~0 28), 15900#(<= main_~i~0 29), 15901#(<= main_~i~0 30), 15902#(<= main_~i~0 31), 15903#(<= main_~i~0 32), 15904#(<= main_~i~0 33), 15905#(<= main_~i~0 34), 15906#(<= main_~i~0 35), 15907#(<= main_~i~0 36), 15908#(<= main_~i~0 37), 15909#(<= main_~i~0 38), 15910#(<= main_~i~0 39), 15911#(<= main_~i~0 40), 15912#(<= main_~i~0 41), 15913#(<= main_~i~0 42), 15914#(<= main_~i~0 43), 15915#(<= main_~i~0 44), 15916#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15917#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 15918#(and (<= 2 main_~i~0) (<= main_~i~0 46)), 15869#true, 15870#false, 15871#(<= main_~i~0 0)] [2018-02-02 10:37:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:46,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 10:37:46,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 10:37:46,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:37:46,647 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-02-02 10:37:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:47,527 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-02-02 10:37:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 10:37:47,527 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-02 10:37:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:47,528 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:37:47,528 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:37:47,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-02 10:37:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:37:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-02-02 10:37:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:37:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-02-02 10:37:47,530 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-02-02 10:37:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:47,531 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-02-02 10:37:47,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 10:37:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-02-02 10:37:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-02 10:37:47,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:47,531 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:47,531 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times [2018-02-02 10:37:47,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:47,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:48,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:48,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 10:37:48,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:48,159 INFO L182 omatonBuilderFactory]: Interpolants [16512#(<= main_~i~0 3), 16513#(<= main_~i~0 4), 16514#(<= main_~i~0 5), 16515#(<= main_~i~0 6), 16516#(<= main_~i~0 7), 16517#(<= main_~i~0 8), 16518#(<= main_~i~0 9), 16519#(<= main_~i~0 10), 16520#(<= main_~i~0 11), 16521#(<= main_~i~0 12), 16522#(<= main_~i~0 13), 16523#(<= main_~i~0 14), 16524#(<= main_~i~0 15), 16525#(<= main_~i~0 16), 16526#(<= main_~i~0 17), 16527#(<= main_~i~0 18), 16528#(<= main_~i~0 19), 16529#(<= main_~i~0 20), 16530#(<= main_~i~0 21), 16531#(<= main_~i~0 22), 16532#(<= main_~i~0 23), 16533#(<= main_~i~0 24), 16534#(<= main_~i~0 25), 16535#(<= main_~i~0 26), 16536#(<= main_~i~0 27), 16537#(<= main_~i~0 28), 16538#(<= main_~i~0 29), 16539#(<= main_~i~0 30), 16540#(<= main_~i~0 31), 16541#(<= main_~i~0 32), 16542#(<= main_~i~0 33), 16543#(<= main_~i~0 34), 16544#(<= main_~i~0 35), 16545#(<= main_~i~0 36), 16546#(<= main_~i~0 37), 16547#(<= main_~i~0 38), 16548#(<= main_~i~0 39), 16549#(<= main_~i~0 40), 16550#(<= main_~i~0 41), 16551#(<= main_~i~0 42), 16552#(<= main_~i~0 43), 16553#(<= main_~i~0 44), 16554#(<= main_~i~0 45), 16555#(<= main_~i~0 46), 16556#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 16557#(and (<= 1 main_~i~0) (<= main_~i~0 47)), 16507#true, 16508#false, 16509#(<= main_~i~0 0), 16510#(<= main_~i~0 1), 16511#(<= main_~i~0 2)] [2018-02-02 10:37:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:48,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 10:37:48,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 10:37:48,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:37:48,160 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 51 states. [2018-02-02 10:37:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:48,994 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-02-02 10:37:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:37:48,994 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-02-02 10:37:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:48,995 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:37:48,995 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:37:48,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-02-02 10:37:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:37:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-02-02 10:37:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:37:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-02-02 10:37:48,998 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-02-02 10:37:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:48,999 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-02-02 10:37:48,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 10:37:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-02-02 10:37:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-02 10:37:49,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:49,000 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:49,000 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times [2018-02-02 10:37:49,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:49,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:49,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:49,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 10:37:49,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:49,668 INFO L182 omatonBuilderFactory]: Interpolants [17158#true, 17159#false, 17160#(<= main_~i~0 0), 17161#(<= main_~i~0 1), 17162#(<= main_~i~0 2), 17163#(<= main_~i~0 3), 17164#(<= main_~i~0 4), 17165#(<= main_~i~0 5), 17166#(<= main_~i~0 6), 17167#(<= main_~i~0 7), 17168#(<= main_~i~0 8), 17169#(<= main_~i~0 9), 17170#(<= main_~i~0 10), 17171#(<= main_~i~0 11), 17172#(<= main_~i~0 12), 17173#(<= main_~i~0 13), 17174#(<= main_~i~0 14), 17175#(<= main_~i~0 15), 17176#(<= main_~i~0 16), 17177#(<= main_~i~0 17), 17178#(<= main_~i~0 18), 17179#(<= main_~i~0 19), 17180#(<= main_~i~0 20), 17181#(<= main_~i~0 21), 17182#(<= main_~i~0 22), 17183#(<= main_~i~0 23), 17184#(<= main_~i~0 24), 17185#(<= main_~i~0 25), 17186#(<= main_~i~0 26), 17187#(<= main_~i~0 27), 17188#(<= main_~i~0 28), 17189#(<= main_~i~0 29), 17190#(<= main_~i~0 30), 17191#(<= main_~i~0 31), 17192#(<= main_~i~0 32), 17193#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 17194#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17195#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 17196#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 17197#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 17198#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 17199#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 17200#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 17201#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 17202#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 17203#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 17204#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 17205#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 17206#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 17207#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 17208#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 17209#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-02-02 10:37:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:49,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 10:37:49,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 10:37:49,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:37:49,669 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 52 states. [2018-02-02 10:37:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:51,529 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-02-02 10:37:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 10:37:51,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-02-02 10:37:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:51,530 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:37:51,530 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:37:51,530 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 10:37:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:37:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-02-02 10:37:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 10:37:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-02-02 10:37:51,532 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-02-02 10:37:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:51,532 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-02-02 10:37:51,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 10:37:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-02-02 10:37:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-02 10:37:51,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:51,533 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:51,533 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times [2018-02-02 10:37:51,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:51,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:52,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:52,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 10:37:52,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:52,218 INFO L182 omatonBuilderFactory]: Interpolants [17822#true, 17823#false, 17824#(<= main_~i~0 0), 17825#(<= main_~i~0 1), 17826#(<= main_~i~0 2), 17827#(<= main_~i~0 3), 17828#(<= main_~i~0 4), 17829#(<= main_~i~0 5), 17830#(<= main_~i~0 6), 17831#(<= main_~i~0 7), 17832#(<= main_~i~0 8), 17833#(<= main_~i~0 9), 17834#(<= main_~i~0 10), 17835#(<= main_~i~0 11), 17836#(<= main_~i~0 12), 17837#(<= main_~i~0 13), 17838#(<= main_~i~0 14), 17839#(<= main_~i~0 15), 17840#(<= main_~i~0 16), 17841#(<= main_~i~0 17), 17842#(<= main_~i~0 18), 17843#(<= main_~i~0 19), 17844#(<= main_~i~0 20), 17845#(<= main_~i~0 21), 17846#(<= main_~i~0 22), 17847#(<= main_~i~0 23), 17848#(<= main_~i~0 24), 17849#(<= main_~i~0 25), 17850#(<= main_~i~0 26), 17851#(<= main_~i~0 27), 17852#(<= main_~i~0 28), 17853#(<= main_~i~0 29), 17854#(<= main_~i~0 30), 17855#(<= main_~i~0 31), 17856#(<= main_~i~0 32), 17857#(<= main_~i~0 33), 17858#(<= main_~i~0 34), 17859#(<= main_~i~0 35), 17860#(<= main_~i~0 36), 17861#(<= main_~i~0 37), 17862#(<= main_~i~0 38), 17863#(<= main_~i~0 39), 17864#(<= main_~i~0 40), 17865#(<= main_~i~0 41), 17866#(<= main_~i~0 42), 17867#(<= main_~i~0 43), 17868#(<= main_~i~0 44), 17869#(<= main_~i~0 45), 17870#(<= main_~i~0 46), 17871#(<= main_~i~0 47), 17872#(<= main_~i~0 48), 17873#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 17874#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-02-02 10:37:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:52,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 10:37:52,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 10:37:52,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:37:52,219 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-02-02 10:37:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:53,116 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-02-02 10:37:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 10:37:53,117 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-02 10:37:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:53,117 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:37:53,117 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:37:53,118 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 10:37:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:37:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-02 10:37:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:37:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-02-02 10:37:53,119 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-02-02 10:37:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:53,119 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-02-02 10:37:53,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 10:37:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-02-02 10:37:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-02 10:37:53,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:53,121 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:53,121 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times [2018-02-02 10:37:53,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:53,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:53,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:53,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 10:37:53,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:53,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 10:37:53,809 INFO L182 omatonBuilderFactory]: Interpolants [18499#true, 18500#false, 18501#(<= main_~i~0 0), 18502#(<= main_~i~0 1), 18503#(<= main_~i~0 2), 18504#(<= main_~i~0 3), 18505#(<= main_~i~0 4), 18506#(<= main_~i~0 5), 18507#(<= main_~i~0 6), 18508#(<= main_~i~0 7), 18509#(<= main_~i~0 8), 18510#(<= main_~i~0 9), 18511#(<= main_~i~0 10), 18512#(<= main_~i~0 11), 18513#(<= main_~i~0 12), 18514#(<= main_~i~0 13), 18515#(<= main_~i~0 14), 18516#(<= main_~i~0 15), 18517#(<= main_~i~0 16), 18518#(<= main_~i~0 17), 18519#(<= main_~i~0 18), 18520#(<= main_~i~0 19), 18521#(<= main_~i~0 20), 18522#(<= main_~i~0 21), 18523#(<= main_~i~0 22), 18524#(<= main_~i~0 23), 18525#(<= main_~i~0 24), 18526#(<= main_~i~0 25), 18527#(<= main_~i~0 26), 18528#(<= main_~i~0 27), 18529#(<= main_~i~0 28), 18530#(<= main_~i~0 29), 18531#(<= main_~i~0 30), 18532#(<= main_~i~0 31), 18533#(<= main_~i~0 32), 18534#(<= main_~i~0 33), 18535#(<= main_~i~0 34), 18536#(<= main_~i~0 35), 18537#(<= main_~i~0 36), 18538#(<= main_~i~0 37), 18539#(<= main_~i~0 38), 18540#(<= main_~i~0 39), 18541#(<= main_~i~0 40), 18542#(<= main_~i~0 41), 18543#(<= main_~i~0 42), 18544#(<= main_~i~0 43), 18545#(<= main_~i~0 44), 18546#(<= main_~i~0 45), 18547#(<= main_~i~0 46), 18548#(<= main_~i~0 47), 18549#(<= main_~i~0 48), 18550#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 18551#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 18552#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-02-02 10:37:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:53,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 10:37:53,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 10:37:53,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:37:53,810 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 54 states. [2018-02-02 10:37:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:54,804 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-02-02 10:37:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 10:37:54,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-02-02 10:37:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:54,805 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:37:54,805 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:37:54,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-02-02 10:37:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:37:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-02-02 10:37:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:37:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-02-02 10:37:54,808 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-02-02 10:37:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:54,808 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-02-02 10:37:54,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 10:37:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-02-02 10:37:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-02 10:37:54,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:54,809 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:54,809 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times [2018-02-02 10:37:54,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:54,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:55,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:55,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 10:37:55,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:55,556 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 9), 19201#(<= main_~i~0 10), 19202#(<= main_~i~0 11), 19203#(<= main_~i~0 12), 19204#(<= main_~i~0 13), 19205#(<= main_~i~0 14), 19206#(<= main_~i~0 15), 19207#(<= main_~i~0 16), 19208#(<= main_~i~0 17), 19209#(<= main_~i~0 18), 19210#(<= main_~i~0 19), 19211#(<= main_~i~0 20), 19212#(<= main_~i~0 21), 19213#(<= main_~i~0 22), 19214#(<= main_~i~0 23), 19215#(<= main_~i~0 24), 19216#(<= main_~i~0 25), 19217#(<= main_~i~0 26), 19218#(<= main_~i~0 27), 19219#(<= main_~i~0 28), 19220#(<= main_~i~0 29), 19221#(<= main_~i~0 30), 19222#(<= main_~i~0 31), 19223#(<= main_~i~0 32), 19224#(<= main_~i~0 33), 19225#(<= main_~i~0 34), 19226#(<= main_~i~0 35), 19227#(<= main_~i~0 36), 19228#(<= main_~i~0 37), 19229#(<= main_~i~0 38), 19230#(<= main_~i~0 39), 19231#(<= main_~i~0 40), 19232#(<= main_~i~0 41), 19233#(<= main_~i~0 42), 19234#(<= main_~i~0 43), 19235#(<= main_~i~0 44), 19236#(<= main_~i~0 45), 19237#(<= main_~i~0 46), 19238#(<= main_~i~0 47), 19239#(<= main_~i~0 48), 19240#(<= main_~i~0 49), 19241#(<= main_~i~0 50), 19242#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 19243#(and (<= 1 main_~i~0) (<= main_~i~0 51)), 19189#true, 19190#false, 19191#(<= main_~i~0 0), 19192#(<= main_~i~0 1), 19193#(<= main_~i~0 2), 19194#(<= main_~i~0 3), 19195#(<= main_~i~0 4), 19196#(<= main_~i~0 5), 19197#(<= main_~i~0 6), 19198#(<= main_~i~0 7), 19199#(<= main_~i~0 8)] [2018-02-02 10:37:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:55,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 10:37:55,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 10:37:55,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:37:55,557 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-02-02 10:37:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:56,492 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-02-02 10:37:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 10:37:56,493 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-02 10:37:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:56,493 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:37:56,493 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:37:56,494 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 10:37:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:37:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-02-02 10:37:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:37:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-02-02 10:37:56,496 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-02-02 10:37:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:56,496 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-02-02 10:37:56,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 10:37:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-02-02 10:37:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-02 10:37:56,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:56,496 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:56,497 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times [2018-02-02 10:37:56,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:56,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:57,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:57,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 10:37:57,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:57,311 INFO L182 omatonBuilderFactory]: Interpolants [19892#true, 19893#false, 19894#(<= main_~i~0 0), 19895#(<= main_~i~0 1), 19896#(<= main_~i~0 2), 19897#(<= main_~i~0 3), 19898#(<= main_~i~0 4), 19899#(<= main_~i~0 5), 19900#(<= main_~i~0 6), 19901#(<= main_~i~0 7), 19902#(<= main_~i~0 8), 19903#(<= main_~i~0 9), 19904#(<= main_~i~0 10), 19905#(<= main_~i~0 11), 19906#(<= main_~i~0 12), 19907#(<= main_~i~0 13), 19908#(<= main_~i~0 14), 19909#(<= main_~i~0 15), 19910#(<= main_~i~0 16), 19911#(<= main_~i~0 17), 19912#(<= main_~i~0 18), 19913#(<= main_~i~0 19), 19914#(<= main_~i~0 20), 19915#(<= main_~i~0 21), 19916#(<= main_~i~0 22), 19917#(<= main_~i~0 23), 19918#(<= main_~i~0 24), 19919#(<= main_~i~0 25), 19920#(<= main_~i~0 26), 19921#(<= main_~i~0 27), 19922#(<= main_~i~0 28), 19923#(<= main_~i~0 29), 19924#(<= main_~i~0 30), 19925#(<= main_~i~0 31), 19926#(<= main_~i~0 32), 19927#(<= main_~i~0 33), 19928#(<= main_~i~0 34), 19929#(<= main_~i~0 35), 19930#(<= main_~i~0 36), 19931#(<= main_~i~0 37), 19932#(<= main_~i~0 38), 19933#(<= main_~i~0 39), 19934#(<= main_~i~0 40), 19935#(<= main_~i~0 41), 19936#(<= main_~i~0 42), 19937#(<= main_~i~0 43), 19938#(<= main_~i~0 44), 19939#(<= main_~i~0 45), 19940#(<= main_~i~0 46), 19941#(<= main_~i~0 47), 19942#(<= main_~i~0 48), 19943#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 19944#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 19945#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 19946#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 19947#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-02-02 10:37:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:57,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 10:37:57,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 10:37:57,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:37:57,312 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 56 states. [2018-02-02 10:37:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:58,484 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-02-02 10:37:58,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 10:37:58,484 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-02-02 10:37:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:58,485 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:37:58,485 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:37:58,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-02-02 10:37:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:37:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-02-02 10:37:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 10:37:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-02-02 10:37:58,487 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-02-02 10:37:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:58,487 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-02-02 10:37:58,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 10:37:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-02-02 10:37:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-02 10:37:58,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:58,488 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:58,488 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:37:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times [2018-02-02 10:37:58,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:58,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:59,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:59,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-02 10:37:59,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:59,322 INFO L182 omatonBuilderFactory]: Interpolants [20608#true, 20609#false, 20610#(<= main_~i~0 0), 20611#(<= main_~i~0 1), 20612#(<= main_~i~0 2), 20613#(<= main_~i~0 3), 20614#(<= main_~i~0 4), 20615#(<= main_~i~0 5), 20616#(<= main_~i~0 6), 20617#(<= main_~i~0 7), 20618#(<= main_~i~0 8), 20619#(<= main_~i~0 9), 20620#(<= main_~i~0 10), 20621#(<= main_~i~0 11), 20622#(<= main_~i~0 12), 20623#(<= main_~i~0 13), 20624#(<= main_~i~0 14), 20625#(<= main_~i~0 15), 20626#(<= main_~i~0 16), 20627#(<= main_~i~0 17), 20628#(<= main_~i~0 18), 20629#(<= main_~i~0 19), 20630#(<= main_~i~0 20), 20631#(<= main_~i~0 21), 20632#(<= main_~i~0 22), 20633#(<= main_~i~0 23), 20634#(<= main_~i~0 24), 20635#(<= main_~i~0 25), 20636#(<= main_~i~0 26), 20637#(<= main_~i~0 27), 20638#(<= main_~i~0 28), 20639#(<= main_~i~0 29), 20640#(<= main_~i~0 30), 20641#(<= main_~i~0 31), 20642#(<= main_~i~0 32), 20643#(<= main_~i~0 33), 20644#(<= main_~i~0 34), 20645#(<= main_~i~0 35), 20646#(<= main_~i~0 36), 20647#(<= main_~i~0 37), 20648#(<= main_~i~0 38), 20649#(<= main_~i~0 39), 20650#(<= main_~i~0 40), 20651#(<= main_~i~0 41), 20652#(<= main_~i~0 42), 20653#(<= main_~i~0 43), 20654#(<= main_~i~0 44), 20655#(<= main_~i~0 45), 20656#(<= main_~i~0 46), 20657#(<= main_~i~0 47), 20658#(<= main_~i~0 48), 20659#(<= main_~i~0 49), 20660#(<= main_~i~0 50), 20661#(<= main_~i~0 51), 20662#(<= main_~i~0 52), 20663#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 20664#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-02-02 10:37:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:59,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 10:37:59,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 10:37:59,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:37:59,323 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 57 states. [2018-02-02 10:38:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:38:00,338 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-02-02 10:38:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 10:38:00,338 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-02-02 10:38:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:38:00,339 INFO L225 Difference]: With dead ends: 283 [2018-02-02 10:38:00,339 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 10:38:00,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-02-02 10:38:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 10:38:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-02 10:38:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 10:38:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-02-02 10:38:00,342 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-02-02 10:38:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:38:00,342 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-02-02 10:38:00,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 10:38:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-02-02 10:38:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-02 10:38:00,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:38:00,343 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-02 10:38:00,343 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:38:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times [2018-02-02 10:38:00,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:38:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:38:00,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:38:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:01,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:38:01,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 10:38:01,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:38:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:01,173 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= main_~i~0 37), 21377#(<= main_~i~0 38), 21378#(<= main_~i~0 39), 21379#(<= main_~i~0 40), 21380#(<= main_~i~0 41), 21381#(<= main_~i~0 42), 21382#(<= main_~i~0 43), 21383#(<= main_~i~0 44), 21384#(<= main_~i~0 45), 21385#(<= main_~i~0 46), 21386#(<= main_~i~0 47), 21387#(<= main_~i~0 48), 21388#(<= main_~i~0 49), 21389#(<= main_~i~0 50), 21390#(<= main_~i~0 51), 21391#(<= main_~i~0 52), 21392#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 21393#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 21394#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 21337#true, 21338#false, 21339#(<= main_~i~0 0), 21340#(<= main_~i~0 1), 21341#(<= main_~i~0 2), 21342#(<= main_~i~0 3), 21343#(<= main_~i~0 4), 21344#(<= main_~i~0 5), 21345#(<= main_~i~0 6), 21346#(<= main_~i~0 7), 21347#(<= main_~i~0 8), 21348#(<= main_~i~0 9), 21349#(<= main_~i~0 10), 21350#(<= main_~i~0 11), 21351#(<= main_~i~0 12), 21352#(<= main_~i~0 13), 21353#(<= main_~i~0 14), 21354#(<= main_~i~0 15), 21355#(<= main_~i~0 16), 21356#(<= main_~i~0 17), 21357#(<= main_~i~0 18), 21358#(<= main_~i~0 19), 21359#(<= main_~i~0 20), 21360#(<= main_~i~0 21), 21361#(<= main_~i~0 22), 21362#(<= main_~i~0 23), 21363#(<= main_~i~0 24), 21364#(<= main_~i~0 25), 21365#(<= main_~i~0 26), 21366#(<= main_~i~0 27), 21367#(<= main_~i~0 28), 21368#(<= main_~i~0 29), 21369#(<= main_~i~0 30), 21370#(<= main_~i~0 31), 21371#(<= main_~i~0 32), 21372#(<= main_~i~0 33), 21373#(<= main_~i~0 34), 21374#(<= main_~i~0 35), 21375#(<= main_~i~0 36)] [2018-02-02 10:38:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:01,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 10:38:01,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 10:38:01,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:38:01,174 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 58 states. [2018-02-02 10:38:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:38:02,363 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-02-02 10:38:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 10:38:02,363 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-02-02 10:38:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:38:02,364 INFO L225 Difference]: With dead ends: 288 [2018-02-02 10:38:02,364 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 10:38:02,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-02-02 10:38:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 10:38:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-02-02 10:38:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:38:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-02-02 10:38:02,366 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-02-02 10:38:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:38:02,366 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-02-02 10:38:02,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 10:38:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-02-02 10:38:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-02 10:38:02,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:38:02,367 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-02 10:38:02,367 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:38:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times [2018-02-02 10:38:02,367 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:38:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:38:02,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:38:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:03,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:38:03,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-02 10:38:03,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:38:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:03,308 INFO L182 omatonBuilderFactory]: Interpolants [22079#true, 22080#false, 22081#(<= main_~i~0 0), 22082#(<= main_~i~0 1), 22083#(<= main_~i~0 2), 22084#(<= main_~i~0 3), 22085#(<= main_~i~0 4), 22086#(<= main_~i~0 5), 22087#(<= main_~i~0 6), 22088#(<= main_~i~0 7), 22089#(<= main_~i~0 8), 22090#(<= main_~i~0 9), 22091#(<= main_~i~0 10), 22092#(<= main_~i~0 11), 22093#(<= main_~i~0 12), 22094#(<= main_~i~0 13), 22095#(<= main_~i~0 14), 22096#(<= main_~i~0 15), 22097#(<= main_~i~0 16), 22098#(<= main_~i~0 17), 22099#(<= main_~i~0 18), 22100#(<= main_~i~0 19), 22101#(<= main_~i~0 20), 22102#(<= main_~i~0 21), 22103#(<= main_~i~0 22), 22104#(<= main_~i~0 23), 22105#(<= main_~i~0 24), 22106#(<= main_~i~0 25), 22107#(<= main_~i~0 26), 22108#(<= main_~i~0 27), 22109#(<= main_~i~0 28), 22110#(<= main_~i~0 29), 22111#(<= main_~i~0 30), 22112#(<= main_~i~0 31), 22113#(<= main_~i~0 32), 22114#(<= main_~i~0 33), 22115#(<= main_~i~0 34), 22116#(<= main_~i~0 35), 22117#(<= main_~i~0 36), 22118#(<= main_~i~0 37), 22119#(<= main_~i~0 38), 22120#(<= main_~i~0 39), 22121#(<= main_~i~0 40), 22122#(<= main_~i~0 41), 22123#(<= main_~i~0 42), 22124#(<= main_~i~0 43), 22125#(<= main_~i~0 44), 22126#(<= main_~i~0 45), 22127#(<= main_~i~0 46), 22128#(<= main_~i~0 47), 22129#(<= main_~i~0 48), 22130#(<= main_~i~0 49), 22131#(<= main_~i~0 50), 22132#(<= main_~i~0 51), 22133#(<= main_~i~0 52), 22134#(<= main_~i~0 53), 22135#(<= main_~i~0 54), 22136#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 22137#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-02-02 10:38:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:03,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 10:38:03,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 10:38:03,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:38:03,309 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-02-02 10:38:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:38:04,591 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-02-02 10:38:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 10:38:04,591 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-02 10:38:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:38:04,592 INFO L225 Difference]: With dead ends: 293 [2018-02-02 10:38:04,592 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 10:38:04,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-02 10:38:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 10:38:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-02-02 10:38:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 10:38:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-02-02 10:38:04,595 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-02-02 10:38:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:38:04,595 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-02-02 10:38:04,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 10:38:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-02-02 10:38:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-02 10:38:04,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:38:04,597 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-02 10:38:04,597 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:38:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times [2018-02-02 10:38:04,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:38:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:38:04,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:38:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:05,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:38:05,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 10:38:05,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:38:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:05,457 INFO L182 omatonBuilderFactory]: Interpolants [22834#true, 22835#false, 22836#(<= main_~i~0 0), 22837#(<= main_~i~0 1), 22838#(<= main_~i~0 2), 22839#(<= main_~i~0 3), 22840#(<= main_~i~0 4), 22841#(<= main_~i~0 5), 22842#(<= main_~i~0 6), 22843#(<= main_~i~0 7), 22844#(<= main_~i~0 8), 22845#(<= main_~i~0 9), 22846#(<= main_~i~0 10), 22847#(<= main_~i~0 11), 22848#(<= main_~i~0 12), 22849#(<= main_~i~0 13), 22850#(<= main_~i~0 14), 22851#(<= main_~i~0 15), 22852#(<= main_~i~0 16), 22853#(<= main_~i~0 17), 22854#(<= main_~i~0 18), 22855#(<= main_~i~0 19), 22856#(<= main_~i~0 20), 22857#(<= main_~i~0 21), 22858#(<= main_~i~0 22), 22859#(<= main_~i~0 23), 22860#(<= main_~i~0 24), 22861#(<= main_~i~0 25), 22862#(<= main_~i~0 26), 22863#(<= main_~i~0 27), 22864#(<= main_~i~0 28), 22865#(<= main_~i~0 29), 22866#(<= main_~i~0 30), 22867#(<= main_~i~0 31), 22868#(<= main_~i~0 32), 22869#(<= main_~i~0 33), 22870#(<= main_~i~0 34), 22871#(<= main_~i~0 35), 22872#(<= main_~i~0 36), 22873#(<= main_~i~0 37), 22874#(<= main_~i~0 38), 22875#(<= main_~i~0 39), 22876#(<= main_~i~0 40), 22877#(<= main_~i~0 41), 22878#(<= main_~i~0 42), 22879#(<= main_~i~0 43), 22880#(<= main_~i~0 44), 22881#(<= main_~i~0 45), 22882#(<= main_~i~0 46), 22883#(<= main_~i~0 47), 22884#(<= main_~i~0 48), 22885#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 22886#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 22887#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 22888#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 22889#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 22890#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 22891#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 22892#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 22893#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-02-02 10:38:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:05,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 10:38:05,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 10:38:05,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:38:05,458 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-02-02 10:38:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:38:07,109 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-02-02 10:38:07,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 10:38:07,109 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-02 10:38:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:38:07,110 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:38:07,110 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:38:07,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-02 10:38:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:38:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-02-02 10:38:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 10:38:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-02-02 10:38:07,112 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-02-02 10:38:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:38:07,112 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-02-02 10:38:07,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 10:38:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-02-02 10:38:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-02 10:38:07,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:38:07,113 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-02 10:38:07,113 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:38:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times [2018-02-02 10:38:07,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:38:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:38:07,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:38:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:08,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:38:08,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-02 10:38:08,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:38:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:08,029 INFO L182 omatonBuilderFactory]: Interpolants [23602#true, 23603#false, 23604#(<= main_~i~0 0), 23605#(<= main_~i~0 1), 23606#(<= main_~i~0 2), 23607#(<= main_~i~0 3), 23608#(<= main_~i~0 4), 23609#(<= main_~i~0 5), 23610#(<= main_~i~0 6), 23611#(<= main_~i~0 7), 23612#(<= main_~i~0 8), 23613#(<= main_~i~0 9), 23614#(<= main_~i~0 10), 23615#(<= main_~i~0 11), 23616#(<= main_~i~0 12), 23617#(<= main_~i~0 13), 23618#(<= main_~i~0 14), 23619#(<= main_~i~0 15), 23620#(<= main_~i~0 16), 23621#(<= main_~i~0 17), 23622#(<= main_~i~0 18), 23623#(<= main_~i~0 19), 23624#(<= main_~i~0 20), 23625#(<= main_~i~0 21), 23626#(<= main_~i~0 22), 23627#(<= main_~i~0 23), 23628#(<= main_~i~0 24), 23629#(<= main_~i~0 25), 23630#(<= main_~i~0 26), 23631#(<= main_~i~0 27), 23632#(<= main_~i~0 28), 23633#(<= main_~i~0 29), 23634#(<= main_~i~0 30), 23635#(<= main_~i~0 31), 23636#(<= main_~i~0 32), 23637#(<= main_~i~0 33), 23638#(<= main_~i~0 34), 23639#(<= main_~i~0 35), 23640#(<= main_~i~0 36), 23641#(<= main_~i~0 37), 23642#(<= main_~i~0 38), 23643#(<= main_~i~0 39), 23644#(<= main_~i~0 40), 23645#(<= main_~i~0 41), 23646#(<= main_~i~0 42), 23647#(<= main_~i~0 43), 23648#(<= main_~i~0 44), 23649#(<= main_~i~0 45), 23650#(<= main_~i~0 46), 23651#(<= main_~i~0 47), 23652#(<= main_~i~0 48), 23653#(<= main_~i~0 49), 23654#(<= main_~i~0 50), 23655#(<= main_~i~0 51), 23656#(<= main_~i~0 52), 23657#(<= main_~i~0 53), 23658#(<= main_~i~0 54), 23659#(<= main_~i~0 55), 23660#(<= main_~i~0 56), 23661#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 23662#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-02-02 10:38:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:08,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 10:38:08,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 10:38:08,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:38:08,030 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 61 states. [2018-02-02 10:38:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:38:09,222 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-02-02 10:38:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 10:38:09,223 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-02-02 10:38:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:38:09,223 INFO L225 Difference]: With dead ends: 303 [2018-02-02 10:38:09,223 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 10:38:09,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-02-02 10:38:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 10:38:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-02-02 10:38:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 10:38:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-02-02 10:38:09,226 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-02-02 10:38:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:38:09,226 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-02-02 10:38:09,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 10:38:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-02-02 10:38:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-02 10:38:09,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:38:09,227 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-02 10:38:09,227 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 10:38:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1266675268, now seen corresponding path program 58 times [2018-02-02 10:38:09,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:38:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:38:09,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:38:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:10,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:38:10,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 10:38:10,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:38:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:10,243 INFO L182 omatonBuilderFactory]: Interpolants [24383#true, 24384#false, 24385#(<= main_~i~0 0), 24386#(<= main_~i~0 1), 24387#(<= main_~i~0 2), 24388#(<= main_~i~0 3), 24389#(<= main_~i~0 4), 24390#(<= main_~i~0 5), 24391#(<= main_~i~0 6), 24392#(<= main_~i~0 7), 24393#(<= main_~i~0 8), 24394#(<= main_~i~0 9), 24395#(<= main_~i~0 10), 24396#(<= main_~i~0 11), 24397#(<= main_~i~0 12), 24398#(<= main_~i~0 13), 24399#(<= main_~i~0 14), 24400#(<= main_~i~0 15), 24401#(<= main_~i~0 16), 24402#(<= main_~i~0 17), 24403#(<= main_~i~0 18), 24404#(<= main_~i~0 19), 24405#(<= main_~i~0 20), 24406#(<= main_~i~0 21), 24407#(<= main_~i~0 22), 24408#(<= main_~i~0 23), 24409#(<= main_~i~0 24), 24410#(<= main_~i~0 25), 24411#(<= main_~i~0 26), 24412#(<= main_~i~0 27), 24413#(<= main_~i~0 28), 24414#(<= main_~i~0 29), 24415#(<= main_~i~0 30), 24416#(<= main_~i~0 31), 24417#(<= main_~i~0 32), 24418#(<= main_~i~0 33), 24419#(<= main_~i~0 34), 24420#(<= main_~i~0 35), 24421#(<= main_~i~0 36), 24422#(<= main_~i~0 37), 24423#(<= main_~i~0 38), 24424#(<= main_~i~0 39), 24425#(<= main_~i~0 40), 24426#(<= main_~i~0 41), 24427#(<= main_~i~0 42), 24428#(<= main_~i~0 43), 24429#(<= main_~i~0 44), 24430#(<= main_~i~0 45), 24431#(<= main_~i~0 46), 24432#(<= main_~i~0 47), 24433#(<= main_~i~0 48), 24434#(<= main_~i~0 49), 24435#(<= main_~i~0 50), 24436#(<= main_~i~0 51), 24437#(<= main_~i~0 52), 24438#(<= main_~i~0 53), 24439#(<= main_~i~0 54), 24440#(<= main_~i~0 55), 24441#(<= main_~i~0 56), 24442#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 24443#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 24444#(and (<= 2 main_~i~0) (<= main_~i~0 58))] [2018-02-02 10:38:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:38:10,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 10:38:10,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 10:38:10,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:38:10,244 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 62 states. Received shutdown request... [2018-02-02 10:38:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:38:11,084 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:38:11,087 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:38:11,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:38:11 BoogieIcfgContainer [2018-02-02 10:38:11,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:38:11,088 INFO L168 Benchmark]: Toolchain (without parser) took 56811.47 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 360.4 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 102.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:38:11,089 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:38:11,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.79 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 352.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:38:11,089 INFO L168 Benchmark]: Boogie Preprocessor took 18.54 ms. Allocated memory is still 403.7 MB. Free memory is still 352.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:38:11,089 INFO L168 Benchmark]: RCFGBuilder took 157.28 ms. Allocated memory is still 403.7 MB. Free memory was 352.5 MB in the beginning and 337.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:38:11,090 INFO L168 Benchmark]: TraceAbstraction took 56484.10 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 337.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 80.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:38:11,091 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.14 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.79 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 352.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.54 ms. Allocated memory is still 403.7 MB. Free memory is still 352.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 157.28 ms. Allocated memory is still 403.7 MB. Free memory was 352.5 MB in the beginning and 337.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56484.10 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 337.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 80.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 56.4s OverallTime, 63 OverallIterations, 59 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 902 SDtfs, 11127 SDslu, 10117 SDs, 0 SdLazy, 20535 SolverSat, 1774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3534 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 3468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36431 ImplicationChecksByTransitivity, 40.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/165990 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 62 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 9056 NumberOfCodeBlocks, 9056 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 8993 ConstructedInterpolants, 0 QuantifiedInterpolants, 5837067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 3 PerfectInterpolantSequences, 17/165990 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-38-11-095.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-38-11-095.csv Completed graceful shutdown