java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memset_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:05:20,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:05:20,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:05:20,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:05:20,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:05:20,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:05:20,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:05:20,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:05:20,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:05:20,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:05:20,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:05:20,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:05:20,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:05:20,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:05:20,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:05:20,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:05:20,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:05:20,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:05:20,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:05:20,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:05:20,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:05:20,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:05:20,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:05:20,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:05:20,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:05:20,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:05:20,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:05:20,812 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:05:20,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:05:20,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:05:20,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:05:20,813 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:05:20,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:05:20,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:05:20,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:05:20,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:05:20,824 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:05:20,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:05:20,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:05:20,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:05:20,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:05:20,825 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:05:20,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:05:20,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:05:20,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:05:20,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:05:20,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:05:20,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:05:20,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:05:20,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:05:20,866 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:05:20,869 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:05:20,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:05:20,871 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:05:20,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memset_true-valid-memsafety_true-termination.c [2018-02-04 03:05:20,960 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:05:20,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:05:20,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:05:20,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:05:20,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:05:20,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:20" (1/1) ... [2018-02-04 03:05:20,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199e2a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:20, skipping insertion in model container [2018-02-04 03:05:20,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:20" (1/1) ... [2018-02-04 03:05:20,984 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:05:20,997 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:05:21,080 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:05:21,090 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:05:21,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21 WrapperNode [2018-02-04 03:05:21,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:05:21,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:05:21,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:05:21,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:05:21,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (1/1) ... [2018-02-04 03:05:21,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:05:21,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:05:21,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:05:21,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:05:21,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (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-04 03:05:21,151 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:05:21,151 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:05:21,152 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 03:05:21,152 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 03:05:21,152 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:05:21,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:05:21,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:05:21,213 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 03:05:21,243 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:05:21,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:21 BoogieIcfgContainer [2018-02-04 03:05:21,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:05:21,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:05:21,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:05:21,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:05:21,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:05:20" (1/3) ... [2018-02-04 03:05:21,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8b6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:21, skipping insertion in model container [2018-02-04 03:05:21,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:21" (2/3) ... [2018-02-04 03:05:21,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8b6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:21, skipping insertion in model container [2018-02-04 03:05:21,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:21" (3/3) ... [2018-02-04 03:05:21,248 INFO L107 eAbstractionObserver]: Analyzing ICFG memset_true-valid-memsafety_true-termination.c [2018-02-04 03:05:21,253 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:05:21,263 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 03:05:21,291 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:05:21,291 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:05:21,291 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:05:21,291 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:05:21,292 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:05:21,292 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:05:21,292 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:05:21,292 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:05:21,293 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:05:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-02-04 03:05:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 03:05:21,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,307 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,307 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 682221498, now seen corresponding path program 1 times [2018-02-04 03:05:21,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,413 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-04 03:05:21,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:21,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:05:21,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,416 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-04 03:05:21,416 INFO L182 omatonBuilderFactory]: Interpolants [25#true, 26#false, 27#(= 1 (select |#valid| |main_~#cstats~0.base|))] [2018-02-04 03:05:21,416 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-04 03:05:21,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:05:21,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:05:21,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:05:21,432 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-02-04 03:05:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,464 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-04 03:05:21,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:05:21,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 03:05:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,472 INFO L225 Difference]: With dead ends: 21 [2018-02-04 03:05:21,473 INFO L226 Difference]: Without dead ends: 18 [2018-02-04 03:05:21,474 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-04 03:05:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-04 03:05:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-04 03:05:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-04 03:05:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-04 03:05:21,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2018-02-04 03:05:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,497 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-04 03:05:21,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:05:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-04 03:05:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 03:05:21,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,498 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 682221499, now seen corresponding path program 1 times [2018-02-04 03:05:21,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,599 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-04 03:05:21,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:21,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:05:21,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,600 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-04 03:05:21,600 INFO L182 omatonBuilderFactory]: Interpolants [67#true, 68#false, 69#(and (= (select |#length| |main_~#cstats~0.base|) 80) (= |main_~#cstats~0.offset| 0))] [2018-02-04 03:05:21,600 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-04 03:05:21,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:05:21,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:05:21,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:05:21,602 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-02-04 03:05:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,612 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-02-04 03:05:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:05:21,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 03:05:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,613 INFO L225 Difference]: With dead ends: 17 [2018-02-04 03:05:21,613 INFO L226 Difference]: Without dead ends: 17 [2018-02-04 03:05:21,614 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-04 03:05:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-02-04 03:05:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-02-04 03:05:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-02-04 03:05:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-02-04 03:05:21,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2018-02-04 03:05:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,616 INFO L432 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-02-04 03:05:21,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:05:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-02-04 03:05:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 03:05:21,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,617 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash -898824040, now seen corresponding path program 1 times [2018-02-04 03:05:21,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,663 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-04 03:05:21,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:05:21,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:05:21,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,664 INFO L182 omatonBuilderFactory]: Interpolants [104#true, 105#false, 106#(= |#Ultimate.C_memset_#t~loopctr5| 0), 107#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:21,665 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-04 03:05:21,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:05:21,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:05:21,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:05:21,665 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2018-02-04 03:05:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,679 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-02-04 03:05:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:05:21,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 03:05:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,680 INFO L225 Difference]: With dead ends: 20 [2018-02-04 03:05:21,680 INFO L226 Difference]: Without dead ends: 18 [2018-02-04 03:05:21,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:05:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-04 03:05:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-04 03:05:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-04 03:05:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-04 03:05:21,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-02-04 03:05:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,682 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-04 03:05:21,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:05:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-04 03:05:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:05:21,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,682 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,682 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1616948477, now seen corresponding path program 1 times [2018-02-04 03:05:21,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:21,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:05:21,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,737 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-04 03:05:21,737 INFO L182 omatonBuilderFactory]: Interpolants [148#true, 149#false, 150#(= |#Ultimate.C_memset_#t~loopctr5| 0), 151#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 152#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:05:21,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:05:21,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:05:21,738 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-02-04 03:05:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,760 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-04 03:05:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:05:21,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:05:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,762 INFO L225 Difference]: With dead ends: 21 [2018-02-04 03:05:21,762 INFO L226 Difference]: Without dead ends: 19 [2018-02-04 03:05:21,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:05:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-02-04 03:05:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-02-04 03:05:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-02-04 03:05:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-02-04 03:05:21,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-02-04 03:05:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,765 INFO L432 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-02-04 03:05:21,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:05:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-02-04 03:05:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:05:21,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,766 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,766 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1998482120, now seen corresponding path program 2 times [2018-02-04 03:05:21,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:21,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:05:21,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,830 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-04 03:05:21,830 INFO L182 omatonBuilderFactory]: Interpolants [193#true, 194#false, 195#(= |#Ultimate.C_memset_#t~loopctr5| 0), 196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 198#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:05:21,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:05:21,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:05:21,831 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-02-04 03:05:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,849 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-04 03:05:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:05:21,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:05:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,850 INFO L225 Difference]: With dead ends: 22 [2018-02-04 03:05:21,850 INFO L226 Difference]: Without dead ends: 20 [2018-02-04 03:05:21,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:05:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-02-04 03:05:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-02-04 03:05:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-02-04 03:05:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-02-04 03:05:21,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-02-04 03:05:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,854 INFO L432 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-02-04 03:05:21,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:05:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-02-04 03:05:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:05:21,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,855 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,855 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1887286365, now seen corresponding path program 3 times [2018-02-04 03:05:21,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:21,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:05:21,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:21,928 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-04 03:05:21,928 INFO L182 omatonBuilderFactory]: Interpolants [241#true, 242#false, 243#(= |#Ultimate.C_memset_#t~loopctr5| 0), 244#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 247#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:21,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:05:21,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:05:21,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:05:21,929 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-02-04 03:05:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:21,946 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-02-04 03:05:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:05:21,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 03:05:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:21,947 INFO L225 Difference]: With dead ends: 23 [2018-02-04 03:05:21,947 INFO L226 Difference]: Without dead ends: 21 [2018-02-04 03:05:21,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:05:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-02-04 03:05:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-02-04 03:05:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-02-04 03:05:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-02-04 03:05:21,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-02-04 03:05:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:21,949 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-02-04 03:05:21,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:05:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-02-04 03:05:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:05:21,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:21,949 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:21,949 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2087025112, now seen corresponding path program 4 times [2018-02-04 03:05:21,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:21,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:05:22,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,021 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-04 03:05:22,021 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= |#Ultimate.C_memset_#t~loopctr5| 0), 295#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 296#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 298#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 299#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:05:22,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:05:22,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:05:22,022 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-02-04 03:05:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,039 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-02-04 03:05:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:05:22,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 03:05:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,041 INFO L225 Difference]: With dead ends: 24 [2018-02-04 03:05:22,041 INFO L226 Difference]: Without dead ends: 22 [2018-02-04 03:05:22,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:05:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-04 03:05:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-04 03:05:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-04 03:05:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-02-04 03:05:22,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-02-04 03:05:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,044 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-02-04 03:05:22,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:05:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-02-04 03:05:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:05:22,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,045 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,045 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -311008323, now seen corresponding path program 5 times [2018-02-04 03:05:22,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:05:22,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,111 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-04 03:05:22,111 INFO L182 omatonBuilderFactory]: Interpolants [352#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 353#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 354#(not (= |#Ultimate.C_memset_#amount| 80)), 346#true, 347#false, 348#(= |#Ultimate.C_memset_#t~loopctr5| 0), 349#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 350#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 351#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:05:22,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:05:22,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:05:22,112 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-02-04 03:05:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,136 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-02-04 03:05:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:05:22,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 03:05:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,136 INFO L225 Difference]: With dead ends: 25 [2018-02-04 03:05:22,137 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 03:05:22,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:05:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 03:05:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 03:05:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 03:05:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 03:05:22,139 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-02-04 03:05:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,139 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 03:05:22,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:05:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 03:05:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:05:22,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,140 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,140 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1635600776, now seen corresponding path program 6 times [2018-02-04 03:05:22,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,208 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-04 03:05:22,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:05:22,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,209 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-04 03:05:22,209 INFO L182 omatonBuilderFactory]: Interpolants [403#true, 404#false, 405#(= |#Ultimate.C_memset_#t~loopctr5| 0), 406#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 407#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 408#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 409#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 410#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 411#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 412#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:22,209 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-04 03:05:22,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:05:22,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:05:22,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:22,209 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-02-04 03:05:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,226 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-04 03:05:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:05:22,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 03:05:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,227 INFO L225 Difference]: With dead ends: 26 [2018-02-04 03:05:22,228 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 03:05:22,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:05:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 03:05:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 03:05:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 03:05:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-04 03:05:22,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-02-04 03:05:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,231 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-04 03:05:22,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:05:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-04 03:05:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:05:22,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,231 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,232 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash 251706141, now seen corresponding path program 7 times [2018-02-04 03:05:22,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:05:22,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,378 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-04 03:05:22,378 INFO L182 omatonBuilderFactory]: Interpolants [464#false, 465#(= |#Ultimate.C_memset_#t~loopctr5| 0), 466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 467#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 468#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 469#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 473#(not (= |#Ultimate.C_memset_#amount| 80)), 463#true] [2018-02-04 03:05:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:05:22,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:05:22,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:05:22,379 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 11 states. [2018-02-04 03:05:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,419 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-02-04 03:05:22,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:05:22,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 03:05:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,420 INFO L225 Difference]: With dead ends: 27 [2018-02-04 03:05:22,420 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 03:05:22,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:05:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 03:05:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 03:05:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 03:05:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-02-04 03:05:22,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-02-04 03:05:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,423 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-02-04 03:05:22,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:05:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-02-04 03:05:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:05:22,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,423 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,423 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1371321576, now seen corresponding path program 8 times [2018-02-04 03:05:22,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:05:22,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,537 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-04 03:05:22,537 INFO L182 omatonBuilderFactory]: Interpolants [528#(= |#Ultimate.C_memset_#t~loopctr5| 0), 529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 530#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 531#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 533#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 534#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 535#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 536#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 537#(not (= |#Ultimate.C_memset_#amount| 80)), 526#true, 527#false] [2018-02-04 03:05:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:05:22,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:05:22,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:05:22,538 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 12 states. [2018-02-04 03:05:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,579 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-02-04 03:05:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:05:22,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 03:05:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,580 INFO L225 Difference]: With dead ends: 28 [2018-02-04 03:05:22,580 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 03:05:22,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:05:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 03:05:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 03:05:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 03:05:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-02-04 03:05:22,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-02-04 03:05:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,583 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-02-04 03:05:22,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:05:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-02-04 03:05:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:05:22,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,592 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,592 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -145573251, now seen corresponding path program 9 times [2018-02-04 03:05:22,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:05:22,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,729 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-04 03:05:22,729 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(= |#Ultimate.C_memset_#t~loopctr5| 0), 595#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 596#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 597#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 598#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 599#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 601#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 602#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 604#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:05:22,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:05:22,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:05:22,729 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 13 states. [2018-02-04 03:05:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,760 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 03:05:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:05:22,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-02-04 03:05:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,764 INFO L225 Difference]: With dead ends: 29 [2018-02-04 03:05:22,764 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 03:05:22,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:05:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 03:05:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 03:05:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 03:05:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-04 03:05:22,767 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-02-04 03:05:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,767 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-04 03:05:22,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:05:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-04 03:05:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:05:22,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,768 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,768 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash -802080840, now seen corresponding path program 10 times [2018-02-04 03:05:22,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:22,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:05:22,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,884 INFO L182 omatonBuilderFactory]: Interpolants [672#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 673#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 674#(not (= |#Ultimate.C_memset_#amount| 80)), 661#true, 662#false, 663#(= |#Ultimate.C_memset_#t~loopctr5| 0), 664#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 665#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 666#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 667#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 668#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 669#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 671#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8))] [2018-02-04 03:05:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:22,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:05:22,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:05:22,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:22,885 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-02-04 03:05:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:22,900 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-02-04 03:05:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:05:22,900 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-04 03:05:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:22,901 INFO L225 Difference]: With dead ends: 30 [2018-02-04 03:05:22,901 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 03:05:22,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:05:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 03:05:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 03:05:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 03:05:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-04 03:05:22,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-02-04 03:05:22,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:22,903 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-04 03:05:22,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:05:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-04 03:05:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:05:22,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:22,903 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:22,903 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash 321020381, now seen corresponding path program 11 times [2018-02-04 03:05:22,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:22,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:23,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:05:23,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:23,023 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-04 03:05:23,023 INFO L182 omatonBuilderFactory]: Interpolants [736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 739#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 741#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 742#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 743#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 747#(not (= |#Ultimate.C_memset_#amount| 80)), 733#true, 734#false, 735#(= |#Ultimate.C_memset_#t~loopctr5| 0)] [2018-02-04 03:05:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:05:23,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:05:23,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:05:23,024 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2018-02-04 03:05:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:23,046 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 03:05:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:05:23,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-02-04 03:05:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:23,047 INFO L225 Difference]: With dead ends: 31 [2018-02-04 03:05:23,047 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 03:05:23,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:05:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 03:05:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 03:05:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 03:05:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-04 03:05:23,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-02-04 03:05:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:23,049 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-04 03:05:23,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:05:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-04 03:05:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:05:23,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:23,049 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:23,049 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 777419864, now seen corresponding path program 12 times [2018-02-04 03:05:23,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:23,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:23,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:05:23,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:23,179 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-04 03:05:23,179 INFO L182 omatonBuilderFactory]: Interpolants [808#true, 809#false, 810#(= |#Ultimate.C_memset_#t~loopctr5| 0), 811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 813#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 816#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 818#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 823#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:05:23,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:05:23,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:05:23,180 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-02-04 03:05:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:23,203 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-02-04 03:05:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:05:23,203 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-04 03:05:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:23,204 INFO L225 Difference]: With dead ends: 32 [2018-02-04 03:05:23,204 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 03:05:23,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:05:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 03:05:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 03:05:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 03:05:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-02-04 03:05:23,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-02-04 03:05:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:23,206 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-02-04 03:05:23,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:05:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-02-04 03:05:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:05:23,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:23,206 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:23,206 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2040901949, now seen corresponding path program 13 times [2018-02-04 03:05:23,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:23,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:23,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:05:23,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:23,383 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-04 03:05:23,383 INFO L182 omatonBuilderFactory]: Interpolants [896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 897#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 902#(not (= |#Ultimate.C_memset_#amount| 80)), 886#true, 887#false, 888#(= |#Ultimate.C_memset_#t~loopctr5| 0), 889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 890#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 893#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7))] [2018-02-04 03:05:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:05:23,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:05:23,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:05:23,396 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2018-02-04 03:05:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:23,432 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 03:05:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:05:23,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-02-04 03:05:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:23,433 INFO L225 Difference]: With dead ends: 33 [2018-02-04 03:05:23,433 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 03:05:23,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:05:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 03:05:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 03:05:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:05:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-02-04 03:05:23,436 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-02-04 03:05:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:23,436 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-02-04 03:05:23,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:05:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-02-04 03:05:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:05:23,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:23,437 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:23,437 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1740826376, now seen corresponding path program 14 times [2018-02-04 03:05:23,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:23,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:23,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:05:23,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:23,588 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-04 03:05:23,588 INFO L182 omatonBuilderFactory]: Interpolants [967#true, 968#false, 969#(= |#Ultimate.C_memset_#t~loopctr5| 0), 970#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 974#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 975#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 976#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 977#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 978#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 979#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 980#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 981#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 982#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 983#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 984#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:05:23,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:05:23,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:05:23,589 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2018-02-04 03:05:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:23,617 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-02-04 03:05:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:05:23,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-02-04 03:05:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:23,617 INFO L225 Difference]: With dead ends: 34 [2018-02-04 03:05:23,617 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 03:05:23,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:05:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 03:05:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 03:05:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 03:05:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-04 03:05:23,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-02-04 03:05:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:23,619 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-04 03:05:23,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:05:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-04 03:05:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:05:23,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:23,620 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:23,620 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1284679837, now seen corresponding path program 15 times [2018-02-04 03:05:23,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:23,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:23,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:05:23,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:23,765 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-04 03:05:23,766 INFO L182 omatonBuilderFactory]: Interpolants [1056#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1057#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1058#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1059#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1060#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1061#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1064#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1067#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1068#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1069#(not (= |#Ultimate.C_memset_#amount| 80)), 1051#true, 1052#false, 1053#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1054#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1055#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:23,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:05:23,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:05:23,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:05:23,775 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2018-02-04 03:05:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:23,817 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-02-04 03:05:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:05:23,819 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-02-04 03:05:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:23,819 INFO L225 Difference]: With dead ends: 35 [2018-02-04 03:05:23,819 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 03:05:23,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:05:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 03:05:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-04 03:05:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 03:05:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-04 03:05:23,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-02-04 03:05:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:23,825 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-04 03:05:23,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:05:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-04 03:05:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:05:23,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:23,825 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:23,825 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash 586091928, now seen corresponding path program 16 times [2018-02-04 03:05:23,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:23,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:24,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:05:24,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:24,015 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-04 03:05:24,015 INFO L182 omatonBuilderFactory]: Interpolants [1152#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1153#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1154#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1155#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1156#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1157#(not (= |#Ultimate.C_memset_#amount| 80)), 1138#true, 1139#false, 1140#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1141#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1142#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1143#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1144#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1145#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1146#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1147#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1148#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1149#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1150#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1151#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11))] [2018-02-04 03:05:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:05:24,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:05:24,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:05:24,016 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 20 states. [2018-02-04 03:05:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:24,038 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-02-04 03:05:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:05:24,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-02-04 03:05:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:24,043 INFO L225 Difference]: With dead ends: 36 [2018-02-04 03:05:24,043 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 03:05:24,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:05:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 03:05:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 03:05:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 03:05:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-04 03:05:24,046 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-02-04 03:05:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:24,046 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-04 03:05:24,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:05:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-04 03:05:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:05:24,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:24,047 INFO L351 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:24,047 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash 404703229, now seen corresponding path program 17 times [2018-02-04 03:05:24,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:24,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:24,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:05:24,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05: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-04 03:05:24,251 INFO L182 omatonBuilderFactory]: Interpolants [1248#(not (= |#Ultimate.C_memset_#amount| 80)), 1228#true, 1229#false, 1230#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1231#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1232#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1233#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1235#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1237#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1240#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1241#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1243#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1244#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17))] [2018-02-04 03:05:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:05:24,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:05:24,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:05:24,251 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 21 states. [2018-02-04 03:05:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:24,285 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-04 03:05:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:05:24,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-02-04 03:05:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:24,287 INFO L225 Difference]: With dead ends: 37 [2018-02-04 03:05:24,287 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 03:05:24,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:05:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 03:05:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 03:05:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 03:05:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-04 03:05:24,290 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-02-04 03:05:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:24,290 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-04 03:05:24,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:05:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-04 03:05:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:05:24,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:24,291 INFO L351 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:24,291 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -923379144, now seen corresponding path program 18 times [2018-02-04 03:05:24,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:24,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:24,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:05:24,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:24,508 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-04 03:05:24,508 INFO L182 omatonBuilderFactory]: Interpolants [1321#true, 1322#false, 1323#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1325#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1326#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1328#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1331#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1332#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1333#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1334#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1337#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1338#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1339#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1340#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1341#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1342#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:05:24,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:05:24,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:05:24,509 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 22 states. [2018-02-04 03:05:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:24,546 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-04 03:05:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:05:24,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 34 [2018-02-04 03:05:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:24,546 INFO L225 Difference]: With dead ends: 38 [2018-02-04 03:05:24,546 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 03:05:24,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:05:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 03:05:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 03:05:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 03:05:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 03:05:24,548 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-02-04 03:05:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:24,548 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 03:05:24,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:05:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 03:05:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:05:24,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:24,549 INFO L351 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:24,549 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 855740253, now seen corresponding path program 19 times [2018-02-04 03:05:24,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:24,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:24,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:05:24,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:24,764 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-04 03:05:24,764 INFO L182 omatonBuilderFactory]: Interpolants [1417#true, 1418#false, 1419#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1420#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1421#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1424#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1426#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1427#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1429#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1430#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1431#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1432#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1433#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1435#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1436#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1437#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1438#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1439#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:05:24,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:05:24,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:05:24,764 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-02-04 03:05:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:24,798 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-04 03:05:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:05:24,800 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-02-04 03:05:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:24,800 INFO L225 Difference]: With dead ends: 39 [2018-02-04 03:05:24,800 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 03:05:24,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:05:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 03:05:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 03:05:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 03:05:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-04 03:05:24,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-02-04 03:05:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:24,802 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-04 03:05:24,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:05:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-04 03:05:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:05:24,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:24,803 INFO L351 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:24,803 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 173866712, now seen corresponding path program 20 times [2018-02-04 03:05:24,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:24,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:24,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:24,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:05:24,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:24,999 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-04 03:05:24,999 INFO L182 omatonBuilderFactory]: Interpolants [1536#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1537#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1539#(not (= |#Ultimate.C_memset_#amount| 80)), 1516#true, 1517#false, 1518#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1519#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1520#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1521#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1522#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1523#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1524#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1525#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1526#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1527#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1528#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1530#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1532#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1535#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17))] [2018-02-04 03:05:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:05:25,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:05:25,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:05:25,000 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 24 states. [2018-02-04 03:05:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:25,021 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-02-04 03:05:25,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:05:25,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-02-04 03:05:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:25,022 INFO L225 Difference]: With dead ends: 40 [2018-02-04 03:05:25,022 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 03:05:25,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:05:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 03:05:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 03:05:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 03:05:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 03:05:25,024 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-02-04 03:05:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:25,024 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 03:05:25,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:05:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 03:05:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:05:25,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:25,025 INFO L351 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:25,025 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 510623421, now seen corresponding path program 21 times [2018-02-04 03:05:25,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:25,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:25,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:05:25,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:25,241 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-04 03:05:25,241 INFO L182 omatonBuilderFactory]: Interpolants [1618#true, 1619#false, 1620#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1623#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1624#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1628#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1629#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1632#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1633#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1635#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1636#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1638#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1639#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1640#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1642#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:05:25,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:05:25,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:05:25,242 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 25 states. [2018-02-04 03:05:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:25,267 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-04 03:05:25,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:05:25,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-02-04 03:05:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:25,267 INFO L225 Difference]: With dead ends: 41 [2018-02-04 03:05:25,267 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 03:05:25,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:05:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 03:05:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 03:05:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 03:05:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-02-04 03:05:25,269 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-02-04 03:05:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:25,269 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-02-04 03:05:25,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:05:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-02-04 03:05:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:05:25,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:25,270 INFO L351 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:25,270 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1934820488, now seen corresponding path program 22 times [2018-02-04 03:05:25,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:25,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:25,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:05:25,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:25,494 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-04 03:05:25,494 INFO L182 omatonBuilderFactory]: Interpolants [1728#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1730#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1731#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1734#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1735#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1737#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1738#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1739#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1740#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1742#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1743#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1744#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1745#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1747#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 1748#(not (= |#Ultimate.C_memset_#amount| 80)), 1723#true, 1724#false, 1725#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1727#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:05:25,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:05:25,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:05:25,495 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 26 states. [2018-02-04 03:05:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:25,525 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 03:05:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:05:25,526 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-02-04 03:05:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:25,526 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:05:25,526 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 03:05:25,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:05:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 03:05:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 03:05:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 03:05:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-04 03:05:25,527 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-02-04 03:05:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:25,528 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-04 03:05:25,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:05:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-04 03:05:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:05:25,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:25,528 INFO L351 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:25,528 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash -434170339, now seen corresponding path program 23 times [2018-02-04 03:05:25,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:25,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:25,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:05:25,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:25,762 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-04 03:05:25,762 INFO L182 omatonBuilderFactory]: Interpolants [1856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 1857#(not (= |#Ultimate.C_memset_#amount| 80)), 1831#true, 1832#false, 1833#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1838#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1840#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1841#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1843#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1844#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1846#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1847#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1849#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1853#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1854#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22))] [2018-02-04 03:05:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:25,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:05:25,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:05:25,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:05:25,763 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 27 states. [2018-02-04 03:05:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:25,778 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 03:05:25,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:05:25,778 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2018-02-04 03:05:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:25,779 INFO L225 Difference]: With dead ends: 43 [2018-02-04 03:05:25,779 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 03:05:25,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:05:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 03:05:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 03:05:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 03:05:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-02-04 03:05:25,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-02-04 03:05:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:25,780 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-02-04 03:05:25,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:05:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-02-04 03:05:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:05:25,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:25,781 INFO L351 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:25,781 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1158655976, now seen corresponding path program 24 times [2018-02-04 03:05:25,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:25,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:26,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:05:26,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:26,074 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-04 03:05:26,074 INFO L182 omatonBuilderFactory]: Interpolants [1942#true, 1943#false, 1944#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1945#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1946#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1947#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1948#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1949#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1950#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1951#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1952#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1953#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1954#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1955#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1956#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1957#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1958#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1959#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1960#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1961#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1962#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1963#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1964#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1965#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1966#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 1967#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 1968#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 1969#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:05:26,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:05:26,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:05:26,075 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 28 states. [2018-02-04 03:05:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:26,116 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 03:05:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:05:26,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-02-04 03:05:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:26,117 INFO L225 Difference]: With dead ends: 44 [2018-02-04 03:05:26,117 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 03:05:26,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:05:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 03:05:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 03:05:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 03:05:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-04 03:05:26,119 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-02-04 03:05:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:26,119 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-04 03:05:26,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:05:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-04 03:05:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:05:26,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:26,120 INFO L351 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:26,120 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2142874243, now seen corresponding path program 25 times [2018-02-04 03:05:26,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:26,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:26,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 03:05:26,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:26,418 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-04 03:05:26,418 INFO L182 omatonBuilderFactory]: Interpolants [2056#true, 2057#false, 2058#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2059#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2064#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2067#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2068#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2069#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2071#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2072#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2075#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2076#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2084#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:05:26,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:05:26,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:05:26,419 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 29 states. [2018-02-04 03:05:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:26,464 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-04 03:05:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:05:26,464 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 41 [2018-02-04 03:05:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:26,465 INFO L225 Difference]: With dead ends: 45 [2018-02-04 03:05:26,465 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 03:05:26,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:05:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 03:05:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 03:05:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 03:05:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 03:05:26,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-02-04 03:05:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:26,466 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 03:05:26,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:05:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 03:05:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:05:26,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:26,467 INFO L351 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:26,467 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1706097848, now seen corresponding path program 26 times [2018-02-04 03:05:26,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:26,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:26,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:05:26,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:26,811 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-04 03:05:26,811 INFO L182 omatonBuilderFactory]: Interpolants [2176#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2177#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2178#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2179#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2180#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2181#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2182#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2183#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2184#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2185#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2186#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2187#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2188#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2189#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2190#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2191#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2192#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2193#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2195#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2197#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2198#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2199#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2200#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2201#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2202#(not (= |#Ultimate.C_memset_#amount| 80)), 2173#true, 2174#false, 2175#(= |#Ultimate.C_memset_#t~loopctr5| 0)] [2018-02-04 03:05:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:26,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 03:05:26,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 03:05:26,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:05:26,812 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2018-02-04 03:05:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:26,873 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-04 03:05:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:05:26,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-02-04 03:05:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:26,874 INFO L225 Difference]: With dead ends: 46 [2018-02-04 03:05:26,874 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 03:05:26,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:05:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 03:05:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 03:05:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 03:05:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-04 03:05:26,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-02-04 03:05:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:26,876 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-04 03:05:26,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 03:05:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-04 03:05:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:05:26,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:26,876 INFO L351 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:26,876 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 765148381, now seen corresponding path program 27 times [2018-02-04 03:05:26,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:26,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:27,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:05:27,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:27,178 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-04 03:05:27,178 INFO L182 omatonBuilderFactory]: Interpolants [2304#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2305#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2308#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2309#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2310#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2311#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2314#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2317#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2318#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2319#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2320#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2322#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2323#(not (= |#Ultimate.C_memset_#amount| 80)), 2293#true, 2294#false, 2295#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2296#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2298#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2299#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2300#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2301#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2302#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8))] [2018-02-04 03:05:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:05:27,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:05:27,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=466, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:05:27,179 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 31 states. [2018-02-04 03:05:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:27,223 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-02-04 03:05:27,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:05:27,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-02-04 03:05:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:27,223 INFO L225 Difference]: With dead ends: 47 [2018-02-04 03:05:27,223 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 03:05:27,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=464, Invalid=466, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:05:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 03:05:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 03:05:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 03:05:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-04 03:05:27,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-02-04 03:05:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:27,225 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-04 03:05:27,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:05:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-04 03:05:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:05:27,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:27,225 INFO L351 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:27,225 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1660485976, now seen corresponding path program 28 times [2018-02-04 03:05:27,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:27,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:27,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:05:27,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:27,528 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-04 03:05:27,528 INFO L182 omatonBuilderFactory]: Interpolants [2432#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2435#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2436#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2437#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2438#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2439#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2440#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2441#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2442#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2443#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2444#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2445#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2446#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2447#(not (= |#Ultimate.C_memset_#amount| 80)), 2416#true, 2417#false, 2418#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2419#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2421#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2423#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2424#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2426#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2427#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2428#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2429#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2430#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2431#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13))] [2018-02-04 03:05:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:05:27,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:05:27,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:05:27,529 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 32 states. [2018-02-04 03:05:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:27,579 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 03:05:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:05:27,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-02-04 03:05:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:27,579 INFO L225 Difference]: With dead ends: 48 [2018-02-04 03:05:27,579 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 03:05:27,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:05:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 03:05:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 03:05:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 03:05:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 03:05:27,581 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-02-04 03:05:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:27,581 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 03:05:27,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:05:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 03:05:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:05:27,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:27,582 INFO L351 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:27,582 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash -648819651, now seen corresponding path program 29 times [2018-02-04 03:05:27,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:27,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:27,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 03:05:27,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:27,899 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-04 03:05:27,899 INFO L182 omatonBuilderFactory]: Interpolants [2560#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2562#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2563#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2564#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2565#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2566#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2567#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2568#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2569#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2570#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2571#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2573#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2574#(not (= |#Ultimate.C_memset_#amount| 80)), 2542#true, 2543#false, 2544#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2545#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2547#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2548#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2549#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2550#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2551#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2552#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2553#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2554#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2555#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2557#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2558#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2559#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:27,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:05:27,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:05:27,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:05:27,900 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 33 states. [2018-02-04 03:05:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:27,944 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-04 03:05:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:05:27,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-02-04 03:05:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:27,945 INFO L225 Difference]: With dead ends: 49 [2018-02-04 03:05:27,945 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 03:05:27,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:05:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 03:05:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 03:05:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 03:05:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-02-04 03:05:27,947 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-02-04 03:05:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:27,947 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-02-04 03:05:27,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:05:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-02-04 03:05:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:05:27,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:27,948 INFO L351 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:27,948 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash 777149944, now seen corresponding path program 30 times [2018-02-04 03:05:27,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:27,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:28,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:28,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 03:05:28,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:28,247 INFO L182 omatonBuilderFactory]: Interpolants [2688#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2690#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2691#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2692#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2694#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2695#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2696#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2699#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2700#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2702#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2703#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 2704#(not (= |#Ultimate.C_memset_#amount| 80)), 2671#true, 2672#false, 2673#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2674#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2676#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2677#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2678#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2680#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2682#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2684#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2685#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2687#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14))] [2018-02-04 03:05:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:28,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 03:05:28,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 03:05:28,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:05:28,248 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 34 states. [2018-02-04 03:05:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:28,286 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 03:05:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:05:28,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 46 [2018-02-04 03:05:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:28,286 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:05:28,286 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 03:05:28,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:05:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 03:05:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 03:05:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 03:05:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 03:05:28,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-02-04 03:05:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:28,288 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 03:05:28,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 03:05:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 03:05:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:05:28,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:28,289 INFO L351 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:28,289 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2032534429, now seen corresponding path program 31 times [2018-02-04 03:05:28,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:28,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:28,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:28,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 03:05:28,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:28,593 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-04 03:05:28,593 INFO L182 omatonBuilderFactory]: Interpolants [2816#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2818#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2819#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2820#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2821#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2824#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2827#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2828#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2830#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2831#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2832#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2833#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2834#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 2836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 2837#(not (= |#Ultimate.C_memset_#amount| 80)), 2803#true, 2804#false, 2805#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2806#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2807#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2808#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2809#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2812#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10))] [2018-02-04 03:05:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:28,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 03:05:28,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 03:05:28,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:05:28,594 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 35 states. [2018-02-04 03:05:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:28,626 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 03:05:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:05:28,626 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-02-04 03:05:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:28,626 INFO L225 Difference]: With dead ends: 51 [2018-02-04 03:05:28,626 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 03:05:28,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:05:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 03:05:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 03:05:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:05:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-04 03:05:28,628 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-02-04 03:05:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:28,628 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-04 03:05:28,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 03:05:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-04 03:05:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:05:28,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:28,628 INFO L351 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:28,628 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219496, now seen corresponding path program 32 times [2018-02-04 03:05:28,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:28,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:29,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:05:29,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:29,009 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-04 03:05:29,009 INFO L182 omatonBuilderFactory]: Interpolants [2944#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2945#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2946#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2947#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2948#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2949#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2950#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2951#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2952#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2953#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2954#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2955#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2956#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2957#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2958#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2959#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2960#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2961#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2962#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2963#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2964#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2965#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2966#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2967#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2968#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2969#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 2971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 2972#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 2973#(not (= |#Ultimate.C_memset_#amount| 80)), 2938#true, 2939#false, 2940#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2941#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2942#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2943#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 03:05:29,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 03:05:29,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=631, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:05:29,009 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 36 states. [2018-02-04 03:05:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:29,064 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-04 03:05:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 03:05:29,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2018-02-04 03:05:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:29,065 INFO L225 Difference]: With dead ends: 52 [2018-02-04 03:05:29,065 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:05:29,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=629, Invalid=631, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:05:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:05:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 03:05:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 03:05:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 03:05:29,066 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-02-04 03:05:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:29,066 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 03:05:29,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 03:05:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 03:05:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:05:29,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:29,066 INFO L351 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:29,066 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1833427709, now seen corresponding path program 33 times [2018-02-04 03:05:29,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:29,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:29,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 03:05:29,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:29,418 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-04 03:05:29,418 INFO L182 omatonBuilderFactory]: Interpolants [3076#true, 3077#false, 3078#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3080#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3089#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3094#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3099#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3100#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3102#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3103#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3104#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3105#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3106#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3107#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3108#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3109#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3110#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3112#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:05:29,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:05:29,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:05:29,419 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 37 states. [2018-02-04 03:05:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:29,468 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 03:05:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:05:29,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2018-02-04 03:05:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:29,471 INFO L225 Difference]: With dead ends: 53 [2018-02-04 03:05:29,471 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 03:05:29,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:05:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 03:05:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 03:05:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 03:05:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 03:05:29,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-02-04 03:05:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:29,472 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 03:05:29,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:05:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 03:05:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:05:29,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:29,473 INFO L351 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:29,473 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash 417406776, now seen corresponding path program 34 times [2018-02-04 03:05:29,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:29,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:29,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 03:05:29,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:29,891 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-04 03:05:29,892 INFO L182 omatonBuilderFactory]: Interpolants [3217#true, 3218#false, 3219#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3222#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3224#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3230#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3231#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3232#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3233#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3240#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3241#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3243#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3246#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3248#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3249#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3254#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:29,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 03:05:29,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 03:05:29,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:05:29,892 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 38 states. [2018-02-04 03:05:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:29,948 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-02-04 03:05:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:05:29,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-02-04 03:05:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:29,949 INFO L225 Difference]: With dead ends: 54 [2018-02-04 03:05:29,949 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 03:05:29,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:05:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 03:05:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 03:05:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 03:05:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 03:05:29,950 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-02-04 03:05:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:29,950 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 03:05:29,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 03:05:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 03:05:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:05:29,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:29,951 INFO L351 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:29,951 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -529569187, now seen corresponding path program 35 times [2018-02-04 03:05:29,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:29,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:30,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:30,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 03:05:30,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:30,367 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-04 03:05:30,367 INFO L182 omatonBuilderFactory]: Interpolants [3392#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3393#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3394#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3395#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3396#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3397#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3398#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3399#(not (= |#Ultimate.C_memset_#amount| 80)), 3361#true, 3362#false, 3363#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3364#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3365#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3366#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3367#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3368#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3369#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3372#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3373#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3374#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3375#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3376#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3377#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3378#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3379#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3380#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3381#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3382#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3383#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3384#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3385#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3386#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3388#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3389#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3390#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3391#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28))] [2018-02-04 03:05:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:30,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 03:05:30,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 03:05:30,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:05:30,367 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 39 states. [2018-02-04 03:05:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:30,393 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-02-04 03:05:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:05:30,393 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 51 [2018-02-04 03:05:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:30,394 INFO L225 Difference]: With dead ends: 55 [2018-02-04 03:05:30,394 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 03:05:30,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:05:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 03:05:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 03:05:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 03:05:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 03:05:30,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-02-04 03:05:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:30,395 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 03:05:30,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 03:05:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 03:05:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:05:30,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:30,396 INFO L351 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:30,396 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 178947032, now seen corresponding path program 36 times [2018-02-04 03:05:30,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:30,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:30,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:30,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 03:05:30,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:30,839 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-04 03:05:30,840 INFO L182 omatonBuilderFactory]: Interpolants [3520#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3521#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3522#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3523#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3524#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3525#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3526#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3527#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3528#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3530#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3532#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3533#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3535#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3536#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3537#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3538#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3539#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3540#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3541#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3542#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3543#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3544#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3545#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3546#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3547#(not (= |#Ultimate.C_memset_#amount| 80)), 3508#true, 3509#false, 3510#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3513#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3514#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3515#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3516#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3517#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3518#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:30,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 03:05:30,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 03:05:30,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:05:30,840 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 40 states. [2018-02-04 03:05:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:30,885 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-04 03:05:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:05:30,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-02-04 03:05:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:30,886 INFO L225 Difference]: With dead ends: 56 [2018-02-04 03:05:30,886 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 03:05:30,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:05:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 03:05:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 03:05:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 03:05:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-04 03:05:30,887 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-02-04 03:05:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:30,887 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-04 03:05:30,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 03:05:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-04 03:05:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 03:05:30,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:30,888 INFO L351 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:30,888 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 668113341, now seen corresponding path program 37 times [2018-02-04 03:05:30,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:30,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:31,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:31,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 03:05:31,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:31,331 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-04 03:05:31,331 INFO L182 omatonBuilderFactory]: Interpolants [3658#true, 3659#false, 3660#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3661#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3662#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3663#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3664#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3665#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3666#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3667#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3668#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3669#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3671#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3672#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3673#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3674#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3676#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3677#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3680#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3682#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3684#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3685#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3687#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3688#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3690#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3691#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3692#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3693#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3694#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3695#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3696#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 3698#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:31,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 03:05:31,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 03:05:31,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:05:31,332 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 41 states. [2018-02-04 03:05:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:31,380 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-04 03:05:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:05:31,380 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 53 [2018-02-04 03:05:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:31,380 INFO L225 Difference]: With dead ends: 57 [2018-02-04 03:05:31,380 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 03:05:31,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:05:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 03:05:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 03:05:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:05:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-02-04 03:05:31,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-02-04 03:05:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:31,382 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-02-04 03:05:31,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 03:05:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-02-04 03:05:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:05:31,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:31,382 INFO L351 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:31,382 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1347600264, now seen corresponding path program 38 times [2018-02-04 03:05:31,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:31,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:31,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:31,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 03:05:31,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:31,839 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-04 03:05:31,839 INFO L182 omatonBuilderFactory]: Interpolants [3840#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3841#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3843#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3844#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3846#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3847#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3850#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 3851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 3852#(not (= |#Ultimate.C_memset_#amount| 80)), 3811#true, 3812#false, 3813#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3814#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3815#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3818#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3819#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3822#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3823#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3824#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3825#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3827#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3828#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3830#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3832#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3833#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3835#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3836#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26))] [2018-02-04 03:05:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:31,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 03:05:31,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 03:05:31,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=860, Invalid=862, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:05:31,840 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 42 states. [2018-02-04 03:05:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:31,870 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-04 03:05:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:05:31,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2018-02-04 03:05:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:31,870 INFO L225 Difference]: With dead ends: 58 [2018-02-04 03:05:31,871 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 03:05:31,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=860, Invalid=862, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:05:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 03:05:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 03:05:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 03:05:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-04 03:05:31,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-02-04 03:05:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:31,872 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-04 03:05:31,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 03:05:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-04 03:05:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:05:31,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:31,872 INFO L351 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:31,872 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash 589787421, now seen corresponding path program 39 times [2018-02-04 03:05:31,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:31,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:32,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:32,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 03:05:32,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:32,332 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-04 03:05:32,332 INFO L182 omatonBuilderFactory]: Interpolants [3968#false, 3969#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3970#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3974#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3975#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3976#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3977#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3978#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3979#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3980#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3981#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3982#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3983#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3984#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3985#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3986#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3987#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3988#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3989#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3990#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3992#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3993#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3994#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3996#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3997#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3999#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4000#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4003#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4004#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4006#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4007#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4009#(not (= |#Ultimate.C_memset_#amount| 80)), 3967#true] [2018-02-04 03:05:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:32,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 03:05:32,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 03:05:32,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:05:32,333 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 43 states. [2018-02-04 03:05:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:32,393 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-04 03:05:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:05:32,393 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2018-02-04 03:05:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:32,393 INFO L225 Difference]: With dead ends: 59 [2018-02-04 03:05:32,393 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 03:05:32,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:05:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 03:05:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 03:05:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 03:05:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-04 03:05:32,395 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-02-04 03:05:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:32,395 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-04 03:05:32,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 03:05:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-04 03:05:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:05:32,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:32,395 INFO L351 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:32,395 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:32,395 INFO L82 PathProgramCache]: Analyzing trace with hash 519263512, now seen corresponding path program 40 times [2018-02-04 03:05:32,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:32,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:32,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:32,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 03:05:32,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:32,872 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-04 03:05:32,872 INFO L182 omatonBuilderFactory]: Interpolants [4160#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4161#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4162#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4163#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4164#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4165#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4166#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4167#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4168#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4169#(not (= |#Ultimate.C_memset_#amount| 80)), 4126#true, 4127#false, 4128#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4130#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4131#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4132#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4133#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4134#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4135#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4136#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4137#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4138#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4139#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4140#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4141#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4142#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4143#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4144#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4145#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4146#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4147#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4148#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4149#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4150#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4151#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4152#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4153#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4154#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4155#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4156#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4157#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4158#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4159#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:32,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 03:05:32,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 03:05:32,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=945, Invalid=947, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:05:32,873 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 44 states. [2018-02-04 03:05:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:32,904 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-04 03:05:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 03:05:32,904 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 56 [2018-02-04 03:05:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:32,904 INFO L225 Difference]: With dead ends: 60 [2018-02-04 03:05:32,905 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 03:05:32,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=945, Invalid=947, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:05:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 03:05:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 03:05:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 03:05:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-04 03:05:32,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-02-04 03:05:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:32,906 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-04 03:05:32,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 03:05:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-04 03:05:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 03:05:32,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:32,907 INFO L351 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:32,907 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1666977667, now seen corresponding path program 41 times [2018-02-04 03:05:32,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:32,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:33,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:33,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 03:05:33,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:33,493 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-04 03:05:33,493 INFO L182 omatonBuilderFactory]: Interpolants [4288#true, 4289#false, 4290#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4291#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4292#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4293#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4294#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4295#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4296#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4297#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4299#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4300#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4301#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4302#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4305#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4306#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4309#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4310#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4311#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4313#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4317#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4318#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4319#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4320#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4321#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4322#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4323#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4325#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4332#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:33,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 03:05:33,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 03:05:33,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:05:33,494 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 45 states. [2018-02-04 03:05:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:33,546 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-04 03:05:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 03:05:33,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 57 [2018-02-04 03:05:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:33,546 INFO L225 Difference]: With dead ends: 61 [2018-02-04 03:05:33,546 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 03:05:33,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:05:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 03:05:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 03:05:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 03:05:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-04 03:05:33,548 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-02-04 03:05:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:33,548 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-04 03:05:33,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 03:05:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-04 03:05:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 03:05:33,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:33,548 INFO L351 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:33,548 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash -720977480, now seen corresponding path program 42 times [2018-02-04 03:05:33,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:33,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:34,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:34,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 03:05:34,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:34,114 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-04 03:05:34,114 INFO L182 omatonBuilderFactory]: Interpolants [4480#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4481#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4482#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4483#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4484#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4485#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4486#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4487#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4488#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4489#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4490#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4492#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4493#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4494#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4496#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4498#(not (= |#Ultimate.C_memset_#amount| 80)), 4453#true, 4454#false, 4455#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4456#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4457#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4458#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4459#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4460#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4461#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4462#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4464#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4465#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4467#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4468#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4470#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4471#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4473#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4474#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4475#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4477#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4478#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4479#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:34,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 03:05:34,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 03:05:34,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:05:34,115 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 46 states. [2018-02-04 03:05:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:34,149 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-04 03:05:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 03:05:34,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-02-04 03:05:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:34,149 INFO L225 Difference]: With dead ends: 62 [2018-02-04 03:05:34,149 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:05:34,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:05:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:05:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:05:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:05:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-04 03:05:34,151 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-02-04 03:05:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:34,151 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-04 03:05:34,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 03:05:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-04 03:05:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:05:34,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:34,151 INFO L351 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:34,151 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1459742755, now seen corresponding path program 43 times [2018-02-04 03:05:34,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:34,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:34,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:34,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 03:05:34,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:34,732 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-04 03:05:34,732 INFO L182 omatonBuilderFactory]: Interpolants [4621#true, 4622#false, 4623#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4625#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4626#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4627#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4628#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4633#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4638#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4639#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4640#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4641#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4642#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4643#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4644#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4645#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4646#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4647#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4648#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4649#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4650#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4651#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4652#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4653#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4654#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4655#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4656#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4657#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4658#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4659#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4660#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4661#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4662#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4663#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4664#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4665#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4666#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 4667#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:34,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 03:05:34,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 03:05:34,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:05:34,733 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 47 states. [2018-02-04 03:05:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:34,803 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 03:05:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 03:05:34,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 59 [2018-02-04 03:05:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:34,804 INFO L225 Difference]: With dead ends: 63 [2018-02-04 03:05:34,804 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:05:34,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:05:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:05:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 03:05:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:05:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-04 03:05:34,805 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-02-04 03:05:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:34,805 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-04 03:05:34,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 03:05:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-04 03:05:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:05:34,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:34,806 INFO L351 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:34,806 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1408337496, now seen corresponding path program 44 times [2018-02-04 03:05:34,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:34,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:35,389 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-04 03:05:35,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:35,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 03:05:35,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:35,390 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-04 03:05:35,390 INFO L182 omatonBuilderFactory]: Interpolants [4800#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4802#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4803#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4804#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4805#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4806#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4807#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4809#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4810#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4816#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4824#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4827#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4828#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4830#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4832#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4833#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4836#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 4838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 4839#(not (= |#Ultimate.C_memset_#amount| 80)), 4792#true, 4793#false, 4794#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4795#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4796#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4797#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4798#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5))] [2018-02-04 03:05:35,390 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-04 03:05:35,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 03:05:35,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 03:05:35,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=1129, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:05:35,390 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 48 states. [2018-02-04 03:05:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:35,438 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-02-04 03:05:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:05:35,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-02-04 03:05:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:35,439 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:05:35,439 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 03:05:35,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1127, Invalid=1129, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:05:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 03:05:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 03:05:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:05:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-02-04 03:05:35,440 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-02-04 03:05:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:35,440 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-02-04 03:05:35,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 03:05:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-02-04 03:05:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:05:35,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:35,441 INFO L351 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:35,441 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash 124512061, now seen corresponding path program 45 times [2018-02-04 03:05:35,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:35,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:36,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:36,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 03:05:36,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:36,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-04 03:05:36,078 INFO L182 omatonBuilderFactory]: Interpolants [4992#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4993#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4994#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4996#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4997#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4999#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5005#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5006#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5007#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5009#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5010#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5011#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5014#(not (= |#Ultimate.C_memset_#amount| 80)), 4966#true, 4967#false, 4968#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4969#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4973#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4974#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4975#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4976#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4977#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4978#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4979#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4980#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4981#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4982#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4983#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4984#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4985#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4987#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4988#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4989#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4990#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23))] [2018-02-04 03:05:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:36,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 03:05:36,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 03:05:36,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:05:36,079 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 49 states. [2018-02-04 03:05:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:36,129 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-02-04 03:05:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 03:05:36,130 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 61 [2018-02-04 03:05:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:36,130 INFO L225 Difference]: With dead ends: 65 [2018-02-04 03:05:36,130 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 03:05:36,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:05:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 03:05:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 03:05:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 03:05:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 03:05:36,132 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-02-04 03:05:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:36,132 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 03:05:36,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 03:05:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 03:05:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:05:36,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:36,133 INFO L351 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:36,133 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1019370760, now seen corresponding path program 46 times [2018-02-04 03:05:36,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:36,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:36,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:36,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 03:05:36,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:36,766 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-04 03:05:36,766 INFO L182 omatonBuilderFactory]: Interpolants [5143#true, 5144#false, 5145#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5146#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5147#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5148#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5149#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5150#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5151#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5152#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5153#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5154#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5155#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5156#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5157#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5158#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5159#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5160#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5161#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5162#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5163#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5164#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5165#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5166#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5167#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5168#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5169#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5170#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5171#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5172#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5173#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5174#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5175#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5176#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5177#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5178#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5179#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5180#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5181#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5182#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5183#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5184#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5185#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5186#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5187#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5188#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5189#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5190#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5191#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5192#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:36,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 03:05:36,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 03:05:36,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=1226, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 03:05:36,767 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 50 states. [2018-02-04 03:05:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:36,796 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-02-04 03:05:36,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 03:05:36,796 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 62 [2018-02-04 03:05:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:36,796 INFO L225 Difference]: With dead ends: 66 [2018-02-04 03:05:36,796 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:05:36,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1224, Invalid=1226, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 03:05:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:05:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 03:05:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:05:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-04 03:05:36,798 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-02-04 03:05:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:36,798 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-04 03:05:36,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 03:05:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-04 03:05:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 03:05:36,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:36,798 INFO L351 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:36,798 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2119999843, now seen corresponding path program 47 times [2018-02-04 03:05:36,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:36,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:37,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:37,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 03:05:37,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:37,469 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-04 03:05:37,469 INFO L182 omatonBuilderFactory]: Interpolants [5323#true, 5324#false, 5325#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5329#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5331#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5333#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5337#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5339#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5340#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5341#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5343#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5344#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5345#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5346#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5348#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5349#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5350#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5352#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5353#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5354#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5355#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5356#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5357#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5358#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5359#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5360#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5361#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5362#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5363#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5364#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5365#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5366#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5367#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5368#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5369#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5372#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5373#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:37,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 03:05:37,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 03:05:37,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 03:05:37,470 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 51 states. [2018-02-04 03:05:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:37,530 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-04 03:05:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 03:05:37,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 63 [2018-02-04 03:05:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:37,530 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:05:37,530 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 03:05:37,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 03:05:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 03:05:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 03:05:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 03:05:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-04 03:05:37,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-02-04 03:05:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:37,532 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-04 03:05:37,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 03:05:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-04 03:05:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 03:05:37,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:37,532 INFO L351 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:37,532 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1879763048, now seen corresponding path program 48 times [2018-02-04 03:05:37,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:37,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:38,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:38,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 03:05:38,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:38,202 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-04 03:05:38,202 INFO L182 omatonBuilderFactory]: Interpolants [5506#true, 5507#false, 5508#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5509#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5510#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5511#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5515#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5516#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5517#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5518#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5519#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5520#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5521#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5522#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5523#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5524#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5525#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5526#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5527#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5528#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5530#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5534#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5535#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5536#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5537#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5539#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5540#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5541#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5542#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5543#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5544#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5545#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5547#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5548#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5549#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5550#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5551#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5552#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5553#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5554#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5555#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5556#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 5557#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:38,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 03:05:38,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 03:05:38,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:05:38,203 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 52 states. [2018-02-04 03:05:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:38,274 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 03:05:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 03:05:38,275 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 64 [2018-02-04 03:05:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:38,275 INFO L225 Difference]: With dead ends: 68 [2018-02-04 03:05:38,275 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 03:05:38,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:05:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 03:05:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 03:05:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 03:05:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-02-04 03:05:38,276 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-02-04 03:05:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:38,277 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-02-04 03:05:38,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 03:05:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-02-04 03:05:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:05:38,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:38,277 INFO L351 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:38,277 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1272610301, now seen corresponding path program 49 times [2018-02-04 03:05:38,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:38,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:38,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:38,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 03:05:38,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:38,977 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-04 03:05:38,977 INFO L182 omatonBuilderFactory]: Interpolants [5692#true, 5693#false, 5694#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5695#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5696#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5699#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5700#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5702#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5703#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5704#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5705#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5706#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5707#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5708#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5709#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5710#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5711#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5712#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5713#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5714#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5715#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5716#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5717#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5718#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5719#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5720#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5722#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5723#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5724#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5725#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5727#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5728#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5730#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5731#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5732#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5734#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5739#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5742#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 5743#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 5744#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:38,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 03:05:38,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 03:05:38,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:05:38,978 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 53 states. [2018-02-04 03:05:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:39,043 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-04 03:05:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 03:05:39,043 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 65 [2018-02-04 03:05:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:39,044 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:05:39,044 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:05:39,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:05:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:05:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 03:05:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:05:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-02-04 03:05:39,046 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-02-04 03:05:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:39,046 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-02-04 03:05:39,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 03:05:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-02-04 03:05:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:05:39,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:39,047 INFO L351 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:39,047 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:39,047 INFO L82 PathProgramCache]: Analyzing trace with hash 211936312, now seen corresponding path program 50 times [2018-02-04 03:05:39,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:39,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:39,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:39,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 03:05:39,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:39,761 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-04 03:05:39,761 INFO L182 omatonBuilderFactory]: Interpolants [5888#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5891#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5893#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5898#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5899#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5901#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5903#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5907#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5908#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5909#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5910#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5911#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5912#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5913#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5914#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5915#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5916#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5917#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5918#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5919#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5920#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5921#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5922#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5923#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5924#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5925#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5926#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5927#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5928#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5929#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5930#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5931#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 5932#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 5933#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 5934#(not (= |#Ultimate.C_memset_#amount| 80)), 5881#true, 5882#false, 5883#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5885#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5886#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5887#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:39,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 03:05:39,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 03:05:39,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1430, Invalid=1432, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:05:39,762 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 54 states. [2018-02-04 03:05:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:39,836 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-02-04 03:05:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 03:05:39,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 66 [2018-02-04 03:05:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:39,837 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:05:39,837 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:05:39,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1430, Invalid=1432, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:05:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:05:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 03:05:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:05:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 03:05:39,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-02-04 03:05:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:39,838 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 03:05:39,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 03:05:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 03:05:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:05:39,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:39,839 INFO L351 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:39,839 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1690781021, now seen corresponding path program 51 times [2018-02-04 03:05:39,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:39,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:40,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:40,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 03:05:40,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:40,592 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-04 03:05:40,592 INFO L182 omatonBuilderFactory]: Interpolants [6073#true, 6074#false, 6075#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6076#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6077#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6079#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6082#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6084#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6087#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6089#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6090#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6091#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6094#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6095#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6096#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6098#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6099#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6100#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6104#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6105#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6107#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6109#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6110#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6112#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6113#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6115#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6116#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6117#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6118#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6119#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6120#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6121#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6122#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6123#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6124#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6126#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6127#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:40,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 03:05:40,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 03:05:40,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 03:05:40,593 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 55 states. [2018-02-04 03:05:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:40,663 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-02-04 03:05:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 03:05:40,663 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2018-02-04 03:05:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:40,663 INFO L225 Difference]: With dead ends: 71 [2018-02-04 03:05:40,663 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:05:40,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 03:05:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:05:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 03:05:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:05:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-04 03:05:40,665 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-02-04 03:05:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:40,665 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-04 03:05:40,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 03:05:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-04 03:05:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:05:40,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:40,665 INFO L351 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:40,665 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 290326744, now seen corresponding path program 52 times [2018-02-04 03:05:40,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:40,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:41,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:41,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 03:05:41,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:41,481 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-04 03:05:41,481 INFO L182 omatonBuilderFactory]: Interpolants [6272#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6273#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6274#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6275#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6276#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6277#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6278#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6279#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6280#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6281#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6282#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6283#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6284#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6285#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6286#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6287#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6288#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6289#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6290#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6291#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6292#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6293#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6294#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6295#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6296#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6297#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6299#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6300#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6301#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6302#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6305#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6307#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6309#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6310#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6311#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6315#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6319#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6322#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6323#(not (= |#Ultimate.C_memset_#amount| 80)), 6268#true, 6269#false, 6270#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6271#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1))] [2018-02-04 03:05:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:41,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 03:05:41,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 03:05:41,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1539, Invalid=1541, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:05:41,482 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 56 states. [2018-02-04 03:05:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:41,562 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-04 03:05:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 03:05:41,562 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 68 [2018-02-04 03:05:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:41,562 INFO L225 Difference]: With dead ends: 72 [2018-02-04 03:05:41,562 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:05:41,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1539, Invalid=1541, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:05:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:05:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 03:05:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:05:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-04 03:05:41,564 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-02-04 03:05:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:41,564 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-04 03:05:41,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 03:05:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-04 03:05:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 03:05:41,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:41,564 INFO L351 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:41,564 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -174082883, now seen corresponding path program 53 times [2018-02-04 03:05:41,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:41,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:42,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:42,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 03:05:42,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:42,400 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-04 03:05:42,400 INFO L182 omatonBuilderFactory]: Interpolants [6466#true, 6467#false, 6468#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6470#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6471#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6472#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6473#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6474#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6475#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6477#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6478#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6479#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6480#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6481#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6482#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6483#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6484#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6485#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6486#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6487#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6488#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6489#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6490#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6492#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6493#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6494#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6496#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6497#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6498#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6499#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6500#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6501#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6502#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6503#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6505#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6506#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6507#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6508#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6509#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6510#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6511#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6515#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6516#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6517#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6518#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6519#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6520#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6521#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 6522#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:42,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 03:05:42,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 03:05:42,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:05:42,401 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 57 states. [2018-02-04 03:05:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:42,489 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-04 03:05:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 03:05:42,489 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 69 [2018-02-04 03:05:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:42,489 INFO L225 Difference]: With dead ends: 73 [2018-02-04 03:05:42,489 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 03:05:42,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:05:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 03:05:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 03:05:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 03:05:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-02-04 03:05:42,491 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-02-04 03:05:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:42,491 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-02-04 03:05:42,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 03:05:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-02-04 03:05:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 03:05:42,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:42,491 INFO L351 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:42,491 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1685879432, now seen corresponding path program 54 times [2018-02-04 03:05:42,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:42,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:43,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:43,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 03:05:43,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:43,367 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-04 03:05:43,368 INFO L182 omatonBuilderFactory]: Interpolants [6667#true, 6668#false, 6669#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6671#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6672#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6673#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6674#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6675#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6676#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6677#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6680#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6682#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6684#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6685#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6687#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6688#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6690#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6691#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6692#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6694#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6695#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6696#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6697#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6699#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6700#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6702#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6703#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6704#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6705#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6706#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6707#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6708#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6709#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6710#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6711#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6712#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6713#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6714#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6715#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6716#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6717#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6718#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6719#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6720#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6722#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 6723#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 6724#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:43,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 03:05:43,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 03:05:43,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:05:43,368 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 58 states. [2018-02-04 03:05:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:43,500 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-02-04 03:05:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 03:05:43,501 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 70 [2018-02-04 03:05:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:43,501 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:05:43,501 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 03:05:43,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:05:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 03:05:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 03:05:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 03:05:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-02-04 03:05:43,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-02-04 03:05:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:43,504 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-02-04 03:05:43,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 03:05:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-02-04 03:05:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:05:43,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:43,504 INFO L351 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:43,504 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:43,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1306932195, now seen corresponding path program 55 times [2018-02-04 03:05:43,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:43,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:44,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:44,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 03:05:44,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:44,488 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-04 03:05:44,489 INFO L182 omatonBuilderFactory]: Interpolants [6912#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6913#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6914#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6915#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6916#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6917#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6918#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6919#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6920#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6921#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6922#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6923#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6924#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6925#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6926#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 6927#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 6928#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 6929#(not (= |#Ultimate.C_memset_#amount| 80)), 6871#true, 6872#false, 6873#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6874#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6875#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6876#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6877#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6878#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6879#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6880#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6881#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6882#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6883#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6885#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6886#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6887#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6888#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6889#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6892#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6893#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6897#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6898#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6902#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6903#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6904#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6908#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6909#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6910#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6911#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:44,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 03:05:44,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 03:05:44,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 03:05:44,489 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 59 states. [2018-02-04 03:05:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:44,528 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-02-04 03:05:44,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 03:05:44,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 71 [2018-02-04 03:05:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:44,528 INFO L225 Difference]: With dead ends: 75 [2018-02-04 03:05:44,528 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 03:05:44,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 03:05:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 03:05:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 03:05:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 03:05:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-04 03:05:44,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-02-04 03:05:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:44,530 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-04 03:05:44,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 03:05:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-04 03:05:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:05:44,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:44,530 INFO L351 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:44,530 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1850497560, now seen corresponding path program 56 times [2018-02-04 03:05:44,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:44,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:45,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:45,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 03:05:45,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:45,419 INFO L182 omatonBuilderFactory]: Interpolants [7078#true, 7079#false, 7080#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7084#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7087#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7093#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7094#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7095#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7099#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7100#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7104#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7105#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7106#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7107#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7109#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7110#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7111#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7112#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7113#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7115#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7116#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7117#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7118#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7119#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7120#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7121#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7122#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7123#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7124#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7126#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7127#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7128#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7130#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7131#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7132#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7133#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7134#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7135#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7136#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7137#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:45,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 03:05:45,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 03:05:45,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:05:45,420 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 60 states. [2018-02-04 03:05:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:45,486 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-02-04 03:05:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 03:05:45,486 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 72 [2018-02-04 03:05:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:45,486 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:05:45,486 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:05:45,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:05:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:05:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 03:05:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:05:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-02-04 03:05:45,488 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-02-04 03:05:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:45,488 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-02-04 03:05:45,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 03:05:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-02-04 03:05:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 03:05:45,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:45,488 INFO L351 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:45,488 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash 946572157, now seen corresponding path program 57 times [2018-02-04 03:05:45,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:45,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:46,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:46,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 03:05:46,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:46,360 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-04 03:05:46,361 INFO L182 omatonBuilderFactory]: Interpolants [7296#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7297#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7299#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7300#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7301#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7302#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7305#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7306#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7309#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7310#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7311#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7313#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7317#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7318#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7319#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7320#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7321#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7322#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7323#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7325#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7333#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7337#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7338#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7339#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7340#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7341#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7343#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7344#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7345#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7346#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7348#(not (= |#Ultimate.C_memset_#amount| 80)), 7288#true, 7289#false, 7290#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7291#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7292#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7293#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7294#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7295#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5))] [2018-02-04 03:05:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:46,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 03:05:46,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 03:05:46,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:05:46,361 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 61 states. [2018-02-04 03:05:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:46,429 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-02-04 03:05:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 03:05:46,429 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 73 [2018-02-04 03:05:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:46,429 INFO L225 Difference]: With dead ends: 77 [2018-02-04 03:05:46,429 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 03:05:46,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:05:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 03:05:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 03:05:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:05:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-02-04 03:05:46,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-02-04 03:05:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:46,431 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-02-04 03:05:46,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 03:05:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-02-04 03:05:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 03:05:46,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:46,431 INFO L351 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:46,431 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1305311560, now seen corresponding path program 58 times [2018-02-04 03:05:46,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:46,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:47,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:47,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 03:05:47,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:47,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-04 03:05:47,362 INFO L182 omatonBuilderFactory]: Interpolants [7552#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7553#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7554#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7555#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7557#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7558#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7559#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7560#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 7562#(not (= |#Ultimate.C_memset_#amount| 80)), 7501#true, 7502#false, 7503#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7505#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7506#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7507#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7508#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7509#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7510#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7515#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7516#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7517#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7518#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7520#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7521#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7522#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7523#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7524#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7525#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7526#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7527#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7528#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7530#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7535#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7536#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7537#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7539#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7540#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7541#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7542#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7543#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7544#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7545#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7547#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7548#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7549#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7550#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7551#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:47,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 03:05:47,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 03:05:47,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:05:47,363 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 62 states. [2018-02-04 03:05:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:47,430 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-04 03:05:47,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 03:05:47,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 74 [2018-02-04 03:05:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:47,431 INFO L225 Difference]: With dead ends: 78 [2018-02-04 03:05:47,431 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:05:47,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:05:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:05:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 03:05:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:05:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-02-04 03:05:47,433 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-02-04 03:05:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:47,433 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-02-04 03:05:47,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 03:05:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-02-04 03:05:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:05:47,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:47,434 INFO L351 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:47,434 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1900737245, now seen corresponding path program 59 times [2018-02-04 03:05:47,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:47,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:48,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:48,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 03:05:48,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:48,588 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-04 03:05:48,588 INFO L182 omatonBuilderFactory]: Interpolants [7717#true, 7718#false, 7719#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7720#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7721#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7722#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7723#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7724#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7725#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7727#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7728#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7729#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7730#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7731#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7734#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7738#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7739#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7741#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7742#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7743#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7747#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7748#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7749#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7750#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7753#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7754#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7756#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7757#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7759#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7760#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7761#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7762#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7763#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7764#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7765#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7766#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7767#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7768#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7769#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7770#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7771#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7772#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7773#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7774#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7775#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7776#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7777#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 7778#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 7779#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:48,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 03:05:48,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 03:05:48,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 03:05:48,589 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 63 states. [2018-02-04 03:05:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:48,669 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-02-04 03:05:48,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 03:05:48,669 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 75 [2018-02-04 03:05:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:48,670 INFO L225 Difference]: With dead ends: 79 [2018-02-04 03:05:48,670 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 03:05:48,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 03:05:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 03:05:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 03:05:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:05:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-02-04 03:05:48,671 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-02-04 03:05:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:48,671 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-02-04 03:05:48,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 03:05:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-02-04 03:05:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:05:48,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:48,672 INFO L351 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:48,672 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1790964904, now seen corresponding path program 60 times [2018-02-04 03:05:48,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:48,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:49,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:49,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 03:05:49,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:49,733 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-04 03:05:49,733 INFO L182 omatonBuilderFactory]: Interpolants [7936#true, 7937#false, 7938#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7939#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7940#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7941#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7942#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7943#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7944#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7945#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7946#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7947#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7948#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7949#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7950#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7951#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7952#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7953#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7954#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7955#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7956#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7957#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7958#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7959#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7960#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7961#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7962#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7963#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7964#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7965#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7966#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7967#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7968#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7969#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7970#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7971#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7972#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7974#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7975#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7976#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7977#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7978#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7979#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7980#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7981#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7982#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7983#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7984#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7985#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7987#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7988#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7989#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7990#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7992#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7993#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7994#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7996#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 7997#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 7998#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 7999#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:49,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 03:05:49,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 03:05:49,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2015, Invalid=2017, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 03:05:49,734 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 64 states. [2018-02-04 03:05:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:49,840 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-02-04 03:05:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 03:05:49,840 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 76 [2018-02-04 03:05:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:49,841 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:05:49,841 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 03:05:49,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2015, Invalid=2017, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 03:05:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 03:05:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 03:05:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 03:05:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-04 03:05:49,843 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-02-04 03:05:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:49,843 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-04 03:05:49,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 03:05:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-04 03:05:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 03:05:49,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:49,844 INFO L351 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:49,844 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash -269614531, now seen corresponding path program 61 times [2018-02-04 03:05:49,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:49,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:50,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:50,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 03:05:50,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:50,857 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-04 03:05:50,858 INFO L182 omatonBuilderFactory]: Interpolants [8192#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8193#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8195#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8198#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8199#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8200#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8201#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8202#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8203#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8204#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8205#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8206#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8207#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8208#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8209#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8210#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8211#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8212#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8213#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8214#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8215#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8216#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8217#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8218#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8219#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8222#(not (= |#Ultimate.C_memset_#amount| 80)), 8158#true, 8159#false, 8160#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8161#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8162#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8163#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8164#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8165#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8166#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8167#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8168#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8169#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8170#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8171#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8172#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8173#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8174#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8175#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8176#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8177#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8178#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8179#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8180#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8181#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8182#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8183#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8184#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8185#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8186#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8187#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8188#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8189#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8190#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8191#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:50,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 03:05:50,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 03:05:50,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:05:50,858 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 65 states. [2018-02-04 03:05:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:50,934 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-02-04 03:05:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 03:05:50,934 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 77 [2018-02-04 03:05:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:50,935 INFO L225 Difference]: With dead ends: 81 [2018-02-04 03:05:50,935 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 03:05:50,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:05:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 03:05:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 03:05:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 03:05:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-02-04 03:05:50,937 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-02-04 03:05:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:50,937 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-02-04 03:05:50,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 03:05:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-02-04 03:05:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 03:05:50,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:50,938 INFO L351 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:50,938 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -352393224, now seen corresponding path program 62 times [2018-02-04 03:05:50,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:50,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:52,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:52,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 03:05:52,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:52,106 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-04 03:05:52,106 INFO L182 omatonBuilderFactory]: Interpolants [8448#(not (= |#Ultimate.C_memset_#amount| 80)), 8383#true, 8384#false, 8385#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8386#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8388#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8389#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8390#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8391#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8392#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8393#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8394#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8395#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8396#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8397#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8398#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8399#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8400#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8401#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8402#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8403#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8404#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8405#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8406#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8407#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8408#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8409#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8410#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8411#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8412#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8413#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8414#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8415#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8416#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8417#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8418#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8419#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8421#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8424#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8426#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8427#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8429#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8430#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8431#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8434#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8435#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8436#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8437#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8438#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8439#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8440#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8441#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8442#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8443#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8444#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8445#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8447#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:52,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 03:05:52,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 03:05:52,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2144, Invalid=2146, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 03:05:52,107 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 66 states. [2018-02-04 03:05:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:52,188 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-02-04 03:05:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 03:05:52,188 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 78 [2018-02-04 03:05:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:52,188 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:05:52,188 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:05:52,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2144, Invalid=2146, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 03:05:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:05:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 03:05:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 03:05:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-02-04 03:05:52,190 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-02-04 03:05:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:52,190 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-02-04 03:05:52,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 03:05:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-02-04 03:05:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 03:05:52,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:52,191 INFO L351 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:52,191 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1376434589, now seen corresponding path program 63 times [2018-02-04 03:05:52,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:52,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:53,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:53,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 03:05:53,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:53,284 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-04 03:05:53,284 INFO L182 omatonBuilderFactory]: Interpolants [8611#true, 8612#false, 8613#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8615#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8616#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8617#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8618#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8623#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8629#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8631#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8632#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8637#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8638#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8639#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8640#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8642#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8643#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8644#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8645#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8646#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8647#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8648#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8649#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8650#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8651#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8652#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8653#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8654#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8655#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8656#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8657#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8658#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8659#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8660#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8661#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8662#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8663#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8664#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8665#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8666#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8667#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8668#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8669#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8671#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8672#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8673#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8674#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 8676#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 8677#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:53,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 03:05:53,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 03:05:53,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 03:05:53,285 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 67 states. [2018-02-04 03:05:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:53,376 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-04 03:05:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 03:05:53,377 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 79 [2018-02-04 03:05:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:53,377 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:05:53,377 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 03:05:53,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 03:05:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 03:05:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 03:05:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:05:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-02-04 03:05:53,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-02-04 03:05:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:53,379 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-02-04 03:05:53,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 03:05:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-02-04 03:05:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:05:53,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:53,379 INFO L351 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:53,379 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash -864478056, now seen corresponding path program 64 times [2018-02-04 03:05:53,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:53,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:54,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:54,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 03:05:54,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:54,700 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-04 03:05:54,700 INFO L182 omatonBuilderFactory]: Interpolants [8842#true, 8843#false, 8844#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8846#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8853#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8854#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8858#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8859#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8860#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8861#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8862#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8863#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8864#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8865#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8866#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8867#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8868#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8869#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8870#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8871#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8872#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8873#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8874#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8875#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8876#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8877#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8878#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8879#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8880#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8881#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8882#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8883#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8885#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8886#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8887#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8888#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8893#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8905#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8906#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 8907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 8908#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 8909#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:05:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:54,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 03:05:54,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 03:05:54,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 03:05:54,701 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 68 states. [2018-02-04 03:05:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:54,798 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-02-04 03:05:54,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 03:05:54,798 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 80 [2018-02-04 03:05:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:54,799 INFO L225 Difference]: With dead ends: 84 [2018-02-04 03:05:54,799 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:05:54,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 03:05:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:05:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 03:05:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:05:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-02-04 03:05:54,801 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-02-04 03:05:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:54,801 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-02-04 03:05:54,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 03:05:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-02-04 03:05:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:05:54,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:54,802 INFO L351 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:54,802 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1613293315, now seen corresponding path program 65 times [2018-02-04 03:05:54,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:54,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:56,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:56,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 03:05:56,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:56,189 INFO L182 omatonBuilderFactory]: Interpolants [9088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9089#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9094#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9099#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9100#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9102#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9103#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9104#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9105#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9106#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9107#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9108#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9109#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9110#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9112#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9113#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9115#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9116#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9117#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9118#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9119#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9120#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9121#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9122#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9123#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9124#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9125#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9126#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9127#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9128#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9130#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9131#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9132#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9133#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9134#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9135#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9136#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9137#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9138#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9139#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9140#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9141#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9142#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9143#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9144#(not (= |#Ultimate.C_memset_#amount| 80)), 9076#true, 9077#false, 9078#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9080#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:56,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 03:05:56,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 03:05:56,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 03:05:56,190 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 69 states. [2018-02-04 03:05:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:56,273 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-02-04 03:05:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 03:05:56,274 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 81 [2018-02-04 03:05:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:56,274 INFO L225 Difference]: With dead ends: 85 [2018-02-04 03:05:56,274 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:05:56,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 03:05:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:05:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 03:05:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:05:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-04 03:05:56,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-02-04 03:05:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:56,275 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-04 03:05:56,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 03:05:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-04 03:05:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:05:56,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:56,276 INFO L351 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:56,276 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash 943237432, now seen corresponding path program 66 times [2018-02-04 03:05:56,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:56,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:57,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:57,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 03:05:57,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:57,530 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-04 03:05:57,530 INFO L182 omatonBuilderFactory]: Interpolants [9344#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9345#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9346#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9348#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9349#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9350#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9352#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9353#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9354#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9355#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9356#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9357#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9358#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9359#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9360#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9361#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9362#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9363#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9364#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9365#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9366#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9367#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9368#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9369#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9372#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9373#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9374#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9375#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9376#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9377#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9378#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9379#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9380#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9381#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 9382#(not (= |#Ultimate.C_memset_#amount| 80)), 9313#true, 9314#false, 9315#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9319#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9322#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9323#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9324#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9327#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9328#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9330#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9333#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9334#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9335#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9337#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9339#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9340#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9341#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9343#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28))] [2018-02-04 03:05:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:57,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 03:05:57,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 03:05:57,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 03:05:57,530 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 70 states. [2018-02-04 03:05:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:57,592 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-02-04 03:05:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 03:05:57,592 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 82 [2018-02-04 03:05:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:57,592 INFO L225 Difference]: With dead ends: 86 [2018-02-04 03:05:57,592 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 03:05:57,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 03:05:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 03:05:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 03:05:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 03:05:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-02-04 03:05:57,593 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-02-04 03:05:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:57,593 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-02-04 03:05:57,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 03:05:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-02-04 03:05:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 03:05:57,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:57,594 INFO L351 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:57,594 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1408688035, now seen corresponding path program 67 times [2018-02-04 03:05:57,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:57,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:05:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:58,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:05:58,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 03:05:58,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:05:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:58,865 INFO L182 omatonBuilderFactory]: Interpolants [9600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9601#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9602#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9604#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9605#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9606#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9607#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9608#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9609#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9610#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9612#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9613#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9616#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9617#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9618#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 9622#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 9623#(not (= |#Ultimate.C_memset_#amount| 80)), 9553#true, 9554#false, 9555#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9557#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9558#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9559#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9560#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9562#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9563#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9564#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9565#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9566#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9567#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9568#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9569#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9570#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9571#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9573#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9574#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9575#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9576#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9578#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9579#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9580#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9581#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9582#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9583#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9584#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9585#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9586#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9587#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9588#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9589#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9590#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9591#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9592#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9593#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9594#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9595#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9596#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9597#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9598#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9599#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:05:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:05:58,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 03:05:58,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 03:05:58,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 03:05:58,865 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 71 states. [2018-02-04 03:05:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:05:58,920 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-02-04 03:05:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 03:05:58,920 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 83 [2018-02-04 03:05:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:05:58,921 INFO L225 Difference]: With dead ends: 87 [2018-02-04 03:05:58,921 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 03:05:58,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 03:05:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 03:05:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 03:05:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 03:05:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-02-04 03:05:58,922 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-02-04 03:05:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:05:58,922 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-02-04 03:05:58,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 03:05:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-02-04 03:05:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 03:05:58,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:05:58,922 INFO L351 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:05:58,922 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:05:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1303933480, now seen corresponding path program 68 times [2018-02-04 03:05:58,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:05:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:05:58,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:00,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:00,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 03:06:00,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:00,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-04 03:06:00,200 INFO L182 omatonBuilderFactory]: Interpolants [9856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9858#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9859#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9860#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9861#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9862#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9863#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9864#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 9865#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 9866#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 9867#(not (= |#Ultimate.C_memset_#amount| 80)), 9796#true, 9797#false, 9798#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9800#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9801#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9802#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9803#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9804#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9805#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9806#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9807#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9809#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9812#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9813#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9819#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9822#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9824#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9825#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9827#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9828#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9830#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9831#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9832#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9833#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9837#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9838#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9839#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9840#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9843#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9844#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9845#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9846#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9847#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9848#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9853#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9854#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57))] [2018-02-04 03:06:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:00,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 03:06:00,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 03:06:00,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 03:06:00,201 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 72 states. [2018-02-04 03:06:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:00,247 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-04 03:06:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 03:06:00,247 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 84 [2018-02-04 03:06:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:00,247 INFO L225 Difference]: With dead ends: 88 [2018-02-04 03:06:00,247 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 03:06:00,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 03:06:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 03:06:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 03:06:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 03:06:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-02-04 03:06:00,249 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-02-04 03:06:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:00,249 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-02-04 03:06:00,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 03:06:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-02-04 03:06:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 03:06:00,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:00,249 INFO L351 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:00,249 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1943457725, now seen corresponding path program 69 times [2018-02-04 03:06:00,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:00,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:01,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:01,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 03:06:01,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:01,723 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-04 03:06:01,723 INFO L182 omatonBuilderFactory]: Interpolants [10112#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10113#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10114#(not (= |#Ultimate.C_memset_#amount| 80)), 10042#true, 10043#false, 10044#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10045#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10046#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10047#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10048#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10049#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10050#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10051#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10052#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10053#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10054#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10055#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10056#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10057#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10058#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10059#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10061#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10064#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10067#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10068#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10069#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10071#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10072#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10075#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10076#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10078#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10079#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10085#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10088#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10089#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10091#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10092#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10093#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10094#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10096#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10098#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10099#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10100#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10104#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10105#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10107#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10109#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10110#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67))] [2018-02-04 03:06:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:01,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 03:06:01,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 03:06:01,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 03:06:01,724 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 73 states. [2018-02-04 03:06:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:01,811 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-02-04 03:06:01,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 03:06:01,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 85 [2018-02-04 03:06:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:01,812 INFO L225 Difference]: With dead ends: 89 [2018-02-04 03:06:01,812 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 03:06:01,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 03:06:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 03:06:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 03:06:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 03:06:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-02-04 03:06:01,814 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-02-04 03:06:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:01,814 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-02-04 03:06:01,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 03:06:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-02-04 03:06:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:06:01,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:01,814 INFO L351 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:01,814 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -466630024, now seen corresponding path program 70 times [2018-02-04 03:06:01,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:01,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:03,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:03,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 03:06:03,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:03,585 INFO L182 omatonBuilderFactory]: Interpolants [10291#true, 10292#false, 10293#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10294#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10295#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10296#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10299#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10300#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10301#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10302#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10305#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10309#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10310#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10311#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10314#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10315#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10319#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10323#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10324#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10327#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10330#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10333#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10336#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10337#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10339#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10340#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10341#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10343#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10344#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10345#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10346#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10348#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10349#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10350#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10352#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10353#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10354#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10355#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10356#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10357#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10358#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10359#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10360#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10361#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10362#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10363#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 10364#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:06:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:03,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 03:06:03,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 03:06:03,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 03:06:03,586 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 74 states. [2018-02-04 03:06:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:03,695 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-02-04 03:06:03,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 03:06:03,695 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 86 [2018-02-04 03:06:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:03,696 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:06:03,696 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 03:06:03,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 03:06:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 03:06:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 03:06:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:06:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-04 03:06:03,697 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-02-04 03:06:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:03,697 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-04 03:06:03,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 03:06:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-04 03:06:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:06:03,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:03,698 INFO L351 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:03,698 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2130061085, now seen corresponding path program 71 times [2018-02-04 03:06:03,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:03,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:05,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:05,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 03:06:05,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:05,077 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-04 03:06:05,078 INFO L182 omatonBuilderFactory]: Interpolants [10543#true, 10544#false, 10545#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10546#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10547#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10548#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10549#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10550#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10551#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10552#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10553#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10554#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10555#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10557#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10558#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10559#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10560#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10561#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10562#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10563#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10564#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10565#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10566#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10567#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10568#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10569#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10570#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10571#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10573#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10574#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10575#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10576#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10578#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10579#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10580#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10581#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10582#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10583#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10584#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10585#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10586#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10587#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10588#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10589#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10590#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10591#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10592#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10593#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10594#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10595#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10596#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10597#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10598#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10599#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10601#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10602#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10603#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10604#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10605#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10606#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10607#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10608#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10609#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10610#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10612#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10613#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 10616#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 10617#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:06:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:05,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 03:06:05,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 03:06:05,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 03:06:05,079 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 75 states. [2018-02-04 03:06:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:05,186 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-02-04 03:06:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 03:06:05,186 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 87 [2018-02-04 03:06:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:05,187 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:06:05,187 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 03:06:05,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 03:06:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 03:06:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 03:06:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:06:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-02-04 03:06:05,188 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-02-04 03:06:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:05,188 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-02-04 03:06:05,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 03:06:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-02-04 03:06:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 03:06:05,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:05,189 INFO L351 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:05,189 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1023106840, now seen corresponding path program 72 times [2018-02-04 03:06:05,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:05,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:06,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:06,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-02-04 03:06:06,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:06,600 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-04 03:06:06,600 INFO L182 omatonBuilderFactory]: Interpolants [10798#true, 10799#false, 10800#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10802#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10803#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10804#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10805#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10806#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10807#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10809#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10812#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10814#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10815#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10819#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10820#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10823#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10824#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10827#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10828#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10830#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10832#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10833#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10836#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10840#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10842#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10843#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10844#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10846#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10853#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10854#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10858#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10859#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10860#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10861#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10862#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10863#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10864#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10865#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10866#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10867#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10868#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10869#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10870#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 10871#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 10872#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 10873#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:06:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:06,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 03:06:06,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 03:06:06,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2849, Invalid=2851, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:06:06,601 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 76 states. [2018-02-04 03:06:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:06,707 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-02-04 03:06:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 03:06:06,707 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 88 [2018-02-04 03:06:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:06,708 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:06:06,708 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:06:06,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2849, Invalid=2851, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:06:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:06:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-04 03:06:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:06:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-02-04 03:06:06,709 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-02-04 03:06:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:06,710 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-02-04 03:06:06,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 03:06:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-02-04 03:06:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:06:06,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:06,710 INFO L351 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:06,710 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1067263613, now seen corresponding path program 73 times [2018-02-04 03:06:06,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:06,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:08,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:08,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 03:06:08,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:08,210 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-04 03:06:08,210 INFO L182 omatonBuilderFactory]: Interpolants [11056#true, 11057#false, 11058#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11059#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11064#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11067#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11068#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11069#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11071#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11072#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11075#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11076#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11088#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11094#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11095#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11098#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11099#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11100#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11101#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11102#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11104#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11105#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11107#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11109#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11110#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11112#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11113#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11115#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11116#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11117#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11118#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11119#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11120#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11121#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11122#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11123#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11124#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11126#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11127#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11128#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11130#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11131#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11132#(not (= |#Ultimate.C_memset_#amount| 80))] [2018-02-04 03:06:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:08,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 03:06:08,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 03:06:08,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 03:06:08,211 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 77 states. [2018-02-04 03:06:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:08,322 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-04 03:06:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 03:06:08,323 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 89 [2018-02-04 03:06:08,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:08,324 INFO L225 Difference]: With dead ends: 93 [2018-02-04 03:06:08,324 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:06:08,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 03:06:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:06:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:06:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:06:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-02-04 03:06:08,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-02-04 03:06:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:08,325 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-02-04 03:06:08,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 03:06:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-02-04 03:06:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 03:06:08,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:08,326 INFO L351 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:08,326 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1858843720, now seen corresponding path program 74 times [2018-02-04 03:06:08,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:08,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:09,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:09,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-02-04 03:06:09,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:09,810 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-04 03:06:09,810 INFO L182 omatonBuilderFactory]: Interpolants [11392#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11393#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 11394#(not (= |#Ultimate.C_memset_#amount| 80)), 11317#true, 11318#false, 11319#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11321#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11323#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11327#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11331#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11333#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11335#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11337#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11339#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11340#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11341#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11343#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11344#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11345#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11346#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11348#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11349#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11350#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11352#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11353#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11354#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11355#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11356#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11357#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11358#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11359#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11360#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11361#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11362#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11363#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11364#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11365#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11366#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11367#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11368#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11369#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11372#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11373#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11374#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11375#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11376#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11377#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11378#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11379#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11380#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11381#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11382#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11383#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11384#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11385#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11386#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11388#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11389#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11390#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11391#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:06:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:09,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 03:06:09,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 03:06:09,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3002, Invalid=3004, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 03:06:09,811 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 78 states. [2018-02-04 03:06:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:09,862 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-02-04 03:06:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 03:06:09,862 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 90 [2018-02-04 03:06:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:09,862 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:06:09,862 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:06:09,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3002, Invalid=3004, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 03:06:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:06:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 03:06:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:06:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-02-04 03:06:09,864 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-02-04 03:06:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:09,864 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-02-04 03:06:09,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 03:06:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-02-04 03:06:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 03:06:09,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:09,864 INFO L351 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:09,864 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1921109469, now seen corresponding path program 75 times [2018-02-04 03:06:09,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:09,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:11,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:11,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-02-04 03:06:11,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:11,353 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-04 03:06:11,353 INFO L182 omatonBuilderFactory]: Interpolants [11648#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11649#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11650#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11651#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11652#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11653#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11654#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11655#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11656#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11657#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 11658#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 11659#(not (= |#Ultimate.C_memset_#amount| 80)), 11581#true, 11582#false, 11583#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11584#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11585#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11586#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11587#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11588#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11589#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11590#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11591#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11592#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11593#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11594#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11595#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11596#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11597#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11598#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11599#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11601#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11602#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11604#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11605#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11606#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11607#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11608#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11609#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11610#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11612#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11613#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11614#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11616#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11617#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11618#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11620#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11621#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11622#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11623#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11624#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11626#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11627#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11628#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11630#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11631#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11632#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11633#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11638#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11639#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11640#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11642#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11643#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11644#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11645#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11646#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11647#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64))] [2018-02-04 03:06:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:11,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 03:06:11,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 03:06:11,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 03:06:11,354 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 79 states. [2018-02-04 03:06:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:11,409 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-02-04 03:06:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 03:06:11,553 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 91 [2018-02-04 03:06:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:11,554 INFO L225 Difference]: With dead ends: 95 [2018-02-04 03:06:11,554 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:06:11,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 03:06:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:06:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 03:06:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:06:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-04 03:06:11,556 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-02-04 03:06:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:11,556 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-04 03:06:11,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 03:06:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-04 03:06:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:06:11,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:11,557 INFO L351 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:11,557 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1159425960, now seen corresponding path program 76 times [2018-02-04 03:06:11,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:11,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:13,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:13,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-02-04 03:06:13,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:13,091 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-04 03:06:13,091 INFO L182 omatonBuilderFactory]: Interpolants [11904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11908#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11909#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11910#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11911#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11912#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11913#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11914#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11915#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11916#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11917#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11918#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11919#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11920#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11921#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11922#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11923#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11924#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 11925#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 11926#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 11927#(not (= |#Ultimate.C_memset_#amount| 80)), 11848#true, 11849#false, 11850#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11852#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11853#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11854#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11858#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11859#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11860#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11861#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11862#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11863#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11864#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11865#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11866#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11867#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11868#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11869#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11870#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11871#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11872#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11873#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11874#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11875#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11876#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11877#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11878#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11879#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11880#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11881#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11882#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11883#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11885#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11886#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11887#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11888#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11892#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11893#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11894#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11897#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11898#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53))] [2018-02-04 03:06:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:13,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 03:06:13,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 03:06:13,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3159, Invalid=3161, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 03:06:13,092 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 80 states. [2018-02-04 03:06:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:13,179 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-02-04 03:06:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 03:06:13,179 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 92 [2018-02-04 03:06:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:13,179 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:06:13,180 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:06:13,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3159, Invalid=3161, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 03:06:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:06:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 03:06:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:06:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-02-04 03:06:13,181 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-02-04 03:06:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:13,181 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-02-04 03:06:13,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 03:06:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-02-04 03:06:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:06:13,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:13,181 INFO L351 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:13,181 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2128223549, now seen corresponding path program 77 times [2018-02-04 03:06:13,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:13,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:14,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:14,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 03:06:14,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:14,795 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-04 03:06:14,795 INFO L182 omatonBuilderFactory]: Interpolants [12160#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12161#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12162#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12163#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12164#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12165#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12166#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12167#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12168#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12169#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12170#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12171#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12172#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12173#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12174#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12175#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12176#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12177#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12178#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12179#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12180#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12181#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12182#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12183#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12184#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12185#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12186#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12187#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12188#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12189#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12190#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12191#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12192#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12193#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12195#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12197#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12198#(not (= |#Ultimate.C_memset_#amount| 80)), 12118#true, 12119#false, 12120#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12121#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12122#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 12123#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12124#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12126#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12127#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12128#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12129#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12130#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12131#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12132#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12133#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12134#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12135#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12136#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12137#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12138#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12139#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12140#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12141#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12142#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12143#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12144#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12145#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12146#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12147#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12148#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12149#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12150#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12151#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12152#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12153#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12154#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12155#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12156#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12157#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12158#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12159#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39))] [2018-02-04 03:06:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:14,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 03:06:14,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 03:06:14,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 03:06:14,796 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 81 states. [2018-02-04 03:06:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:14,867 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-02-04 03:06:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 03:06:14,868 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 93 [2018-02-04 03:06:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:14,868 INFO L225 Difference]: With dead ends: 97 [2018-02-04 03:06:14,868 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 03:06:14,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 03:06:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 03:06:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 03:06:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 03:06:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-02-04 03:06:14,870 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-02-04 03:06:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:14,870 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-02-04 03:06:14,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 03:06:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-02-04 03:06:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:06:14,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:14,870 INFO L351 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:14,870 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash 966143224, now seen corresponding path program 78 times [2018-02-04 03:06:14,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:14,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:16,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:16,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-02-04 03:06:16,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:16,544 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-04 03:06:16,544 INFO L182 omatonBuilderFactory]: Interpolants [12416#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12417#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12418#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12419#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12420#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12421#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12424#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12426#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12427#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12429#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12430#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12431#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12432#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12433#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12435#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12436#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12437#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12438#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12439#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12440#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12441#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12442#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12443#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12444#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12445#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12446#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12447#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12448#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12449#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12450#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12451#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12452#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12453#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12454#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12455#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12456#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12457#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12458#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12459#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12460#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12461#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12462#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12464#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12465#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12466#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12467#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12468#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 78)), 12472#(not (= |#Ultimate.C_memset_#amount| 80)), 12391#true, 12392#false, 12393#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12394#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12395#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 12396#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12397#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12398#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12399#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12400#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12401#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12402#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12403#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12404#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12405#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12406#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12407#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12408#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12409#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12410#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12411#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12412#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12413#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12414#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12415#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22))] [2018-02-04 03:06:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:16,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 03:06:16,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 03:06:16,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 03:06:16,545 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 82 states. [2018-02-04 03:06:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:16,647 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-04 03:06:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-02-04 03:06:16,647 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 94 [2018-02-04 03:06:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:16,648 INFO L225 Difference]: With dead ends: 98 [2018-02-04 03:06:16,648 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:06:16,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 03:06:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:06:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 03:06:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:06:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-02-04 03:06:16,649 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-02-04 03:06:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:16,649 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-02-04 03:06:16,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 03:06:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-02-04 03:06:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 03:06:16,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:16,650 INFO L351 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:16,650 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -698608483, now seen corresponding path program 79 times [2018-02-04 03:06:16,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:16,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:18,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:06:18,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-02-04 03:06:18,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:18,400 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-04 03:06:18,400 INFO L182 omatonBuilderFactory]: Interpolants [12672#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12673#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12674#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12675#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12676#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12677#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12680#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12682#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12684#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12685#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12687#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12688#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12690#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12691#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12692#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12694#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12695#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12696#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12697#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12699#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12700#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12702#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12703#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12704#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12705#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12706#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12707#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12708#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12709#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12710#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12711#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12712#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12713#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12714#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12715#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12716#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12717#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12718#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12719#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12720#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12722#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12723#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12724#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12725#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12727#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12728#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12729#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12730#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12731#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12734#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12735#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12738#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12739#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12742#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12743#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12744#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12747#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 78)), 12748#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 79)), 12749#(not (= |#Ultimate.C_memset_#amount| 80)), 12667#true, 12668#false, 12669#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12671#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80)))] [2018-02-04 03:06:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:06:18,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 03:06:18,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 03:06:18,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 03:06:18,401 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 83 states. [2018-02-04 03:06:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:18,531 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-02-04 03:06:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 03:06:18,531 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 95 [2018-02-04 03:06:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:18,531 INFO L225 Difference]: With dead ends: 99 [2018-02-04 03:06:18,532 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 03:06:18,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 03:06:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 03:06:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 03:06:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 03:06:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-02-04 03:06:18,533 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-02-04 03:06:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:18,533 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-02-04 03:06:18,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 03:06:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-02-04 03:06:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 03:06:18,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:06:18,533 INFO L351 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:06:18,533 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 03:06:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash -766303848, now seen corresponding path program 80 times [2018-02-04 03:06:18,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:06:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:06:18,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:06:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-02-04 03:06:18,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:06:18,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:06:18,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:06:18,606 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-04 03:06:18,607 INFO L182 omatonBuilderFactory]: Interpolants [12946#true, 12947#false, 12948#(= |#valid| |old(#valid)|), 12949#(= (store |#valid| |main_~#cstats~0.base| 0) |old(#valid)|)] [2018-02-04 03:06:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-02-04 03:06:18,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:06:18,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:06:18,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:06:18,607 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 4 states. [2018-02-04 03:06:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:06:18,632 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-02-04 03:06:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:06:18,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-02-04 03:06:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:06:18,633 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:06:18,633 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:06:18,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:06:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:06:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:06:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:06:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:06:18,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2018-02-04 03:06:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:06:18,633 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:06:18,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:06:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:06:18,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:06:18,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:06:18 BoogieIcfgContainer [2018-02-04 03:06:18,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:06:18,638 INFO L168 Benchmark]: Toolchain (without parser) took 57677.21 ms. Allocated memory was 403.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 361.8 MB in the beginning and 453.0 MB in the end (delta: -91.1 MB). Peak memory consumption was 920.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:18,639 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:06:18,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.77 ms. Allocated memory is still 403.7 MB. Free memory was 361.8 MB in the beginning and 353.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:18,639 INFO L168 Benchmark]: Boogie Preprocessor took 19.32 ms. Allocated memory is still 403.7 MB. Free memory was 353.8 MB in the beginning and 352.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:18,639 INFO L168 Benchmark]: RCFGBuilder took 130.34 ms. Allocated memory is still 403.7 MB. Free memory was 352.5 MB in the beginning and 339.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:18,640 INFO L168 Benchmark]: TraceAbstraction took 57393.33 ms. Allocated memory was 403.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 338.5 MB in the beginning and 453.0 MB in the end (delta: -114.4 MB). Peak memory consumption was 896.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:06:18,641 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.10 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 131.77 ms. Allocated memory is still 403.7 MB. Free memory was 361.8 MB in the beginning and 353.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.32 ms. Allocated memory is still 403.7 MB. Free memory was 353.8 MB in the beginning and 352.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 130.34 ms. Allocated memory is still 403.7 MB. Free memory was 352.5 MB in the beginning and 339.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57393.33 ms. Allocated memory was 403.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 338.5 MB in the beginning and 453.0 MB in the end (delta: -114.4 MB). Peak memory consumption was 896.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 3 error locations. SAFE Result, 57.3s OverallTime, 83 OverallIterations, 80 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 132 SDslu, 27667 SDs, 0 SdLazy, 10338 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3490 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6241 ImplicationChecksByTransitivity, 47.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3240/88560 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, 83 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 51.0s InterpolantComputationTime, 4550 NumberOfCodeBlocks, 4550 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 4467 ConstructedInterpolants, 0 QuantifiedInterpolants, 1830484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 83 InterpolantComputations, 4 PerfectInterpolantSequences, 3240/88560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-06-18-647.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-06-18-647.csv Received shutdown request...