java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memset3_true-valid-memsafety_true-termination.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:44:24,461 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:44:24,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:44:24,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:44:24,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:44:24,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:44:24,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:44:24,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:44:24,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:44:24,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:44:24,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:44:24,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:44:24,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:44:24,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:44:24,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:44:24,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:44:24,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:44:24,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:44:24,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:44:24,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:44:24,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:44:24,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:44:24,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:44:24,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:44:24,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:44:24,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:44:24,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:44:24,493 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:44:24,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:44:24,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:44:24,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:44:24,494 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf
[2018-02-02 10:44:24,504 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:44:24,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:44:24,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:44:24,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:44:24,505 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:44:24,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:44:24,506 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:44:24,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:44:24,507 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:44:24,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:44:24,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:44:24,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:44:24,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:44:24,508 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol
[2018-02-02 10:44:24,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:44:24,548 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:44:24,552 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:44:24,553 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:44:24,554 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:44:24,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memset3_true-valid-memsafety_true-termination.c
[2018-02-02 10:44:24,638 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:44:24,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:44:24,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:44:24,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:44:24,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:44:24,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7866dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24, skipping insertion in model container
[2018-02-02 10:44:24,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,663 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:44:24,672 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:44:24,752 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:44:24,762 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:44:24,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24 WrapperNode
[2018-02-02 10:44:24,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:44:24,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:44:24,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:44:24,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:44:24,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
[2018-02-02 10:44:24,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:44:24,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:44:24,791 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:44:24,791 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:44:24,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:44:24,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:44:24,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:44:24,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:44:24,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:44:24,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset
[2018-02-02 10:44:24,831 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure memset
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:44:24,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:44:24,894 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2018-02-02 10:44:24,931 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:44:24,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:44:24 BoogieIcfgContainer
[2018-02-02 10:44:24,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:44:24,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:44:24,932 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:44:24,933 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:44:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:44:24" (1/3) ...
[2018-02-02 10:44:24,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f6fe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:44:24, skipping insertion in model container
[2018-02-02 10:44:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:44:24" (2/3) ...
[2018-02-02 10:44:24,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f6fe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:44:24, skipping insertion in model container
[2018-02-02 10:44:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:44:24" (3/3) ...
[2018-02-02 10:44:24,936 INFO L107 eAbstractionObserver]: Analyzing ICFG memset3_true-valid-memsafety_true-termination.c
[2018-02-02 10:44:24,941 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:44:24,946 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations.
[2018-02-02 10:44:24,973 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:44:24,974 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:44:24,974 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:44:24,974 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:44:24,974 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:44:24,974 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:44:24,974 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:44:24,974 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:44:24,975 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:44:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states.
[2018-02-02 10:44:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 10:44:24,995 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:24,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:24,996 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1417793591, now seen corresponding path program 1 times
[2018-02-02 10:44:25,051 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:44:25,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:44:25,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,177 INFO L182 omatonBuilderFactory]: Interpolants [26#true, 27#false, 28#(= 1 (select |#valid| |main_~#cstats~0.base|)), 29#(= 1 (select |#valid| main_~point~0.base))]
[2018-02-02 10:44:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:44:25,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:44:25,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:44:25,196 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states.
[2018-02-02 10:44:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,250 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions.
[2018-02-02 10:44:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:44:25,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 10:44:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,257 INFO L225 Difference]: With dead ends: 22
[2018-02-02 10:44:25,257 INFO L226 Difference]: Without dead ends: 19
[2018-02-02 10:44:25,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 10:44:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2018-02-02 10:44:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2018-02-02 10:44:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2018-02-02 10:44:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions.
[2018-02-02 10:44:25,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 8
[2018-02-02 10:44:25,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,277 INFO L432 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions.
[2018-02-02 10:44:25,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:44:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions.
[2018-02-02 10:44:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 10:44:25,278 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,278 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1417793592, now seen corresponding path program 1 times
[2018-02-02 10:44:25,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:44:25,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:44:25,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,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-02 10:44:25,390 INFO L182 omatonBuilderFactory]: Interpolants [73#true, 74#false, 75#(and (= 80 (select |#length| |main_~#cstats~0.base|)) (= 0 |main_~#cstats~0.offset|)), 76#(and (= main_~point~0.offset 0) (= (select |#length| main_~point~0.base) 80))]
[2018-02-02 10:44:25,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-02 10:44:25,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:44:25,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:44:25,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:44:25,392 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states.
[2018-02-02 10:44:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,410 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions.
[2018-02-02 10:44:25,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:44:25,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 10:44:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,411 INFO L225 Difference]: With dead ends: 18
[2018-02-02 10:44:25,411 INFO L226 Difference]: Without dead ends: 18
[2018-02-02 10:44:25,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 10:44:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2018-02-02 10:44:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2018-02-02 10:44:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2018-02-02 10:44:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions.
[2018-02-02 10:44:25,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8
[2018-02-02 10:44:25,413 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,413 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions.
[2018-02-02 10:44:25,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:44:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions.
[2018-02-02 10:44:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:44:25,414 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,414 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,414 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,414 INFO L82 PathProgramCache]: Analyzing trace with hash 577627260, now seen corresponding path program 1 times
[2018-02-02 10:44:25,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:44:25,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:44:25,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,472 INFO L182 omatonBuilderFactory]: Interpolants [115#true, 116#false, 117#(= |#Ultimate.C_memset_#t~loopctr5| 0), 118#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:44:25,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:44:25,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:44:25,473 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 4 states.
[2018-02-02 10:44:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,492 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions.
[2018-02-02 10:44:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:44:25,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2018-02-02 10:44:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,493 INFO L225 Difference]: With dead ends: 21
[2018-02-02 10:44:25,493 INFO L226 Difference]: Without dead ends: 19
[2018-02-02 10:44:25,493 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-02 10:44:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2018-02-02 10:44:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2018-02-02 10:44:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2018-02-02 10:44:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions.
[2018-02-02 10:44:25,496 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17
[2018-02-02 10:44:25,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,496 INFO L432 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions.
[2018-02-02 10:44:25,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:44:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions.
[2018-02-02 10:44:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:44:25,497 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,497 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,497 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 113669371, now seen corresponding path program 1 times
[2018-02-02 10:44:25,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,543 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-02 10:44:25,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:25,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:44:25,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,544 INFO L182 omatonBuilderFactory]: Interpolants [161#true, 162#false, 163#(= |#Ultimate.C_memset_#t~loopctr5| 0), 164#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 165#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:25,544 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-02 10:44:25,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:44:25,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:44:25,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:44:25,544 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states.
[2018-02-02 10:44:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,554 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions.
[2018-02-02 10:44:25,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:44:25,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 10:44:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,555 INFO L225 Difference]: With dead ends: 22
[2018-02-02 10:44:25,555 INFO L226 Difference]: Without dead ends: 20
[2018-02-02 10:44:25,555 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-02 10:44:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2018-02-02 10:44:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2018-02-02 10:44:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2018-02-02 10:44:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions.
[2018-02-02 10:44:25,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18
[2018-02-02 10:44:25,557 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,557 INFO L432 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions.
[2018-02-02 10:44:25,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:44:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions.
[2018-02-02 10:44:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 10:44:25,557 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,557 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,558 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1384123300, now seen corresponding path program 2 times
[2018-02-02 10:44:25,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:25,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:44:25,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,612 INFO L182 omatonBuilderFactory]: Interpolants [208#true, 209#false, 210#(= |#Ultimate.C_memset_#t~loopctr5| 0), 211#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 212#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 213#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:44:25,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:44:25,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:44:25,613 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states.
[2018-02-02 10:44:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,632 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions.
[2018-02-02 10:44:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:44:25,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-02 10:44:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,634 INFO L225 Difference]: With dead ends: 23
[2018-02-02 10:44:25,634 INFO L226 Difference]: Without dead ends: 21
[2018-02-02 10:44:25,634 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-02 10:44:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2018-02-02 10:44:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2018-02-02 10:44:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2018-02-02 10:44:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions.
[2018-02-02 10:44:25,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19
[2018-02-02 10:44:25,637 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,637 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions.
[2018-02-02 10:44:25,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:44:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions.
[2018-02-02 10:44:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:44:25,638 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,638 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,638 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -571055845, now seen corresponding path program 3 times
[2018-02-02 10:44:25,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,706 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-02 10:44:25,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:25,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:44:25,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,707 INFO L182 omatonBuilderFactory]: Interpolants [258#true, 259#false, 260#(= |#Ultimate.C_memset_#t~loopctr5| 0), 261#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 262#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 263#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 264#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:25,707 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-02 10:44:25,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:44:25,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:44:25,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:44:25,708 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states.
[2018-02-02 10:44:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,730 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions.
[2018-02-02 10:44:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:44:25,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2018-02-02 10:44:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,732 INFO L225 Difference]: With dead ends: 24
[2018-02-02 10:44:25,733 INFO L226 Difference]: Without dead ends: 22
[2018-02-02 10:44:25,733 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-02 10:44:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-02-02 10:44:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2018-02-02 10:44:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2018-02-02 10:44:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions.
[2018-02-02 10:44:25,735 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20
[2018-02-02 10:44:25,735 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,736 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions.
[2018-02-02 10:44:25,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:44:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions.
[2018-02-02 10:44:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 10:44:25,736 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,736 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,736 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1135768516, now seen corresponding path program 4 times
[2018-02-02 10:44:25,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,806 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-02 10:44:25,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:25,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:44:25,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,807 INFO L182 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(= |#Ultimate.C_memset_#t~loopctr5| 0), 314#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 316#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 318#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:25,807 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-02 10:44:25,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:44:25,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:44:25,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:44:25,808 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states.
[2018-02-02 10:44:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,849 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions.
[2018-02-02 10:44:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:44:25,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21
[2018-02-02 10:44:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,850 INFO L225 Difference]: With dead ends: 25
[2018-02-02 10:44:25,850 INFO L226 Difference]: Without dead ends: 23
[2018-02-02 10:44:25,850 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-02 10:44:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2018-02-02 10:44:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2018-02-02 10:44:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2018-02-02 10:44:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions.
[2018-02-02 10:44:25,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21
[2018-02-02 10:44:25,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,853 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions.
[2018-02-02 10:44:25,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:44:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions.
[2018-02-02 10:44:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 10:44:25,854 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,854 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,854 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1461992133, now seen corresponding path program 5 times
[2018-02-02 10:44:25,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:25,923 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-02 10:44:25,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:25,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:44:25,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:25,924 INFO L182 omatonBuilderFactory]: Interpolants [368#false, 369#(= |#Ultimate.C_memset_#t~loopctr5| 0), 370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 371#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 372#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 373#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 374#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 375#(not (= |#Ultimate.C_memset_#amount| 80)), 367#true]
[2018-02-02 10:44:25,924 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-02 10:44:25,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:44:25,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:44:25,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:44:25,924 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states.
[2018-02-02 10:44:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:25,948 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions.
[2018-02-02 10:44:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:44:25,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2018-02-02 10:44:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:25,949 INFO L225 Difference]: With dead ends: 26
[2018-02-02 10:44:25,949 INFO L226 Difference]: Without dead ends: 24
[2018-02-02 10:44:25,949 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-02 10:44:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2018-02-02 10:44:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2018-02-02 10:44:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2018-02-02 10:44:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions.
[2018-02-02 10:44:25,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22
[2018-02-02 10:44:25,952 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:25,952 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions.
[2018-02-02 10:44:25,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:44:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions.
[2018-02-02 10:44:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 10:44:25,952 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:25,953 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:25,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1309977628, now seen corresponding path program 6 times
[2018-02-02 10:44:25,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:25,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:44:26,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,041 INFO L182 omatonBuilderFactory]: Interpolants [432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 433#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 434#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 435#(not (= |#Ultimate.C_memset_#amount| 80)), 426#true, 427#false, 428#(= |#Ultimate.C_memset_#t~loopctr5| 0), 429#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 430#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 431#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:44:26,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:44:26,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:44:26,042 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 10 states.
[2018-02-02 10:44:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,061 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions.
[2018-02-02 10:44:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:44:26,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2018-02-02 10:44:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,062 INFO L225 Difference]: With dead ends: 27
[2018-02-02 10:44:26,062 INFO L226 Difference]: Without dead ends: 25
[2018-02-02 10:44:26,063 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-02 10:44:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2018-02-02 10:44:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2018-02-02 10:44:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2018-02-02 10:44:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions.
[2018-02-02 10:44:26,065 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23
[2018-02-02 10:44:26,066 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,066 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions.
[2018-02-02 10:44:26,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:44:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions.
[2018-02-02 10:44:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-02 10:44:26,067 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,067 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,067 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1341694299, now seen corresponding path program 7 times
[2018-02-02 10:44:26,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,155 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-02 10:44:26,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-02 10:44:26,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,155 INFO L182 omatonBuilderFactory]: Interpolants [496#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 498#(not (= |#Ultimate.C_memset_#amount| 80)), 488#true, 489#false, 490#(= |#Ultimate.C_memset_#t~loopctr5| 0), 491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 492#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 493#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 494#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5))]
[2018-02-02 10:44:26,156 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-02 10:44:26,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:44:26,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:44:26,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:44:26,156 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states.
[2018-02-02 10:44:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,171 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions.
[2018-02-02 10:44:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:44:26,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24
[2018-02-02 10:44:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,176 INFO L225 Difference]: With dead ends: 28
[2018-02-02 10:44:26,176 INFO L226 Difference]: Without dead ends: 26
[2018-02-02 10:44:26,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:44:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2018-02-02 10:44:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2018-02-02 10:44:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2018-02-02 10:44:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions.
[2018-02-02 10:44:26,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24
[2018-02-02 10:44:26,179 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,179 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions.
[2018-02-02 10:44:26,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:44:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions.
[2018-02-02 10:44:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 10:44:26,180 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,180 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,180 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1970056196, now seen corresponding path program 8 times
[2018-02-02 10:44:26,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,301 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-02 10:44:26,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:44:26,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,308 INFO L182 omatonBuilderFactory]: Interpolants [560#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 562#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 563#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 564#(not (= |#Ultimate.C_memset_#amount| 80)), 553#true, 554#false, 555#(= |#Ultimate.C_memset_#t~loopctr5| 0), 556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 557#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 558#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 559#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:26,308 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-02 10:44:26,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:44:26,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:44:26,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:44:26,309 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 12 states.
[2018-02-02 10:44:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,347 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions.
[2018-02-02 10:44:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 10:44:26,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25
[2018-02-02 10:44:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,348 INFO L225 Difference]: With dead ends: 29
[2018-02-02 10:44:26,348 INFO L226 Difference]: Without dead ends: 27
[2018-02-02 10:44:26,348 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-02 10:44:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2018-02-02 10:44:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2018-02-02 10:44:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2018-02-02 10:44:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions.
[2018-02-02 10:44:26,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25
[2018-02-02 10:44:26,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,351 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions.
[2018-02-02 10:44:26,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:44:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions.
[2018-02-02 10:44:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 10:44:26,352 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,352 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,352 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1555106437, now seen corresponding path program 9 times
[2018-02-02 10:44:26,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,472 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-02 10:44:26,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:44:26,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,473 INFO L182 omatonBuilderFactory]: Interpolants [621#true, 622#false, 623#(= |#Ultimate.C_memset_#t~loopctr5| 0), 624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 625#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 626#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 627#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 628#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 633#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:26,473 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-02 10:44:26,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:44:26,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:44:26,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:44:26,473 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states.
[2018-02-02 10:44:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,499 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions.
[2018-02-02 10:44:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 10:44:26,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26
[2018-02-02 10:44:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,507 INFO L225 Difference]: With dead ends: 30
[2018-02-02 10:44:26,507 INFO L226 Difference]: Without dead ends: 28
[2018-02-02 10:44:26,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:44:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2018-02-02 10:44:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2018-02-02 10:44:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2018-02-02 10:44:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions.
[2018-02-02 10:44:26,510 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26
[2018-02-02 10:44:26,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,510 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions.
[2018-02-02 10:44:26,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:44:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions.
[2018-02-02 10:44:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-02 10:44:26,511 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,511 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,511 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1576565796, now seen corresponding path program 10 times
[2018-02-02 10:44:26,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,668 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-02 10:44:26,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:44:26,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,669 INFO L182 omatonBuilderFactory]: Interpolants [704#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 705#(not (= |#Ultimate.C_memset_#amount| 80)), 692#true, 693#false, 694#(= |#Ultimate.C_memset_#t~loopctr5| 0), 695#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 696#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 699#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 700#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 702#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 703#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:26,669 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-02 10:44:26,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:44:26,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:44:26,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:44:26,670 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 14 states.
[2018-02-02 10:44:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,697 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions.
[2018-02-02 10:44:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:44:26,698 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27
[2018-02-02 10:44:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,698 INFO L225 Difference]: With dead ends: 31
[2018-02-02 10:44:26,698 INFO L226 Difference]: Without dead ends: 29
[2018-02-02 10:44:26,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:44:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2018-02-02 10:44:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2018-02-02 10:44:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2018-02-02 10:44:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions.
[2018-02-02 10:44:26,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27
[2018-02-02 10:44:26,701 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,701 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions.
[2018-02-02 10:44:26,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:44:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions.
[2018-02-02 10:44:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 10:44:26,702 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,702 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,702 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2053161371, now seen corresponding path program 11 times
[2018-02-02 10:44:26,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,816 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-02 10:44:26,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:44:26,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,817 INFO L182 omatonBuilderFactory]: Interpolants [768#(= |#Ultimate.C_memset_#t~loopctr5| 0), 769#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 770#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 771#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 772#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 773#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 774#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 775#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 776#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 777#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 778#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 779#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 780#(not (= |#Ultimate.C_memset_#amount| 80)), 766#true, 767#false]
[2018-02-02 10:44:26,817 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-02 10:44:26,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:44:26,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:44:26,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:44:26,817 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states.
[2018-02-02 10:44:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,840 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions.
[2018-02-02 10:44:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:44:26,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28
[2018-02-02 10:44:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,841 INFO L225 Difference]: With dead ends: 32
[2018-02-02 10:44:26,841 INFO L226 Difference]: Without dead ends: 30
[2018-02-02 10:44:26,841 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-02 10:44:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-02-02 10:44:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-02-02 10:44:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-02-02 10:44:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions.
[2018-02-02 10:44:26,843 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28
[2018-02-02 10:44:26,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,843 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions.
[2018-02-02 10:44:26,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:44:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions.
[2018-02-02 10:44:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 10:44:26,843 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,843 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,843 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1389413444, now seen corresponding path program 12 times
[2018-02-02 10:44:26,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:26,945 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-02 10:44:26,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:26,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:44:26,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:26,947 INFO L182 omatonBuilderFactory]: Interpolants [843#true, 844#false, 845#(= |#Ultimate.C_memset_#t~loopctr5| 0), 846#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 849#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 853#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 854#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 858#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:26,947 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-02 10:44:26,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:44:26,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:44:26,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:44:26,948 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states.
[2018-02-02 10:44:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:26,973 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions.
[2018-02-02 10:44:26,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:44:26,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29
[2018-02-02 10:44:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:26,974 INFO L225 Difference]: With dead ends: 33
[2018-02-02 10:44:26,974 INFO L226 Difference]: Without dead ends: 31
[2018-02-02 10:44:26,974 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-02 10:44:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2018-02-02 10:44:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2018-02-02 10:44:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:44:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions.
[2018-02-02 10:44:26,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29
[2018-02-02 10:44:26,977 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:26,977 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions.
[2018-02-02 10:44:26,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:44:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions.
[2018-02-02 10:44:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-02 10:44:26,978 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:26,978 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:26,978 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash -735050309, now seen corresponding path program 13 times
[2018-02-02 10:44:26,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:26,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:27,164 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-02 10:44:27,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:27,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:44:27,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:27,165 INFO L182 omatonBuilderFactory]: Interpolants [928#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 929#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 930#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 931#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 932#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 933#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 934#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 935#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 936#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 937#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 938#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 939#(not (= |#Ultimate.C_memset_#amount| 80)), 923#true, 924#false, 925#(= |#Ultimate.C_memset_#t~loopctr5| 0), 926#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 927#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:27,166 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-02 10:44:27,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:44:27,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:44:27,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:44:27,166 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states.
[2018-02-02 10:44:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:27,197 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions.
[2018-02-02 10:44:27,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:44:27,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30
[2018-02-02 10:44:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:27,198 INFO L225 Difference]: With dead ends: 34
[2018-02-02 10:44:27,198 INFO L226 Difference]: Without dead ends: 32
[2018-02-02 10:44:27,198 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-02 10:44:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2018-02-02 10:44:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2018-02-02 10:44:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-02 10:44:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions.
[2018-02-02 10:44:27,200 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30
[2018-02-02 10:44:27,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:27,201 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions.
[2018-02-02 10:44:27,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:44:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions.
[2018-02-02 10:44:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-02 10:44:27,201 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:27,201 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:27,202 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1924629604, now seen corresponding path program 14 times
[2018-02-02 10:44:27,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:27,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:27,354 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-02 10:44:27,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:27,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:44:27,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:27,355 INFO L182 omatonBuilderFactory]: Interpolants [1006#true, 1007#false, 1008#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1009#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1010#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1011#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1014#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1017#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1018#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1019#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1023#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:27,355 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-02 10:44:27,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:44:27,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:44:27,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:44:27,356 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states.
[2018-02-02 10:44:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:27,383 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions.
[2018-02-02 10:44:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:44:27,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31
[2018-02-02 10:44:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:27,384 INFO L225 Difference]: With dead ends: 35
[2018-02-02 10:44:27,384 INFO L226 Difference]: Without dead ends: 33
[2018-02-02 10:44:27,384 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-02 10:44:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2018-02-02 10:44:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2018-02-02 10:44:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2018-02-02 10:44:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions.
[2018-02-02 10:44:27,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31
[2018-02-02 10:44:27,391 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:27,391 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions.
[2018-02-02 10:44:27,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:44:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions.
[2018-02-02 10:44:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 10:44:27,392 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:27,392 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:27,392 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash -146882085, now seen corresponding path program 15 times
[2018-02-02 10:44:27,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:27,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:27,561 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-02 10:44:27,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:27,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:44:27,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:27,561 INFO L182 omatonBuilderFactory]: Interpolants [1092#true, 1093#false, 1094#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1097#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1099#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1100#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1103#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1104#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1105#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1106#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1107#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1109#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1110#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:27,562 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-02 10:44:27,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:44:27,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:44:27,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:44:27,562 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states.
[2018-02-02 10:44:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:27,601 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions.
[2018-02-02 10:44:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:44:27,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32
[2018-02-02 10:44:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:27,603 INFO L225 Difference]: With dead ends: 36
[2018-02-02 10:44:27,603 INFO L226 Difference]: Without dead ends: 34
[2018-02-02 10:44:27,603 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-02 10:44:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-02-02 10:44:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2018-02-02 10:44:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-02 10:44:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions.
[2018-02-02 10:44:27,605 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32
[2018-02-02 10:44:27,605 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:27,606 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions.
[2018-02-02 10:44:27,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:44:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions.
[2018-02-02 10:44:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 10:44:27,606 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:27,606 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:27,609 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash -871283844, now seen corresponding path program 16 times
[2018-02-02 10:44:27,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:27,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:27,799 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-02 10:44:27,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:27,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:44:27,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:27,800 INFO L182 omatonBuilderFactory]: Interpolants [1184#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1185#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1186#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1187#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1188#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1189#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1190#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1191#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1192#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1193#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1195#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1197#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1198#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1199#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1200#(not (= |#Ultimate.C_memset_#amount| 80)), 1181#true, 1182#false, 1183#(= |#Ultimate.C_memset_#t~loopctr5| 0)]
[2018-02-02 10:44:27,800 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-02 10:44:27,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:44:27,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:44:27,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:44:27,801 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states.
[2018-02-02 10:44:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:27,840 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions.
[2018-02-02 10:44:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:44:27,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33
[2018-02-02 10:44:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:27,841 INFO L225 Difference]: With dead ends: 37
[2018-02-02 10:44:27,841 INFO L226 Difference]: Without dead ends: 35
[2018-02-02 10:44:27,842 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-02 10:44:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2018-02-02 10:44:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2018-02-02 10:44:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2018-02-02 10:44:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions.
[2018-02-02 10:44:27,844 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33
[2018-02-02 10:44:27,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:27,844 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions.
[2018-02-02 10:44:27,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:44:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions.
[2018-02-02 10:44:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-02 10:44:27,845 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:27,845 INFO L351 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:27,845 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1852901893, now seen corresponding path program 17 times
[2018-02-02 10:44:27,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:27,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:28,021 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-02 10:44:28,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:28,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:44:28,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:28,022 INFO L182 omatonBuilderFactory]: Interpolants [1280#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1281#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1282#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1283#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1284#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1285#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1286#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1287#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1288#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1289#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1290#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1291#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1292#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1293#(not (= |#Ultimate.C_memset_#amount| 80)), 1273#true, 1274#false, 1275#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1276#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1277#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1278#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1279#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:28,022 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-02 10:44:28,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 10:44:28,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 10:44:28,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:44:28,023 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 21 states.
[2018-02-02 10:44:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:28,052 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions.
[2018-02-02 10:44:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:44:28,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34
[2018-02-02 10:44:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:28,053 INFO L225 Difference]: With dead ends: 38
[2018-02-02 10:44:28,053 INFO L226 Difference]: Without dead ends: 36
[2018-02-02 10:44:28,053 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-02 10:44:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2018-02-02 10:44:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2018-02-02 10:44:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-02-02 10:44:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions.
[2018-02-02 10:44:28,057 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34
[2018-02-02 10:44:28,057 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:28,057 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions.
[2018-02-02 10:44:28,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 10:44:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions.
[2018-02-02 10:44:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-02 10:44:28,058 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:28,058 INFO L351 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:28,058 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2076676956, now seen corresponding path program 18 times
[2018-02-02 10:44:28,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:28,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:28,274 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-02 10:44:28,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:28,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:44:28,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:28,275 INFO L182 omatonBuilderFactory]: Interpolants [1376#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1377#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1378#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1379#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1380#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1381#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1382#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1383#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1384#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1385#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1386#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1387#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1388#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1389#(not (= |#Ultimate.C_memset_#amount| 80)), 1368#true, 1369#false, 1370#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1372#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1373#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1374#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1375#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5))]
[2018-02-02 10:44:28,275 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-02 10:44:28,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:44:28,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:44:28,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:44:28,276 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 22 states.
[2018-02-02 10:44:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:28,305 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions.
[2018-02-02 10:44:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:44:28,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35
[2018-02-02 10:44:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:28,306 INFO L225 Difference]: With dead ends: 39
[2018-02-02 10:44:28,306 INFO L226 Difference]: Without dead ends: 37
[2018-02-02 10:44:28,307 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-02 10:44:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2018-02-02 10:44:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2018-02-02 10:44:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2018-02-02 10:44:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions.
[2018-02-02 10:44:28,309 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35
[2018-02-02 10:44:28,309 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:28,309 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions.
[2018-02-02 10:44:28,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:44:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions.
[2018-02-02 10:44:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-02-02 10:44:28,310 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:28,310 INFO L351 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:28,310 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -660430309, now seen corresponding path program 19 times
[2018-02-02 10:44:28,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:28,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:28,492 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-02 10:44:28,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:28,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:44:28,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:28,492 INFO L182 omatonBuilderFactory]: Interpolants [1472#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1473#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1474#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1475#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1477#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1478#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1479#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1480#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1481#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1482#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1483#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1484#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1485#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1486#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1487#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1488#(not (= |#Ultimate.C_memset_#amount| 80)), 1466#true, 1467#false, 1468#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1470#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1471#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:28,493 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-02 10:44:28,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:44:28,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:44:28,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:44:28,494 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 23 states.
[2018-02-02 10:44:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:28,523 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions.
[2018-02-02 10:44:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:44:28,524 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36
[2018-02-02 10:44:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:28,525 INFO L225 Difference]: With dead ends: 40
[2018-02-02 10:44:28,525 INFO L226 Difference]: Without dead ends: 38
[2018-02-02 10:44:28,525 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-02 10:44:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2018-02-02 10:44:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2018-02-02 10:44:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2018-02-02 10:44:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions.
[2018-02-02 10:44:28,527 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36
[2018-02-02 10:44:28,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:28,528 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions.
[2018-02-02 10:44:28,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:44:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions.
[2018-02-02 10:44:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-02 10:44:28,528 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:28,528 INFO L351 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:28,528 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 388590396, now seen corresponding path program 20 times
[2018-02-02 10:44:28,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:28,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:28,716 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-02 10:44:28,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:28,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:44:28,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:28,717 INFO L182 omatonBuilderFactory]: Interpolants [1568#false, 1569#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1570#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1571#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1572#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1573#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1574#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1575#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1576#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1578#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1579#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1580#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1581#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1582#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1583#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1584#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1585#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1586#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1587#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1588#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1589#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1590#(not (= |#Ultimate.C_memset_#amount| 80)), 1567#true]
[2018-02-02 10:44:28,717 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-02 10:44:28,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:44:28,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:44:28,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:44:28,718 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 24 states.
[2018-02-02 10:44:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:28,747 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions.
[2018-02-02 10:44:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 10:44:28,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37
[2018-02-02 10:44:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:28,748 INFO L225 Difference]: With dead ends: 41
[2018-02-02 10:44:28,748 INFO L226 Difference]: Without dead ends: 39
[2018-02-02 10:44:28,748 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-02 10:44:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2018-02-02 10:44:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2018-02-02 10:44:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2018-02-02 10:44:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions.
[2018-02-02 10:44:28,750 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37
[2018-02-02 10:44:28,750 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:28,750 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions.
[2018-02-02 10:44:28,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:44:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions.
[2018-02-02 10:44:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-02 10:44:28,750 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:28,750 INFO L351 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:28,750 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1451506117, now seen corresponding path program 21 times
[2018-02-02 10:44:28,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:28,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:29,006 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-02 10:44:29,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:29,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25
[2018-02-02 10:44:29,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:29,007 INFO L182 omatonBuilderFactory]: Interpolants [1671#true, 1672#false, 1673#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1674#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1676#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1677#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1678#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1680#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1682#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1684#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1685#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1687#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1688#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1690#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1691#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1692#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1694#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1695#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:29,007 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-02 10:44:29,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 10:44:29,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 10:44:29,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:44:29,008 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 25 states.
[2018-02-02 10:44:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:29,046 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions.
[2018-02-02 10:44:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:44:29,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38
[2018-02-02 10:44:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:29,047 INFO L225 Difference]: With dead ends: 42
[2018-02-02 10:44:29,047 INFO L226 Difference]: Without dead ends: 40
[2018-02-02 10:44:29,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:44:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2018-02-02 10:44:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2018-02-02 10:44:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2018-02-02 10:44:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions.
[2018-02-02 10:44:29,050 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38
[2018-02-02 10:44:29,051 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:29,051 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions.
[2018-02-02 10:44:29,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 10:44:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions.
[2018-02-02 10:44:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-02 10:44:29,052 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:29,052 INFO L351 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:29,052 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1635044124, now seen corresponding path program 22 times
[2018-02-02 10:44:29,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:29,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:29,252 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-02 10:44:29,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:29,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2018-02-02 10:44:29,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:29,253 INFO L182 omatonBuilderFactory]: Interpolants [1792#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1793#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1794#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1795#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1796#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1797#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1798#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1800#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1802#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 1803#(not (= |#Ultimate.C_memset_#amount| 80)), 1778#true, 1779#false, 1780#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1781#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1782#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1783#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1784#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1785#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1786#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1787#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1788#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1789#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1790#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1791#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11))]
[2018-02-02 10:44:29,253 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-02 10:44:29,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-02 10:44:29,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-02 10:44:29,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:44:29,253 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 26 states.
[2018-02-02 10:44:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:29,275 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions.
[2018-02-02 10:44:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-02 10:44:29,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39
[2018-02-02 10:44:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:29,276 INFO L225 Difference]: With dead ends: 43
[2018-02-02 10:44:29,276 INFO L226 Difference]: Without dead ends: 41
[2018-02-02 10:44:29,276 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-02 10:44:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-02-02 10:44:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2018-02-02 10:44:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-02-02 10:44:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions.
[2018-02-02 10:44:29,278 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39
[2018-02-02 10:44:29,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:29,278 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions.
[2018-02-02 10:44:29,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-02 10:44:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions.
[2018-02-02 10:44:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-02-02 10:44:29,278 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:29,278 INFO L351 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:29,278 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1466146213, now seen corresponding path program 23 times
[2018-02-02 10:44:29,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:29,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:29,514 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-02 10:44:29,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:29,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27
[2018-02-02 10:44:29,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:29,514 INFO L182 omatonBuilderFactory]: Interpolants [1888#true, 1889#false, 1890#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1891#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 1892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 1893#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 1894#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 1895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 1896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 1897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 1898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 1899#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 1900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 1901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 1902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 1903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 1904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 1905#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 1906#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 1907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 1908#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 1909#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 1910#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 1911#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 1912#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 1913#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 1914#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:29,514 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-02 10:44:29,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-02 10:44:29,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-02 10:44:29,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:44:29,515 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 27 states.
[2018-02-02 10:44:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:29,548 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions.
[2018-02-02 10:44:29,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:44:29,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40
[2018-02-02 10:44:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:29,549 INFO L225 Difference]: With dead ends: 44
[2018-02-02 10:44:29,549 INFO L226 Difference]: Without dead ends: 42
[2018-02-02 10:44:29,549 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-02 10:44:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2018-02-02 10:44:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2018-02-02 10:44:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2018-02-02 10:44:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions.
[2018-02-02 10:44:29,550 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40
[2018-02-02 10:44:29,550 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:29,550 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions.
[2018-02-02 10:44:29,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-02 10:44:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions.
[2018-02-02 10:44:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 10:44:29,550 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:29,551 INFO L351 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:29,551 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1181201148, now seen corresponding path program 24 times
[2018-02-02 10:44:29,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:29,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:29,815 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-02 10:44:29,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:29,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2018-02-02 10:44:29,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:29,816 INFO L182 omatonBuilderFactory]: Interpolants [2001#true, 2002#false, 2003#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2005#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2006#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2007#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2009#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2010#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2014#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2017#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2018#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2019#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2021#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2023#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2024#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2025#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2027#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2028#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:29,816 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-02 10:44:29,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-02-02 10:44:29,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-02-02 10:44:29,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:44:29,817 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 28 states.
[2018-02-02 10:44:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:29,875 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions.
[2018-02-02 10:44:29,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 10:44:29,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41
[2018-02-02 10:44:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:29,877 INFO L225 Difference]: With dead ends: 45
[2018-02-02 10:44:29,877 INFO L226 Difference]: Without dead ends: 43
[2018-02-02 10:44:29,877 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-02 10:44:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2018-02-02 10:44:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2018-02-02 10:44:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-02-02 10:44:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions.
[2018-02-02 10:44:29,879 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41
[2018-02-02 10:44:29,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:29,879 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions.
[2018-02-02 10:44:29,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-02-02 10:44:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions.
[2018-02-02 10:44:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 10:44:29,880 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:29,880 INFO L351 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:29,880 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1644590715, now seen corresponding path program 25 times
[2018-02-02 10:44:29,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:29,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:30,194 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-02 10:44:30,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:30,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29
[2018-02-02 10:44:30,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:30,195 INFO L182 omatonBuilderFactory]: Interpolants [2117#true, 2118#false, 2119#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2120#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2121#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2122#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2123#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2124#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2126#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2127#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2128#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2130#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2131#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2132#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2133#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2134#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2135#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2136#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2137#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2138#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2139#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2140#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2141#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2142#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2143#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2144#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2145#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:30,195 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-02 10:44:30,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 10:44:30,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 10:44:30,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:44:30,195 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 29 states.
[2018-02-02 10:44:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:30,248 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions.
[2018-02-02 10:44:30,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:44:30,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42
[2018-02-02 10:44:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:30,249 INFO L225 Difference]: With dead ends: 46
[2018-02-02 10:44:30,249 INFO L226 Difference]: Without dead ends: 44
[2018-02-02 10:44:30,249 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-02 10:44:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-02 10:44:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2018-02-02 10:44:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2018-02-02 10:44:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions.
[2018-02-02 10:44:30,251 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42
[2018-02-02 10:44:30,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:30,251 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions.
[2018-02-02 10:44:30,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 10:44:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions.
[2018-02-02 10:44:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 10:44:30,252 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:30,252 INFO L351 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:30,252 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1170201892, now seen corresponding path program 26 times
[2018-02-02 10:44:30,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:30,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:30,543 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-02 10:44:30,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:30,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30
[2018-02-02 10:44:30,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:30,543 INFO L182 omatonBuilderFactory]: Interpolants [2240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2241#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2242#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2243#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2244#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2246#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2247#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2248#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2249#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2250#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2253#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2254#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2256#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2257#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2258#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2260#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2261#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2262#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2263#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2264#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2265#(not (= |#Ultimate.C_memset_#amount| 80)), 2236#true, 2237#false, 2238#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2239#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1))]
[2018-02-02 10:44:30,544 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-02 10:44:30,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-02-02 10:44:30,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-02-02 10:44:30,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:44:30,544 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 30 states.
[2018-02-02 10:44:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:30,583 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions.
[2018-02-02 10:44:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:44:30,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43
[2018-02-02 10:44:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:30,584 INFO L225 Difference]: With dead ends: 47
[2018-02-02 10:44:30,584 INFO L226 Difference]: Without dead ends: 45
[2018-02-02 10:44:30,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:44:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2018-02-02 10:44:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2018-02-02 10:44:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2018-02-02 10:44:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions.
[2018-02-02 10:44:30,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43
[2018-02-02 10:44:30,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:30,585 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions.
[2018-02-02 10:44:30,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-02-02 10:44:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions.
[2018-02-02 10:44:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:44:30,586 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:30,586 INFO L351 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:30,586 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1765540507, now seen corresponding path program 27 times
[2018-02-02 10:44:30,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:30,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:30,851 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-02 10:44:30,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:30,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31
[2018-02-02 10:44:30,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:30,851 INFO L182 omatonBuilderFactory]: Interpolants [2368#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2369#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2370#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2371#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2372#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2373#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2374#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2375#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2376#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2377#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2378#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2379#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2380#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2381#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2382#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2383#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2384#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2385#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2386#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2387#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2388#(not (= |#Ultimate.C_memset_#amount| 80)), 2358#true, 2359#false, 2360#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2361#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2362#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2363#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2364#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2365#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2366#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2367#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7))]
[2018-02-02 10:44:30,852 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-02 10:44:30,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-02-02 10:44:30,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-02-02 10:44:30,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=466, Unknown=0, NotChecked=0, Total=930
[2018-02-02 10:44:30,852 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 31 states.
[2018-02-02 10:44:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:30,889 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions.
[2018-02-02 10:44:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:44:30,889 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44
[2018-02-02 10:44:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:30,890 INFO L225 Difference]: With dead ends: 48
[2018-02-02 10:44:30,890 INFO L226 Difference]: Without dead ends: 46
[2018-02-02 10:44:30,890 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-02 10:44:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-02 10:44:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46.
[2018-02-02 10:44:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2018-02-02 10:44:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions.
[2018-02-02 10:44:30,891 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44
[2018-02-02 10:44:30,891 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:30,891 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions.
[2018-02-02 10:44:30,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-02-02 10:44:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions.
[2018-02-02 10:44:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:44:30,892 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:30,892 INFO L351 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:30,892 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1715725636, now seen corresponding path program 28 times
[2018-02-02 10:44:30,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:30,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:31,173 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-02 10:44:31,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:31,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32
[2018-02-02 10:44:31,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:31,173 INFO L182 omatonBuilderFactory]: Interpolants [2496#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2498#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2499#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2500#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2501#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2502#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2503#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2505#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2506#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2507#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2508#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2509#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2510#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2512#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2514#(not (= |#Ultimate.C_memset_#amount| 80)), 2483#true, 2484#false, 2485#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2486#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2487#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2488#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2489#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2490#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2492#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2493#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2494#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10))]
[2018-02-02 10:44:31,173 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-02 10:44:31,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-02-02 10:44:31,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-02-02 10:44:31,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:44:31,174 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states.
[2018-02-02 10:44:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:31,208 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions.
[2018-02-02 10:44:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 10:44:31,208 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45
[2018-02-02 10:44:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:31,208 INFO L225 Difference]: With dead ends: 49
[2018-02-02 10:44:31,208 INFO L226 Difference]: Without dead ends: 47
[2018-02-02 10:44:31,209 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-02 10:44:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2018-02-02 10:44:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2018-02-02 10:44:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2018-02-02 10:44:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions.
[2018-02-02 10:44:31,210 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45
[2018-02-02 10:44:31,210 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:31,210 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions.
[2018-02-02 10:44:31,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-02-02 10:44:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions.
[2018-02-02 10:44:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-02-02 10:44:31,210 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:31,210 INFO L351 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:31,210 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2034173627, now seen corresponding path program 29 times
[2018-02-02 10:44:31,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:31,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:31,500 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-02 10:44:31,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:31,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33
[2018-02-02 10:44:31,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:31,501 INFO L182 omatonBuilderFactory]: Interpolants [2624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2629#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2631#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2632#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2637#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2638#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2639#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2640#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2642#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2643#(not (= |#Ultimate.C_memset_#amount| 80)), 2611#true, 2612#false, 2613#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2615#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2616#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2617#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2618#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2623#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10))]
[2018-02-02 10:44:31,501 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-02 10:44:31,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 10:44:31,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 10:44:31,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:44:31,502 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 33 states.
[2018-02-02 10:44:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:31,536 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions.
[2018-02-02 10:44:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 10:44:31,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46
[2018-02-02 10:44:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:31,537 INFO L225 Difference]: With dead ends: 50
[2018-02-02 10:44:31,537 INFO L226 Difference]: Without dead ends: 48
[2018-02-02 10:44:31,537 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-02 10:44:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-02-02 10:44:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-02-02 10:44:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-02-02 10:44:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions.
[2018-02-02 10:44:31,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46
[2018-02-02 10:44:31,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:31,539 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions.
[2018-02-02 10:44:31,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 10:44:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions.
[2018-02-02 10:44:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 10:44:31,539 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:31,539 INFO L351 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:31,539 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1978033508, now seen corresponding path program 30 times
[2018-02-02 10:44:31,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:31,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:31,835 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-02 10:44:31,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:31,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34
[2018-02-02 10:44:31,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:31,835 INFO L182 omatonBuilderFactory]: Interpolants [2752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2753#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2754#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2759#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2760#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2761#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2762#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2763#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2764#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2765#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2766#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2768#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2769#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2770#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2771#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2772#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2773#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2774#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 2775#(not (= |#Ultimate.C_memset_#amount| 80)), 2742#true, 2743#false, 2744#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 2746#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2747#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2748#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2749#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2750#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7))]
[2018-02-02 10:44:31,836 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-02 10:44:31,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-02-02 10:44:31,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-02-02 10:44:31,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:44:31,836 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 34 states.
[2018-02-02 10:44:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:31,879 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions.
[2018-02-02 10:44:31,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 10:44:31,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 47
[2018-02-02 10:44:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:31,880 INFO L225 Difference]: With dead ends: 51
[2018-02-02 10:44:31,880 INFO L226 Difference]: Without dead ends: 49
[2018-02-02 10:44:31,881 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-02 10:44:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-02-02 10:44:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2018-02-02 10:44:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-02-02 10:44:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions.
[2018-02-02 10:44:31,883 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47
[2018-02-02 10:44:31,883 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:31,883 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions.
[2018-02-02 10:44:31,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-02-02 10:44:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions.
[2018-02-02 10:44:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 10:44:31,884 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:31,884 INFO L351 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:31,884 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1802403109, now seen corresponding path program 31 times
[2018-02-02 10:44:31,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:31,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:32,356 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-02 10:44:32,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:32,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35
[2018-02-02 10:44:32,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:32,357 INFO L182 omatonBuilderFactory]: Interpolants [2880#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 2881#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 2882#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 2883#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 2884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 2885#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 2886#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 2887#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 2888#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 2889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 2890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 2891#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 2892#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 2893#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 2894#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 2895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 2896#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 2897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 2898#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 2899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 2900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 2901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 2902#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 2903#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 2904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 2905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 2906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 2907#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 2908#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 2909#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 2910#(not (= |#Ultimate.C_memset_#amount| 80)), 2876#true, 2877#false, 2878#(= |#Ultimate.C_memset_#t~loopctr5| 0), 2879#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1))]
[2018-02-02 10:44:32,357 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-02 10:44:32,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states
[2018-02-02 10:44:32,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2018-02-02 10:44:32,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:44:32,358 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 35 states.
[2018-02-02 10:44:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:32,413 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions.
[2018-02-02 10:44:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-02-02 10:44:32,413 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48
[2018-02-02 10:44:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:32,414 INFO L225 Difference]: With dead ends: 52
[2018-02-02 10:44:32,414 INFO L226 Difference]: Without dead ends: 50
[2018-02-02 10:44:32,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:44:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-02-02 10:44:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2018-02-02 10:44:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 10:44:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions.
[2018-02-02 10:44:32,415 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48
[2018-02-02 10:44:32,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:32,415 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions.
[2018-02-02 10:44:32,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states.
[2018-02-02 10:44:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions.
[2018-02-02 10:44:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2018-02-02 10:44:32,415 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:32,415 INFO L351 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:32,416 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash -652828036, now seen corresponding path program 32 times
[2018-02-02 10:44:32,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:32,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:32,763 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-02 10:44:32,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:32,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36
[2018-02-02 10:44:32,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:32,763 INFO L182 omatonBuilderFactory]: Interpolants [3013#true, 3014#false, 3015#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3017#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3018#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3019#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3023#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3024#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3025#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3027#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3028#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3029#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3030#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3031#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3032#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3033#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3034#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3035#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3036#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3037#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3038#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3039#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3040#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3041#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3042#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3043#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3044#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3045#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3046#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3047#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3048#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:32,764 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-02 10:44:32,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-02-02 10:44:32,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-02-02 10:44:32,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=631, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:44:32,764 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 36 states.
[2018-02-02 10:44:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:32,813 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions.
[2018-02-02 10:44:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-02-02 10:44:32,813 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 49
[2018-02-02 10:44:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:32,814 INFO L225 Difference]: With dead ends: 53
[2018-02-02 10:44:32,814 INFO L226 Difference]: Without dead ends: 51
[2018-02-02 10:44:32,814 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-02 10:44:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-02-02 10:44:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2018-02-02 10:44:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-02 10:44:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions.
[2018-02-02 10:44:32,815 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49
[2018-02-02 10:44:32,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:32,815 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions.
[2018-02-02 10:44:32,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2018-02-02 10:44:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions.
[2018-02-02 10:44:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-02-02 10:44:32,816 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:32,816 INFO L351 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:32,816 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:32,816 INFO L82 PathProgramCache]: Analyzing trace with hash 624260859, now seen corresponding path program 33 times
[2018-02-02 10:44:32,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:32,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:33,222 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-02 10:44:33,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:33,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37
[2018-02-02 10:44:33,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:33,223 INFO L182 omatonBuilderFactory]: Interpolants [3153#true, 3154#false, 3155#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3156#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3157#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3158#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3159#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3160#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3161#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3162#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3163#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3164#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3165#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3166#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3167#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3168#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3169#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3170#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3171#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3172#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3173#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3174#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3175#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3176#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3177#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3178#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3179#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3180#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3181#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3182#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3183#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3184#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3185#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3186#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3187#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3188#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3189#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:33,223 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-02 10:44:33,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-02 10:44:33,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-02 10:44:33,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:44:33,224 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 37 states.
[2018-02-02 10:44:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:33,285 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions.
[2018-02-02 10:44:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-02 10:44:33,286 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50
[2018-02-02 10:44:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:33,286 INFO L225 Difference]: With dead ends: 54
[2018-02-02 10:44:33,286 INFO L226 Difference]: Without dead ends: 52
[2018-02-02 10:44:33,286 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-02 10:44:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-02-02 10:44:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-02-02 10:44:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-02-02 10:44:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions.
[2018-02-02 10:44:33,287 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50
[2018-02-02 10:44:33,288 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:33,288 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions.
[2018-02-02 10:44:33,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-02 10:44:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions.
[2018-02-02 10:44:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-02-02 10:44:33,288 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:33,288 INFO L351 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:33,288 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1559310940, now seen corresponding path program 34 times
[2018-02-02 10:44:33,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:33,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:33,665 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-02 10:44:33,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:33,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38
[2018-02-02 10:44:33,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:33,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-02 10:44:33,665 INFO L182 omatonBuilderFactory]: Interpolants [3328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3329#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3331#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3333#(not (= |#Ultimate.C_memset_#amount| 80)), 3296#true, 3297#false, 3298#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3299#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3300#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3301#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3302#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3305#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3307#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3308#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3309#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3310#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3311#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3315#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3316#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3317#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3319#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3323#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:33,666 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-02 10:44:33,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-02 10:44:33,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-02 10:44:33,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406
[2018-02-02 10:44:33,666 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 38 states.
[2018-02-02 10:44:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:33,695 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions.
[2018-02-02 10:44:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2018-02-02 10:44:33,695 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51
[2018-02-02 10:44:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:33,696 INFO L225 Difference]: With dead ends: 55
[2018-02-02 10:44:33,696 INFO L226 Difference]: Without dead ends: 53
[2018-02-02 10:44:33,696 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-02 10:44:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2018-02-02 10:44:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2018-02-02 10:44:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-02-02 10:44:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions.
[2018-02-02 10:44:33,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51
[2018-02-02 10:44:33,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:33,697 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions.
[2018-02-02 10:44:33,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-02 10:44:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions.
[2018-02-02 10:44:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-02-02 10:44:33,698 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:33,698 INFO L351 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:33,698 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash 481092379, now seen corresponding path program 35 times
[2018-02-02 10:44:33,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:33,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:34,116 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-02 10:44:34,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:34,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39
[2018-02-02 10:44:34,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:34,117 INFO L182 omatonBuilderFactory]: Interpolants [3456#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3457#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3458#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3459#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3460#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3461#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3462#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3464#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3465#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3467#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3468#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3469#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3473#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3474#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3475#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3477#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3478#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3479#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3480#(not (= |#Ultimate.C_memset_#amount| 80)), 3442#true, 3443#false, 3444#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3445#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3447#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3448#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3449#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3450#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3451#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3452#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3453#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3454#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3455#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11))]
[2018-02-02 10:44:34,117 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-02 10:44:34,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-02-02 10:44:34,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-02-02 10:44:34,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 10:44:34,118 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 39 states.
[2018-02-02 10:44:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:34,154 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions.
[2018-02-02 10:44:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states.
[2018-02-02 10:44:34,154 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52
[2018-02-02 10:44:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:34,155 INFO L225 Difference]: With dead ends: 56
[2018-02-02 10:44:34,155 INFO L226 Difference]: Without dead ends: 54
[2018-02-02 10:44:34,155 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-02 10:44:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-02-02 10:44:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2018-02-02 10:44:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-02 10:44:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions.
[2018-02-02 10:44:34,156 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52
[2018-02-02 10:44:34,156 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:34,156 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions.
[2018-02-02 10:44:34,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-02-02 10:44:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions.
[2018-02-02 10:44:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:44:34,157 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:34,157 INFO L351 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:34,157 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1416055356, now seen corresponding path program 36 times
[2018-02-02 10:44:34,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:34,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:34,582 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-02 10:44:34,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:34,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40
[2018-02-02 10:44:34,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:34,582 INFO L182 omatonBuilderFactory]: Interpolants [3591#true, 3592#false, 3593#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3594#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3595#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3596#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3597#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3598#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3599#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3601#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3602#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3603#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3604#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3605#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3606#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3607#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3608#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3609#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3610#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3611#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3612#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3613#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3616#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3617#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3618#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3623#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3624#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3630#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:34,583 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-02 10:44:34,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-02-02 10:44:34,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-02-02 10:44:34,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:44:34,584 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 40 states.
[2018-02-02 10:44:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:34,629 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions.
[2018-02-02 10:44:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2018-02-02 10:44:34,629 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 53
[2018-02-02 10:44:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:34,630 INFO L225 Difference]: With dead ends: 57
[2018-02-02 10:44:34,630 INFO L226 Difference]: Without dead ends: 55
[2018-02-02 10:44:34,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:44:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2018-02-02 10:44:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2018-02-02 10:44:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-02 10:44:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions.
[2018-02-02 10:44:34,631 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53
[2018-02-02 10:44:34,631 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:34,632 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions.
[2018-02-02 10:44:34,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-02-02 10:44:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions.
[2018-02-02 10:44:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-02-02 10:44:34,632 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:34,632 INFO L351 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:34,632 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 335136571, now seen corresponding path program 37 times
[2018-02-02 10:44:34,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:34,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:35,083 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-02 10:44:35,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:35,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41
[2018-02-02 10:44:35,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:35,084 INFO L182 omatonBuilderFactory]: Interpolants [3776#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3777#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3778#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3779#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3780#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3781#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3782#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 3783#(not (= |#Ultimate.C_memset_#amount| 80)), 3743#true, 3744#false, 3745#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3747#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3748#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 3749#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3750#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3753#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3754#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3759#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3760#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3761#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3762#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3763#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3764#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3765#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3766#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3768#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3769#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3770#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3771#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3772#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3773#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3774#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3775#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:35,084 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-02 10:44:35,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-02-02 10:44:35,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-02-02 10:44:35,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640
[2018-02-02 10:44:35,085 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 41 states.
[2018-02-02 10:44:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:35,140 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions.
[2018-02-02 10:44:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-02-02 10:44:35,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54
[2018-02-02 10:44:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:35,141 INFO L225 Difference]: With dead ends: 58
[2018-02-02 10:44:35,141 INFO L226 Difference]: Without dead ends: 56
[2018-02-02 10:44:35,142 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-02 10:44:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-02-02 10:44:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2018-02-02 10:44:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-02-02 10:44:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions.
[2018-02-02 10:44:35,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54
[2018-02-02 10:44:35,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:35,143 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions.
[2018-02-02 10:44:35,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-02-02 10:44:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions.
[2018-02-02 10:44:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:44:35,143 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:35,143 INFO L351 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:35,143 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1186392604, now seen corresponding path program 38 times
[2018-02-02 10:44:35,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:35,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:35,624 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-02 10:44:35,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:35,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42
[2018-02-02 10:44:35,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:35,625 INFO L182 omatonBuilderFactory]: Interpolants [3904#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 3905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 3906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 3907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 3908#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 3909#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 3910#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 3911#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 3912#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 3913#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 3914#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 3915#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 3916#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 3917#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 3918#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 3919#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 3920#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 3921#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 3922#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 3923#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 3924#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 3925#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 3926#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 3927#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 3928#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 3929#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 3930#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 3931#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 3932#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 3933#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 3934#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 3935#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 3936#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 3937#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 3938#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 3939#(not (= |#Ultimate.C_memset_#amount| 80)), 3898#true, 3899#false, 3900#(= |#Ultimate.C_memset_#t~loopctr5| 0), 3901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 3902#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 3903#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:35,625 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-02 10:44:35,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-02 10:44:35,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-02 10:44:35,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=860, Invalid=862, Unknown=0, NotChecked=0, Total=1722
[2018-02-02 10:44:35,626 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 42 states.
[2018-02-02 10:44:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:35,674 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions.
[2018-02-02 10:44:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-02-02 10:44:35,674 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55
[2018-02-02 10:44:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:35,674 INFO L225 Difference]: With dead ends: 59
[2018-02-02 10:44:35,675 INFO L226 Difference]: Without dead ends: 57
[2018-02-02 10:44:35,675 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-02 10:44:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-02 10:44:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2018-02-02 10:44:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-02 10:44:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions.
[2018-02-02 10:44:35,676 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55
[2018-02-02 10:44:35,676 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:35,676 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions.
[2018-02-02 10:44:35,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-02 10:44:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions.
[2018-02-02 10:44:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 10:44:35,677 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:35,677 INFO L351 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:35,677 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1805525851, now seen corresponding path program 39 times
[2018-02-02 10:44:35,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:35,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:36,213 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-02 10:44:36,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:36,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43
[2018-02-02 10:44:36,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:36,214 INFO L182 omatonBuilderFactory]: Interpolants [4096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4098#(not (= |#Ultimate.C_memset_#amount| 80)), 4056#true, 4057#false, 4058#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4059#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4064#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4067#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4068#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4069#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4071#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4072#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4075#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4076#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4085#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4088#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4094#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4095#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:36,214 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-02 10:44:36,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states
[2018-02-02 10:44:36,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2018-02-02 10:44:36,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806
[2018-02-02 10:44:36,215 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 43 states.
[2018-02-02 10:44:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:36,260 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions.
[2018-02-02 10:44:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2018-02-02 10:44:36,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56
[2018-02-02 10:44:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:36,261 INFO L225 Difference]: With dead ends: 60
[2018-02-02 10:44:36,261 INFO L226 Difference]: Without dead ends: 58
[2018-02-02 10:44:36,261 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-02 10:44:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-02-02 10:44:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2018-02-02 10:44:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-02 10:44:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions.
[2018-02-02 10:44:36,263 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56
[2018-02-02 10:44:36,264 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:36,264 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions.
[2018-02-02 10:44:36,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states.
[2018-02-02 10:44:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions.
[2018-02-02 10:44:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-02-02 10:44:36,264 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:36,264 INFO L351 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:36,264 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -476179972, now seen corresponding path program 40 times
[2018-02-02 10:44:36,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:36,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:36,776 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-02 10:44:36,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:36,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44
[2018-02-02 10:44:36,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:36,776 INFO L182 omatonBuilderFactory]: Interpolants [4224#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4230#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4231#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4232#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4233#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4240#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4241#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4243#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4246#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4248#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4249#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4254#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4256#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4257#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4258#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4260#(not (= |#Ultimate.C_memset_#amount| 80)), 4217#true, 4218#false, 4219#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4222#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:36,777 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-02 10:44:36,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-02-02 10:44:36,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-02-02 10:44:36,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=945, Invalid=947, Unknown=0, NotChecked=0, Total=1892
[2018-02-02 10:44:36,777 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 44 states.
[2018-02-02 10:44:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:36,833 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions.
[2018-02-02 10:44:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-02-02 10:44:36,833 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 57
[2018-02-02 10:44:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:36,834 INFO L225 Difference]: With dead ends: 61
[2018-02-02 10:44:36,834 INFO L226 Difference]: Without dead ends: 59
[2018-02-02 10:44:36,835 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-02 10:44:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-02 10:44:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2018-02-02 10:44:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-02-02 10:44:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions.
[2018-02-02 10:44:36,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57
[2018-02-02 10:44:36,837 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:36,837 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions.
[2018-02-02 10:44:36,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-02-02 10:44:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions.
[2018-02-02 10:44:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-02-02 10:44:36,837 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:36,838 INFO L351 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:36,838 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1805383547, now seen corresponding path program 41 times
[2018-02-02 10:44:36,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:36,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:37,426 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-02 10:44:37,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:37,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45
[2018-02-02 10:44:37,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:37,427 INFO L182 omatonBuilderFactory]: Interpolants [4416#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4417#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4418#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4419#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4421#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4422#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4423#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4424#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4425#(not (= |#Ultimate.C_memset_#amount| 80)), 4381#true, 4382#false, 4383#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4384#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4385#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4386#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4388#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4389#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4390#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4391#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4392#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4393#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4394#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4395#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4396#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4397#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4398#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4399#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4400#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4401#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4402#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4403#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4404#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4405#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4406#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4407#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4408#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4409#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4410#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4411#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4412#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4413#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4414#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4415#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32))]
[2018-02-02 10:44:37,427 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-02 10:44:37,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states
[2018-02-02 10:44:37,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2018-02-02 10:44:37,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:44:37,428 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 45 states.
[2018-02-02 10:44:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:37,457 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions.
[2018-02-02 10:44:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-02-02 10:44:37,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 58
[2018-02-02 10:44:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:37,458 INFO L225 Difference]: With dead ends: 62
[2018-02-02 10:44:37,458 INFO L226 Difference]: Without dead ends: 60
[2018-02-02 10:44:37,459 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-02 10:44:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-02-02 10:44:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2018-02-02 10:44:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-02 10:44:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions.
[2018-02-02 10:44:37,461 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58
[2018-02-02 10:44:37,461 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:37,461 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions.
[2018-02-02 10:44:37,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states.
[2018-02-02 10:44:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions.
[2018-02-02 10:44:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-02-02 10:44:37,461 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:37,462 INFO L351 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:37,462 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -480591396, now seen corresponding path program 42 times
[2018-02-02 10:44:37,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:37,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:37,988 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-02 10:44:37,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:37,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46
[2018-02-02 10:44:37,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:37,988 INFO L182 omatonBuilderFactory]: Interpolants [4548#true, 4549#false, 4550#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4551#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4552#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4553#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4554#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4555#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4557#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4558#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4559#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4560#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4562#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4563#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4564#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4565#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4566#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4567#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4568#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4569#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4570#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4571#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4573#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4574#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4575#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4576#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4578#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4579#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4580#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4581#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4582#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4583#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4584#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4585#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4586#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4587#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4588#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4589#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4590#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4591#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4592#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4593#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:37,989 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-02 10:44:37,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-02 10:44:37,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-02 10:44:37,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:44:37,990 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 46 states.
[2018-02-02 10:44:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:38,048 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions.
[2018-02-02 10:44:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2018-02-02 10:44:38,048 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59
[2018-02-02 10:44:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:38,048 INFO L225 Difference]: With dead ends: 63
[2018-02-02 10:44:38,049 INFO L226 Difference]: Without dead ends: 61
[2018-02-02 10:44:38,049 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-02 10:44:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2018-02-02 10:44:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2018-02-02 10:44:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-02-02 10:44:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions.
[2018-02-02 10:44:38,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59
[2018-02-02 10:44:38,051 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:38,051 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions.
[2018-02-02 10:44:38,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-02-02 10:44:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions.
[2018-02-02 10:44:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-02-02 10:44:38,052 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:38,052 INFO L351 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:38,052 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1668629403, now seen corresponding path program 43 times
[2018-02-02 10:44:38,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:38,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:38,624 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-02 10:44:38,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:38,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47
[2018-02-02 10:44:38,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:38,624 INFO L182 omatonBuilderFactory]: Interpolants [4736#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4737#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4739#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4740#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4741#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4742#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4743#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4745#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4747#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4748#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4749#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4750#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4751#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4753#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4754#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 4755#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4757#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4758#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4759#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4760#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4761#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4762#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4763#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 4764#(not (= |#Ultimate.C_memset_#amount| 80)), 4718#true, 4719#false, 4720#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4722#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4723#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4724#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4725#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4727#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4728#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4730#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4731#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4734#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:38,625 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-02 10:44:38,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states
[2018-02-02 10:44:38,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2018-02-02 10:44:38,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:44:38,625 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 47 states.
[2018-02-02 10:44:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:38,689 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions.
[2018-02-02 10:44:38,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-02-02 10:44:38,689 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 60
[2018-02-02 10:44:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:38,690 INFO L225 Difference]: With dead ends: 64
[2018-02-02 10:44:38,690 INFO L226 Difference]: Without dead ends: 62
[2018-02-02 10:44:38,690 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-02 10:44:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2018-02-02 10:44:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62.
[2018-02-02 10:44:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 10:44:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions.
[2018-02-02 10:44:38,692 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60
[2018-02-02 10:44:38,692 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:38,692 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions.
[2018-02-02 10:44:38,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states.
[2018-02-02 10:44:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions.
[2018-02-02 10:44:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-02-02 10:44:38,693 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:38,693 INFO L351 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:38,693 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -425002564, now seen corresponding path program 44 times
[2018-02-02 10:44:38,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:38,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:39,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:39,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48
[2018-02-02 10:44:39,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:39,289 INFO L182 omatonBuilderFactory]: Interpolants [4928#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 4929#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 4930#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 4931#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 4932#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 4933#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 4934#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 4935#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 4936#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 4937#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 4938#(not (= |#Ultimate.C_memset_#amount| 80)), 4891#true, 4892#false, 4893#(= |#Ultimate.C_memset_#t~loopctr5| 0), 4894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 4895#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 4896#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 4897#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 4898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 4899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 4900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 4901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 4902#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 4903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 4904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 4905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 4906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 4907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 4908#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 4909#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 4910#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 4911#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 4912#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 4913#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 4914#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 4915#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 4916#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 4917#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 4918#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 4919#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 4920#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 4921#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 4922#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 4923#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 4924#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 4925#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 4926#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 4927#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34))]
[2018-02-02 10:44:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:39,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states
[2018-02-02 10:44:39,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2018-02-02 10:44:39,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=1129, Unknown=0, NotChecked=0, Total=2256
[2018-02-02 10:44:39,290 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 48 states.
[2018-02-02 10:44:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:39,321 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions.
[2018-02-02 10:44:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-02-02 10:44:39,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61
[2018-02-02 10:44:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:39,321 INFO L225 Difference]: With dead ends: 65
[2018-02-02 10:44:39,321 INFO L226 Difference]: Without dead ends: 63
[2018-02-02 10:44:39,321 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-02 10:44:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-02-02 10:44:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2018-02-02 10:44:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-02-02 10:44:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions.
[2018-02-02 10:44:39,322 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61
[2018-02-02 10:44:39,323 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:39,323 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions.
[2018-02-02 10:44:39,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states.
[2018-02-02 10:44:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions.
[2018-02-02 10:44:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 10:44:39,323 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:39,323 INFO L351 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:39,323 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash -903084101, now seen corresponding path program 45 times
[2018-02-02 10:44:39,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:39,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:39,945 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-02 10:44:39,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:39,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49
[2018-02-02 10:44:39,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:39,946 INFO L182 omatonBuilderFactory]: Interpolants [5067#true, 5068#false, 5069#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5071#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5072#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5074#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5075#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5076#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5082#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5084#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5085#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5094#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5096#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5099#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5100#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5104#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5105#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5107#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5109#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5110#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5112#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5113#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5115#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:39,946 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-02 10:44:39,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-02-02 10:44:39,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-02-02 10:44:39,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352
[2018-02-02 10:44:39,947 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 49 states.
[2018-02-02 10:44:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:40,008 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions.
[2018-02-02 10:44:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2018-02-02 10:44:40,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 62
[2018-02-02 10:44:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:40,008 INFO L225 Difference]: With dead ends: 66
[2018-02-02 10:44:40,008 INFO L226 Difference]: Without dead ends: 64
[2018-02-02 10:44:40,009 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-02 10:44:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-02 10:44:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2018-02-02 10:44:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2018-02-02 10:44:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions.
[2018-02-02 10:44:40,010 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62
[2018-02-02 10:44:40,010 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:40,010 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions.
[2018-02-02 10:44:40,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-02-02 10:44:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions.
[2018-02-02 10:44:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-02-02 10:44:40,011 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:40,011 INFO L351 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:40,011 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1456257436, now seen corresponding path program 46 times
[2018-02-02 10:44:40,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:40,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:40,616 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-02 10:44:40,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:40,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50
[2018-02-02 10:44:40,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:40,617 INFO L182 omatonBuilderFactory]: Interpolants [5248#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5249#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5251#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5252#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5254#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5256#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5257#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5258#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5260#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5261#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5262#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5263#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5264#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5265#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5266#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5267#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5268#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5269#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5270#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5271#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5272#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5273#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5274#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5275#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5276#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5277#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5278#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5279#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5280#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5281#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5282#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5283#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5284#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5285#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5286#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5287#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5288#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5289#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5290#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5291#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5292#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5293#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5294#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5295#(not (= |#Ultimate.C_memset_#amount| 80)), 5246#true, 5247#false]
[2018-02-02 10:44:40,617 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-02 10:44:40,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states
[2018-02-02 10:44:40,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2018-02-02 10:44:40,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=1226, Unknown=0, NotChecked=0, Total=2450
[2018-02-02 10:44:40,618 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 50 states.
[2018-02-02 10:44:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:40,676 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions.
[2018-02-02 10:44:40,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-02-02 10:44:40,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 63
[2018-02-02 10:44:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:40,677 INFO L225 Difference]: With dead ends: 67
[2018-02-02 10:44:40,677 INFO L226 Difference]: Without dead ends: 65
[2018-02-02 10:44:40,677 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-02 10:44:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-02-02 10:44:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2018-02-02 10:44:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2018-02-02 10:44:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions.
[2018-02-02 10:44:40,679 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63
[2018-02-02 10:44:40,679 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:40,679 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions.
[2018-02-02 10:44:40,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states.
[2018-02-02 10:44:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions.
[2018-02-02 10:44:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:44:40,679 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:40,679 INFO L351 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:40,679 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1581401051, now seen corresponding path program 47 times
[2018-02-02 10:44:40,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:40,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:41,328 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-02 10:44:41,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:41,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51
[2018-02-02 10:44:41,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:41,329 INFO L182 omatonBuilderFactory]: Interpolants [5428#true, 5429#false, 5430#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5431#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5435#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5436#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5437#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5438#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5439#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5440#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5441#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5442#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5443#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5444#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5445#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5447#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5448#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5449#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5450#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5451#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5452#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5453#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5454#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5455#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5456#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5457#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5458#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5459#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5460#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5461#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5462#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5464#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5465#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5467#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5468#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5471#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5473#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5474#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5475#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5477#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5478#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:41,329 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-02 10:44:41,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-02-02 10:44:41,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-02-02 10:44:41,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550
[2018-02-02 10:44:41,330 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 51 states.
[2018-02-02 10:44:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:41,419 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions.
[2018-02-02 10:44:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2018-02-02 10:44:41,419 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 64
[2018-02-02 10:44:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:41,420 INFO L225 Difference]: With dead ends: 68
[2018-02-02 10:44:41,420 INFO L226 Difference]: Without dead ends: 66
[2018-02-02 10:44:41,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550
[2018-02-02 10:44:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-02-02 10:44:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2018-02-02 10:44:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states.
[2018-02-02 10:44:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions.
[2018-02-02 10:44:41,421 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64
[2018-02-02 10:44:41,421 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:41,421 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions.
[2018-02-02 10:44:41,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-02-02 10:44:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions.
[2018-02-02 10:44:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-02-02 10:44:41,421 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:41,421 INFO L351 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:41,422 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1165885820, now seen corresponding path program 48 times
[2018-02-02 10:44:41,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:41,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:42,096 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-02 10:44:42,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:42,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52
[2018-02-02 10:44:42,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:42,097 INFO L182 omatonBuilderFactory]: Interpolants [5632#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5635#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5638#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5639#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5640#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5642#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5643#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5644#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5645#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5646#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5647#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5648#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5649#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5650#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5651#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5652#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5653#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5654#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5655#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5656#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5657#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5658#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5659#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5660#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5661#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5662#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5663#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 5664#(not (= |#Ultimate.C_memset_#amount| 80)), 5613#true, 5614#false, 5615#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5616#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5617#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5618#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5619#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5622#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5623#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5624#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5628#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5630#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5631#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:44:42,098 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-02 10:44:42,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states
[2018-02-02 10:44:42,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2018-02-02 10:44:42,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:44:42,099 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 52 states.
[2018-02-02 10:44:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:42,151 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions.
[2018-02-02 10:44:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2018-02-02 10:44:42,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 65
[2018-02-02 10:44:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:42,152 INFO L225 Difference]: With dead ends: 69
[2018-02-02 10:44:42,152 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 10:44:42,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:44:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 10:44:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2018-02-02 10:44:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-02-02 10:44:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions.
[2018-02-02 10:44:42,153 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65
[2018-02-02 10:44:42,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:42,153 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions.
[2018-02-02 10:44:42,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states.
[2018-02-02 10:44:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions.
[2018-02-02 10:44:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 10:44:42,154 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:42,154 INFO L351 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:42,154 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1169815547, now seen corresponding path program 49 times
[2018-02-02 10:44:42,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:42,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:42,851 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-02 10:44:42,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:42,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53
[2018-02-02 10:44:42,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:42,852 INFO L182 omatonBuilderFactory]: Interpolants [5801#true, 5802#false, 5803#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5804#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5805#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5806#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5807#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 5809#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 5810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 5811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 5812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 5813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 5814#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 5815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 5816#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 5817#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 5818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 5819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 5820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 5821#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 5822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 5823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 5824#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 5825#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 5826#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 5827#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 5828#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 5829#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 5830#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 5831#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 5832#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 5833#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 5834#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 5835#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 5836#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 5837#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 5838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 5839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 5840#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 5841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 5842#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 5843#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 5844#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 5845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 5846#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 5847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 5848#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 5849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 5850#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 5851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 5852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 5853#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:42,852 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-02 10:44:42,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states
[2018-02-02 10:44:42,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2018-02-02 10:44:42,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756
[2018-02-02 10:44:42,853 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 53 states.
[2018-02-02 10:44:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:42,934 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions.
[2018-02-02 10:44:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states.
[2018-02-02 10:44:42,935 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 66
[2018-02-02 10:44:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:42,935 INFO L225 Difference]: With dead ends: 70
[2018-02-02 10:44:42,935 INFO L226 Difference]: Without dead ends: 68
[2018-02-02 10:44:42,935 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-02 10:44:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-02-02 10:44:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2018-02-02 10:44:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2018-02-02 10:44:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions.
[2018-02-02 10:44:42,937 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66
[2018-02-02 10:44:42,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:42,937 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions.
[2018-02-02 10:44:42,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states.
[2018-02-02 10:44:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions.
[2018-02-02 10:44:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-02 10:44:42,937 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:42,937 INFO L351 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:42,937 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1291637084, now seen corresponding path program 50 times
[2018-02-02 10:44:42,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:42,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:43,684 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-02 10:44:43,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:43,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54
[2018-02-02 10:44:43,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:43,684 INFO L182 omatonBuilderFactory]: Interpolants [6016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6017#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6018#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6019#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6023#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6024#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6025#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6027#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6028#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6029#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6030#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6031#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6032#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6033#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6034#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6035#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6036#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6037#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6038#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6039#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6040#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6041#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6042#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6043#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6044#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6045#(not (= |#Ultimate.C_memset_#amount| 80)), 5992#true, 5993#false, 5994#(= |#Ultimate.C_memset_#t~loopctr5| 0), 5995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 5996#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 5997#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 5998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 5999#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6006#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6007#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6009#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6010#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6014#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21))]
[2018-02-02 10:44:43,685 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-02 10:44:43,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states
[2018-02-02 10:44:43,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2018-02-02 10:44:43,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1430, Invalid=1432, Unknown=0, NotChecked=0, Total=2862
[2018-02-02 10:44:43,685 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 54 states.
[2018-02-02 10:44:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:43,744 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions.
[2018-02-02 10:44:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2018-02-02 10:44:43,744 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 67
[2018-02-02 10:44:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:43,744 INFO L225 Difference]: With dead ends: 71
[2018-02-02 10:44:43,745 INFO L226 Difference]: Without dead ends: 69
[2018-02-02 10:44:43,745 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-02 10:44:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-02-02 10:44:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2018-02-02 10:44:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-02-02 10:44:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions.
[2018-02-02 10:44:43,746 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67
[2018-02-02 10:44:43,746 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:43,746 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions.
[2018-02-02 10:44:43,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states.
[2018-02-02 10:44:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions.
[2018-02-02 10:44:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-02-02 10:44:43,746 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:43,746 INFO L351 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:43,746 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 773137435, now seen corresponding path program 51 times
[2018-02-02 10:44:43,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:43,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:44,501 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-02 10:44:44,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:44,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55
[2018-02-02 10:44:44,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:44,502 INFO L182 omatonBuilderFactory]: Interpolants [6186#true, 6187#false, 6188#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6189#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6190#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6191#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6192#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6193#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6195#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6196#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6198#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6199#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6200#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6201#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6202#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6203#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6204#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6205#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6206#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6207#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6208#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6209#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6210#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6211#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6212#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6213#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6214#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6215#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6216#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6217#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6218#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6219#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6221#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6222#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6224#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6225#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6226#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6228#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6229#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6230#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6231#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6232#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6233#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6234#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6236#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6237#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6239#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6240#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:44,502 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-02 10:44:44,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states
[2018-02-02 10:44:44,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2018-02-02 10:44:44,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970
[2018-02-02 10:44:44,503 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 55 states.
[2018-02-02 10:44:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:44,574 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions.
[2018-02-02 10:44:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2018-02-02 10:44:44,575 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 68
[2018-02-02 10:44:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:44,575 INFO L225 Difference]: With dead ends: 72
[2018-02-02 10:44:44,575 INFO L226 Difference]: Without dead ends: 70
[2018-02-02 10:44:44,575 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-02 10:44:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2018-02-02 10:44:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2018-02-02 10:44:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-02-02 10:44:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions.
[2018-02-02 10:44:44,576 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68
[2018-02-02 10:44:44,577 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:44,577 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions.
[2018-02-02 10:44:44,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states.
[2018-02-02 10:44:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions.
[2018-02-02 10:44:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-02-02 10:44:44,577 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:44,577 INFO L351 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:44,577 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1879517500, now seen corresponding path program 52 times
[2018-02-02 10:44:44,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:44,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:45,364 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-02 10:44:45,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:45,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56
[2018-02-02 10:44:45,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:45,365 INFO L182 omatonBuilderFactory]: Interpolants [6400#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6401#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6402#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6403#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6404#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6405#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6406#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6407#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6408#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6409#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6410#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6411#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6412#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6413#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6414#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6415#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6416#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6417#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6418#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6419#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6421#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6424#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6426#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6427#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6429#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6430#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6431#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6434#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6435#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6436#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6437#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6438#(not (= |#Ultimate.C_memset_#amount| 80)), 6383#true, 6384#false, 6385#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6386#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6388#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6389#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6390#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6391#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6392#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6393#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6394#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6395#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6396#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6397#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6398#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6399#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14))]
[2018-02-02 10:44:45,365 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-02 10:44:45,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states
[2018-02-02 10:44:45,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2018-02-02 10:44:45,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1539, Invalid=1541, Unknown=0, NotChecked=0, Total=3080
[2018-02-02 10:44:45,366 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 56 states.
[2018-02-02 10:44:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:45,433 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions.
[2018-02-02 10:44:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states.
[2018-02-02 10:44:45,433 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 69
[2018-02-02 10:44:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:45,434 INFO L225 Difference]: With dead ends: 73
[2018-02-02 10:44:45,434 INFO L226 Difference]: Without dead ends: 71
[2018-02-02 10:44:45,434 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-02 10:44:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2018-02-02 10:44:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2018-02-02 10:44:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2018-02-02 10:44:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions.
[2018-02-02 10:44:45,435 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69
[2018-02-02 10:44:45,435 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:45,435 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions.
[2018-02-02 10:44:45,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states.
[2018-02-02 10:44:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions.
[2018-02-02 10:44:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-02-02 10:44:45,436 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:45,436 INFO L351 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:45,436 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1817561147, now seen corresponding path program 53 times
[2018-02-02 10:44:45,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:45,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:46,222 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-02 10:44:46,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:46,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57
[2018-02-02 10:44:46,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:46,223 INFO L182 omatonBuilderFactory]: Interpolants [6583#true, 6584#false, 6585#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6586#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6587#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6588#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6589#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6590#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6591#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6592#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6593#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6594#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6595#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6596#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6597#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6598#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6599#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6600#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6601#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6602#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6604#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6605#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6606#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6607#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6608#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6609#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6610#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6612#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6613#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6614#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6615#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6616#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6617#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6618#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6620#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6621#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6623#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6626#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6629#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6638#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 6639#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:46,223 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-02 10:44:46,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states
[2018-02-02 10:44:46,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants.
[2018-02-02 10:44:46,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192
[2018-02-02 10:44:46,224 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 57 states.
[2018-02-02 10:44:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:46,293 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions.
[2018-02-02 10:44:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2018-02-02 10:44:46,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 70
[2018-02-02 10:44:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:46,294 INFO L225 Difference]: With dead ends: 74
[2018-02-02 10:44:46,294 INFO L226 Difference]: Without dead ends: 72
[2018-02-02 10:44:46,294 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-02 10:44:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-02-02 10:44:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2018-02-02 10:44:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2018-02-02 10:44:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions.
[2018-02-02 10:44:46,295 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70
[2018-02-02 10:44:46,295 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:46,296 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions.
[2018-02-02 10:44:46,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states.
[2018-02-02 10:44:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions.
[2018-02-02 10:44:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-02-02 10:44:46,296 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:46,296 INFO L351 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:46,296 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -103085796, now seen corresponding path program 54 times
[2018-02-02 10:44:46,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:46,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:47,107 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-02 10:44:47,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:47,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58
[2018-02-02 10:44:47,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:47,107 INFO L182 omatonBuilderFactory]: Interpolants [6786#true, 6787#false, 6788#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6789#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6790#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6791#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6792#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6793#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 6794#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 6795#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 6796#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 6797#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 6798#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 6799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 6800#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 6801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 6802#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 6803#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 6804#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 6805#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 6806#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 6807#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 6808#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 6809#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 6810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 6811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 6812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 6813#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 6814#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 6815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 6816#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 6817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 6818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 6819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 6820#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 6821#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 6822#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 6823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 6824#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 6825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 6826#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 6827#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 6828#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 6829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 6830#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 6831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 6832#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 6833#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 6834#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 6835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 6836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 6837#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 6838#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 6839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 6840#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 6841#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 6842#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 6843#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:47,108 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-02 10:44:47,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states
[2018-02-02 10:44:47,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2018-02-02 10:44:47,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306
[2018-02-02 10:44:47,109 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 58 states.
[2018-02-02 10:44:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:47,205 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions.
[2018-02-02 10:44:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states.
[2018-02-02 10:44:47,205 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 71
[2018-02-02 10:44:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:47,205 INFO L225 Difference]: With dead ends: 75
[2018-02-02 10:44:47,205 INFO L226 Difference]: Without dead ends: 73
[2018-02-02 10:44:47,206 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-02 10:44:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-02-02 10:44:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2018-02-02 10:44:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states.
[2018-02-02 10:44:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions.
[2018-02-02 10:44:47,207 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71
[2018-02-02 10:44:47,207 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:47,207 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions.
[2018-02-02 10:44:47,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states.
[2018-02-02 10:44:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions.
[2018-02-02 10:44:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-02-02 10:44:47,207 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:47,207 INFO L351 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:47,207 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 486401115, now seen corresponding path program 55 times
[2018-02-02 10:44:47,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:47,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:48,287 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-02 10:44:48,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:48,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59
[2018-02-02 10:44:48,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:48,288 INFO L182 omatonBuilderFactory]: Interpolants [7040#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7041#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7042#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7043#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7044#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7045#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7046#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7047#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7048#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7049#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7050#(not (= |#Ultimate.C_memset_#amount| 80)), 6992#true, 6993#false, 6994#(= |#Ultimate.C_memset_#t~loopctr5| 0), 6995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 6996#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 6997#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 6998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 6999#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7006#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7007#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7009#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7010#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7014#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7017#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7018#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7019#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7023#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7024#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7025#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7027#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7028#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7029#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7030#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7031#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7032#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7033#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7034#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7035#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7036#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7037#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7038#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7039#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45))]
[2018-02-02 10:44:48,288 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-02 10:44:48,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states
[2018-02-02 10:44:48,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2018-02-02 10:44:48,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422
[2018-02-02 10:44:48,289 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 59 states.
[2018-02-02 10:44:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:48,338 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions.
[2018-02-02 10:44:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2018-02-02 10:44:48,338 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 72
[2018-02-02 10:44:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:48,339 INFO L225 Difference]: With dead ends: 76
[2018-02-02 10:44:48,339 INFO L226 Difference]: Without dead ends: 74
[2018-02-02 10:44:48,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422
[2018-02-02 10:44:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-02-02 10:44:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2018-02-02 10:44:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-02 10:44:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions.
[2018-02-02 10:44:48,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72
[2018-02-02 10:44:48,341 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:48,341 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions.
[2018-02-02 10:44:48,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states.
[2018-02-02 10:44:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions.
[2018-02-02 10:44:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-02 10:44:48,341 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:48,341 INFO L351 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:48,341 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1580626172, now seen corresponding path program 56 times
[2018-02-02 10:44:48,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:48,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:49,190 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-02 10:44:49,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:49,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60
[2018-02-02 10:44:49,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:49,191 INFO L182 omatonBuilderFactory]: Interpolants [7201#true, 7202#false, 7203#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7204#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7205#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7206#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7207#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7208#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7209#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7210#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7211#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7212#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7213#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7214#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7215#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7216#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7217#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7218#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7219#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7222#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7224#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7227#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7230#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7231#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7232#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7233#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7235#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7237#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7238#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7239#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7241#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7243#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7247#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7248#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7249#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7251#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7254#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7256#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7257#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7258#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7260#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:49,191 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-02 10:44:49,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states
[2018-02-02 10:44:49,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2018-02-02 10:44:49,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540
[2018-02-02 10:44:49,192 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 60 states.
[2018-02-02 10:44:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:49,268 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions.
[2018-02-02 10:44:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states.
[2018-02-02 10:44:49,269 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 73
[2018-02-02 10:44:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:49,269 INFO L225 Difference]: With dead ends: 77
[2018-02-02 10:44:49,269 INFO L226 Difference]: Without dead ends: 75
[2018-02-02 10:44:49,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540
[2018-02-02 10:44:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2018-02-02 10:44:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2018-02-02 10:44:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-02-02 10:44:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions.
[2018-02-02 10:44:49,271 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73
[2018-02-02 10:44:49,271 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:49,271 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions.
[2018-02-02 10:44:49,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states.
[2018-02-02 10:44:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions.
[2018-02-02 10:44:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-02-02 10:44:49,271 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:49,271 INFO L351 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:49,271 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1141864571, now seen corresponding path program 57 times
[2018-02-02 10:44:49,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:49,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:50,271 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-02 10:44:50,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:50,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61
[2018-02-02 10:44:50,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:50,272 INFO L182 omatonBuilderFactory]: Interpolants [7424#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7425#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7426#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7427#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7428#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7429#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7430#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7431#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7432#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7434#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7435#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7436#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7437#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7438#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7439#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7440#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7441#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7442#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7443#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7444#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7445#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7447#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7448#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7449#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7450#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7451#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7452#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7453#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7454#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7455#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7456#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7457#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7458#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7459#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7460#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7461#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7462#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7463#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7464#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7465#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7467#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7468#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7473#(not (= |#Ultimate.C_memset_#amount| 80)), 7413#true, 7414#false, 7415#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7416#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7417#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7418#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7419#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7420#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7421#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7422#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7423#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8))]
[2018-02-02 10:44:50,272 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-02 10:44:50,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states
[2018-02-02 10:44:50,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2018-02-02 10:44:50,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660
[2018-02-02 10:44:50,273 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 61 states.
[2018-02-02 10:44:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:50,348 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions.
[2018-02-02 10:44:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2018-02-02 10:44:50,348 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 74
[2018-02-02 10:44:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:50,349 INFO L225 Difference]: With dead ends: 78
[2018-02-02 10:44:50,349 INFO L226 Difference]: Without dead ends: 76
[2018-02-02 10:44:50,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660
[2018-02-02 10:44:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2018-02-02 10:44:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76.
[2018-02-02 10:44:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2018-02-02 10:44:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions.
[2018-02-02 10:44:50,351 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74
[2018-02-02 10:44:50,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:50,351 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions.
[2018-02-02 10:44:50,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states.
[2018-02-02 10:44:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions.
[2018-02-02 10:44:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-02-02 10:44:50,352 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:50,352 INFO L351 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:50,352 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 425156828, now seen corresponding path program 58 times
[2018-02-02 10:44:50,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:50,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:51,345 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-02 10:44:51,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:51,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62
[2018-02-02 10:44:51,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:51,346 INFO L182 omatonBuilderFactory]: Interpolants [7680#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7681#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7682#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7683#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7684#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7685#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7686#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7687#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7688#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 7689#(not (= |#Ultimate.C_memset_#amount| 80)), 7628#true, 7629#false, 7630#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7634#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7638#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7639#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7640#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7641#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7642#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7643#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7644#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7645#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7646#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7647#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7648#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7649#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7650#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7651#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7652#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7653#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7654#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7655#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7656#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7657#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7658#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7659#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7660#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7661#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7662#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7663#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7664#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7665#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7666#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7667#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7668#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7669#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7670#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7671#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7672#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7673#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7674#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7675#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7676#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7677#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7679#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49))]
[2018-02-02 10:44:51,346 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-02 10:44:51,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states
[2018-02-02 10:44:51,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants.
[2018-02-02 10:44:51,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782
[2018-02-02 10:44:51,347 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 62 states.
[2018-02-02 10:44:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:51,403 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions.
[2018-02-02 10:44:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states.
[2018-02-02 10:44:51,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 75
[2018-02-02 10:44:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:51,404 INFO L225 Difference]: With dead ends: 79
[2018-02-02 10:44:51,404 INFO L226 Difference]: Without dead ends: 77
[2018-02-02 10:44:51,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782
[2018-02-02 10:44:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2018-02-02 10:44:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2018-02-02 10:44:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 10:44:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions.
[2018-02-02 10:44:51,406 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75
[2018-02-02 10:44:51,406 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:51,406 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions.
[2018-02-02 10:44:51,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states.
[2018-02-02 10:44:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions.
[2018-02-02 10:44:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-02-02 10:44:51,407 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:51,407 INFO L351 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:51,407 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -317946725, now seen corresponding path program 59 times
[2018-02-02 10:44:51,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:51,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:52,501 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-02 10:44:52,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:52,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63
[2018-02-02 10:44:52,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:52,502 INFO L182 omatonBuilderFactory]: Interpolants [7846#true, 7847#false, 7848#(= |#Ultimate.C_memset_#t~loopctr5| 0), 7849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 7850#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 7851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 7852#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 7853#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 7854#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 7855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 7856#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 7857#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 7858#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 7859#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 7860#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 7861#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 7862#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 7863#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 7864#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 7865#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 7866#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 7867#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 7868#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 7869#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 7870#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 7871#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 7872#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 7873#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 7874#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 7875#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 7876#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 7877#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 7878#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 7879#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 7880#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 7881#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 7882#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 7883#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 7884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 7885#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 7886#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 7887#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 7888#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 7889#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 7890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 7891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 7892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 7893#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 7894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 7895#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 7896#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 7897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 7898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 7899#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 7900#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 7901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 7902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 7903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 7904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 7905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 7906#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 7907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 7908#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:52,502 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-02 10:44:52,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states
[2018-02-02 10:44:52,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants.
[2018-02-02 10:44:52,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906
[2018-02-02 10:44:52,503 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 63 states.
[2018-02-02 10:44:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:52,586 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions.
[2018-02-02 10:44:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states.
[2018-02-02 10:44:52,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 76
[2018-02-02 10:44:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:52,587 INFO L225 Difference]: With dead ends: 80
[2018-02-02 10:44:52,587 INFO L226 Difference]: Without dead ends: 78
[2018-02-02 10:44:52,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906
[2018-02-02 10:44:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-02-02 10:44:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2018-02-02 10:44:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-02-02 10:44:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions.
[2018-02-02 10:44:52,588 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76
[2018-02-02 10:44:52,588 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:52,588 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions.
[2018-02-02 10:44:52,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states.
[2018-02-02 10:44:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions.
[2018-02-02 10:44:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-02-02 10:44:52,589 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:52,589 INFO L351 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:52,589 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1879320388, now seen corresponding path program 60 times
[2018-02-02 10:44:52,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:52,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:53,609 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-02 10:44:53,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:53,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64
[2018-02-02 10:44:53,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:53,609 INFO L182 omatonBuilderFactory]: Interpolants [8067#true, 8068#false, 8069#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8071#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8072#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8074#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8075#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8076#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8081#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8082#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8084#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8085#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8086#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8090#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8091#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8092#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8094#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8095#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8096#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8097#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8099#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8100#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8101#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8102#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8103#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8104#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8105#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8107#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8108#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8109#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8110#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8111#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8112#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8113#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8114#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8115#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8116#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8117#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8118#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8119#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8120#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8121#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8122#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8123#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8124#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8125#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8126#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8127#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8128#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8129#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8130#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:53,610 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-02 10:44:53,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states
[2018-02-02 10:44:53,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants.
[2018-02-02 10:44:53,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2015, Invalid=2017, Unknown=0, NotChecked=0, Total=4032
[2018-02-02 10:44:53,610 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 64 states.
[2018-02-02 10:44:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:53,723 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions.
[2018-02-02 10:44:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states.
[2018-02-02 10:44:53,724 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 77
[2018-02-02 10:44:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:53,724 INFO L225 Difference]: With dead ends: 81
[2018-02-02 10:44:53,724 INFO L226 Difference]: Without dead ends: 79
[2018-02-02 10:44:53,724 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-02 10:44:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2018-02-02 10:44:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2018-02-02 10:44:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2018-02-02 10:44:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions.
[2018-02-02 10:44:53,725 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77
[2018-02-02 10:44:53,725 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:53,725 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions.
[2018-02-02 10:44:53,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states.
[2018-02-02 10:44:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions.
[2018-02-02 10:44:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-02-02 10:44:53,726 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:53,726 INFO L351 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:53,726 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1257703611, now seen corresponding path program 61 times
[2018-02-02 10:44:53,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:53,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:54,894 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-02 10:44:54,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:54,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65
[2018-02-02 10:44:54,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:54,895 INFO L182 omatonBuilderFactory]: Interpolants [8320#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8323#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8324#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8326#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8327#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8329#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8330#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8332#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8333#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8336#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8337#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8339#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8340#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8341#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8343#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8344#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8345#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8346#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8347#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8348#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8349#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8350#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8352#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8353#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8354#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8355#(not (= |#Ultimate.C_memset_#amount| 80)), 8291#true, 8292#false, 8293#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8294#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8295#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8296#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8299#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8300#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8301#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8302#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8303#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8305#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8309#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8310#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8311#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8314#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8315#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8316#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8319#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26))]
[2018-02-02 10:44:54,895 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-02 10:44:54,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states
[2018-02-02 10:44:54,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants.
[2018-02-02 10:44:54,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160
[2018-02-02 10:44:54,896 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 65 states.
[2018-02-02 10:44:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:54,975 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions.
[2018-02-02 10:44:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states.
[2018-02-02 10:44:54,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 78
[2018-02-02 10:44:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:54,976 INFO L225 Difference]: With dead ends: 82
[2018-02-02 10:44:54,976 INFO L226 Difference]: Without dead ends: 80
[2018-02-02 10:44:54,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160
[2018-02-02 10:44:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2018-02-02 10:44:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2018-02-02 10:44:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-02-02 10:44:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions.
[2018-02-02 10:44:54,978 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78
[2018-02-02 10:44:54,978 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:54,978 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions.
[2018-02-02 10:44:54,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states.
[2018-02-02 10:44:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions.
[2018-02-02 10:44:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2018-02-02 10:44:54,979 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:54,979 INFO L351 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:54,979 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash -278800228, now seen corresponding path program 62 times
[2018-02-02 10:44:54,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:54,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:56,057 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-02 10:44:56,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:56,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66
[2018-02-02 10:44:56,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:56,058 INFO L182 omatonBuilderFactory]: Interpolants [8576#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8578#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8579#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8580#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8581#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8582#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 8583#(not (= |#Ultimate.C_memset_#amount| 80)), 8518#true, 8519#false, 8520#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8521#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8522#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8523#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8524#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8525#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8526#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8527#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8528#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8529#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8530#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8532#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8533#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8534#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8535#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8536#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8537#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8539#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8540#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8541#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8542#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8543#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8544#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8545#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8546#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8547#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8548#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8549#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8550#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8551#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8552#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8553#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8554#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8555#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8556#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8557#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8558#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8559#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8560#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8561#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8562#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8563#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8564#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8565#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8566#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8567#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8568#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8569#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8570#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8571#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8573#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8574#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8575#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55))]
[2018-02-02 10:44:56,058 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-02 10:44:56,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states
[2018-02-02 10:44:56,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants.
[2018-02-02 10:44:56,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2144, Invalid=2146, Unknown=0, NotChecked=0, Total=4290
[2018-02-02 10:44:56,058 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 66 states.
[2018-02-02 10:44:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:56,100 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions.
[2018-02-02 10:44:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states.
[2018-02-02 10:44:56,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 79
[2018-02-02 10:44:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:56,100 INFO L225 Difference]: With dead ends: 83
[2018-02-02 10:44:56,100 INFO L226 Difference]: Without dead ends: 81
[2018-02-02 10:44:56,101 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-02 10:44:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2018-02-02 10:44:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2018-02-02 10:44:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 10:44:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions.
[2018-02-02 10:44:56,102 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79
[2018-02-02 10:44:56,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:56,102 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions.
[2018-02-02 10:44:56,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states.
[2018-02-02 10:44:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions.
[2018-02-02 10:44:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-02-02 10:44:56,102 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:56,102 INFO L351 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:56,103 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -665778981, now seen corresponding path program 63 times
[2018-02-02 10:44:56,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:56,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:57,266 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-02 10:44:57,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:57,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67
[2018-02-02 10:44:57,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:57,291 INFO L182 omatonBuilderFactory]: Interpolants [8748#true, 8749#false, 8750#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8752#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8753#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8754#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8759#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8760#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8761#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8762#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8763#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8764#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8765#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8766#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 8767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 8768#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 8769#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 8770#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 8771#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 8772#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 8773#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 8774#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 8775#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 8776#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 8777#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 8778#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 8779#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 8780#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 8781#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 8782#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 8783#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 8784#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 8785#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 8786#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 8787#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 8788#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 8789#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 8790#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 8791#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 8792#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 8793#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 8794#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 8795#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 8796#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 8797#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 8798#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 8799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 8800#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 8801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 8802#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 8803#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 8804#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 8805#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 8806#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 8807#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 8808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 8809#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 8810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 8811#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 8812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 8813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 8814#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:57,291 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-02 10:44:57,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states
[2018-02-02 10:44:57,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants.
[2018-02-02 10:44:57,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422
[2018-02-02 10:44:57,292 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 67 states.
[2018-02-02 10:44:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:57,394 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions.
[2018-02-02 10:44:57,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states.
[2018-02-02 10:44:57,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 80
[2018-02-02 10:44:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:57,395 INFO L225 Difference]: With dead ends: 84
[2018-02-02 10:44:57,395 INFO L226 Difference]: Without dead ends: 82
[2018-02-02 10:44:57,395 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-02 10:44:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 10:44:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82.
[2018-02-02 10:44:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-02 10:44:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions.
[2018-02-02 10:44:57,396 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80
[2018-02-02 10:44:57,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:57,396 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions.
[2018-02-02 10:44:57,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states.
[2018-02-02 10:44:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions.
[2018-02-02 10:44:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-02-02 10:44:57,397 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:57,397 INFO L351 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:57,397 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 222781564, now seen corresponding path program 64 times
[2018-02-02 10:44:57,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:57,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:58,563 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-02 10:44:58,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:58,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68
[2018-02-02 10:44:58,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:58,564 INFO L182 omatonBuilderFactory]: Interpolants [8981#true, 8982#false, 8983#(= |#Ultimate.C_memset_#t~loopctr5| 0), 8984#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 8985#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 8986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 8987#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 8988#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 8989#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 8990#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 8991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 8992#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 8993#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 8994#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 8995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 8996#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 8997#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 8998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 8999#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9001#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9006#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9007#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9008#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9009#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9010#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9012#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9013#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9014#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9016#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9017#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9018#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9019#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9020#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9021#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9023#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9024#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9025#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9026#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9027#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9028#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9029#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9030#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9031#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9032#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9033#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9034#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9035#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9036#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9037#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9038#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9039#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9040#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9041#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9042#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9043#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9044#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9045#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9046#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9047#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9048#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:58,564 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-02 10:44:58,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states
[2018-02-02 10:44:58,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants.
[2018-02-02 10:44:58,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556
[2018-02-02 10:44:58,564 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 68 states.
[2018-02-02 10:44:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:58,658 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions.
[2018-02-02 10:44:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2018-02-02 10:44:58,659 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 81
[2018-02-02 10:44:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:58,659 INFO L225 Difference]: With dead ends: 85
[2018-02-02 10:44:58,659 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 10:44:58,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556
[2018-02-02 10:44:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 10:44:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2018-02-02 10:44:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-02 10:44:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions.
[2018-02-02 10:44:58,661 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81
[2018-02-02 10:44:58,662 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:58,662 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions.
[2018-02-02 10:44:58,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states.
[2018-02-02 10:44:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions.
[2018-02-02 10:44:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2018-02-02 10:44:58,662 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:58,662 INFO L351 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:58,663 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1998354683, now seen corresponding path program 65 times
[2018-02-02 10:44:58,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:58,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:44:59,865 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-02 10:44:59,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:44:59,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69
[2018-02-02 10:44:59,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:44:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:44:59,865 INFO L182 omatonBuilderFactory]: Interpolants [9217#true, 9218#false, 9219#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9222#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9224#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9230#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9231#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9232#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9233#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9240#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9241#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9243#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9246#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9248#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9249#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9254#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9256#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9257#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9258#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9260#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9261#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9262#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9263#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9264#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9265#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9266#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9267#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9268#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9269#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9270#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9271#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9272#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9273#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9274#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9275#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9276#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9277#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9278#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9279#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9280#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9281#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9282#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9283#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9284#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9285#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:44:59,866 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-02 10:44:59,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states
[2018-02-02 10:44:59,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2018-02-02 10:44:59,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692
[2018-02-02 10:44:59,866 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 69 states.
[2018-02-02 10:44:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:44:59,950 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions.
[2018-02-02 10:44:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2018-02-02 10:44:59,950 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 82
[2018-02-02 10:44:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:44:59,951 INFO L225 Difference]: With dead ends: 86
[2018-02-02 10:44:59,951 INFO L226 Difference]: Without dead ends: 84
[2018-02-02 10:44:59,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692
[2018-02-02 10:44:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-02 10:44:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-02-02 10:44:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-02 10:44:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions.
[2018-02-02 10:44:59,953 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82
[2018-02-02 10:44:59,953 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:44:59,953 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions.
[2018-02-02 10:44:59,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states.
[2018-02-02 10:44:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions.
[2018-02-02 10:44:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2018-02-02 10:44:59,953 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:44:59,953 INFO L351 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:44:59,953 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:44:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1206546524, now seen corresponding path program 66 times
[2018-02-02 10:44:59,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:44:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:44:59,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:01,087 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-02 10:45:01,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:01,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70
[2018-02-02 10:45:01,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:01,087 INFO L182 omatonBuilderFactory]: Interpolants [9472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9473#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9474#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9475#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9476#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9477#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9478#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9479#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9480#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9481#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9482#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9483#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9484#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9485#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9486#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9487#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9488#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9489#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9490#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9492#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9493#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9494#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9495#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9496#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9498#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9499#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9500#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9501#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9502#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9503#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9505#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9506#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9507#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9508#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9509#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9510#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9512#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9515#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9516#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9517#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9518#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9520#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9521#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9522#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9523#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9524#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 9525#(not (= |#Ultimate.C_memset_#amount| 80)), 9456#true, 9457#false, 9458#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9459#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9460#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9461#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9462#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9464#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9465#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9467#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9468#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9469#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13))]
[2018-02-02 10:45:01,088 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-02 10:45:01,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states
[2018-02-02 10:45:01,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants.
[2018-02-02 10:45:01,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830
[2018-02-02 10:45:01,088 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 70 states.
[2018-02-02 10:45:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:01,179 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions.
[2018-02-02 10:45:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states.
[2018-02-02 10:45:01,180 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 83
[2018-02-02 10:45:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:01,180 INFO L225 Difference]: With dead ends: 87
[2018-02-02 10:45:01,180 INFO L226 Difference]: Without dead ends: 85
[2018-02-02 10:45:01,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830
[2018-02-02 10:45:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-02-02 10:45:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2018-02-02 10:45:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-02-02 10:45:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions.
[2018-02-02 10:45:01,181 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83
[2018-02-02 10:45:01,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:01,181 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions.
[2018-02-02 10:45:01,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states.
[2018-02-02 10:45:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions.
[2018-02-02 10:45:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-02-02 10:45:01,182 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:01,182 INFO L351 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:01,182 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1864669925, now seen corresponding path program 67 times
[2018-02-02 10:45:01,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:01,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:02,514 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-02 10:45:02,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:02,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71
[2018-02-02 10:45:02,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:02,515 INFO L182 omatonBuilderFactory]: Interpolants [9728#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9730#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9731#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9733#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9734#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9736#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 9739#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9742#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9743#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9746#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9747#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9748#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9749#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9750#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9753#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9754#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 9755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 9756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 9757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 9758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 9759#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 9760#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 9761#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 9762#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 9763#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 9764#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 9765#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 9766#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 9767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 9768#(not (= |#Ultimate.C_memset_#amount| 80)), 9698#true, 9699#false, 9700#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9701#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9702#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9703#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9704#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9705#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9706#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9707#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9708#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9709#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9710#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9711#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9712#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9713#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9714#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9715#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9716#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9717#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9718#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9719#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9720#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9722#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9723#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9724#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9725#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9727#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27))]
[2018-02-02 10:45:02,515 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-02 10:45:02,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states
[2018-02-02 10:45:02,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2018-02-02 10:45:02,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970
[2018-02-02 10:45:02,516 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 71 states.
[2018-02-02 10:45:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:02,585 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions.
[2018-02-02 10:45:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2018-02-02 10:45:02,586 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 84
[2018-02-02 10:45:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:02,586 INFO L225 Difference]: With dead ends: 88
[2018-02-02 10:45:02,586 INFO L226 Difference]: Without dead ends: 86
[2018-02-02 10:45:02,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970
[2018-02-02 10:45:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-02-02 10:45:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2018-02-02 10:45:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states.
[2018-02-02 10:45:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions.
[2018-02-02 10:45:02,588 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84
[2018-02-02 10:45:02,588 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:02,588 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions.
[2018-02-02 10:45:02,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states.
[2018-02-02 10:45:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions.
[2018-02-02 10:45:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2018-02-02 10:45:02,588 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:02,588 INFO L351 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:02,588 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1711867964, now seen corresponding path program 68 times
[2018-02-02 10:45:02,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:02,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:03,926 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-02 10:45:03,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:03,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72
[2018-02-02 10:45:03,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:03,926 INFO L182 omatonBuilderFactory]: Interpolants [9984#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 9985#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 9986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 9987#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 9988#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 9989#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 9990#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 9991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 9992#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 9993#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 9994#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 9995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 9996#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 9997#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 9998#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 9999#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10002#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10003#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10006#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10007#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10009#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10010#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10012#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10013#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10014#(not (= |#Ultimate.C_memset_#amount| 80)), 9943#true, 9944#false, 9945#(= |#Ultimate.C_memset_#t~loopctr5| 0), 9946#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 9947#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 9948#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 9949#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 9950#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 9951#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 9952#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 9953#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 9954#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 9955#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 9956#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 9957#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 9958#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 9959#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 9960#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 9961#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 9962#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 9963#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 9964#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 9965#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 9966#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 9967#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 9968#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 9969#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 9970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 9971#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 9972#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 9973#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 9974#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 9975#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 9976#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 9977#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 9978#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 9979#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 9980#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 9981#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 9982#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 9983#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:03,927 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-02 10:45:03,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states
[2018-02-02 10:45:03,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants.
[2018-02-02 10:45:03,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112
[2018-02-02 10:45:03,927 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 72 states.
[2018-02-02 10:45:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:03,995 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions.
[2018-02-02 10:45:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2018-02-02 10:45:03,999 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 85
[2018-02-02 10:45:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:03,999 INFO L225 Difference]: With dead ends: 89
[2018-02-02 10:45:03,999 INFO L226 Difference]: Without dead ends: 87
[2018-02-02 10:45:04,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112
[2018-02-02 10:45:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2018-02-02 10:45:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2018-02-02 10:45:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-02-02 10:45:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions.
[2018-02-02 10:45:04,001 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85
[2018-02-02 10:45:04,001 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:04,001 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions.
[2018-02-02 10:45:04,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states.
[2018-02-02 10:45:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions.
[2018-02-02 10:45:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-02-02 10:45:04,001 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:04,001 INFO L351 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:04,001 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash 915392827, now seen corresponding path program 69 times
[2018-02-02 10:45:04,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:04,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:05,305 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-02 10:45:05,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:05,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73
[2018-02-02 10:45:05,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:05,306 INFO L182 omatonBuilderFactory]: Interpolants [10240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10241#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10243#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10244#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10245#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10246#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10248#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10249#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10250#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10252#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10253#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10254#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10255#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10256#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10257#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10258#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10259#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10260#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10261#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10262#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10263#(not (= |#Ultimate.C_memset_#amount| 80)), 10191#true, 10192#false, 10193#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10194#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10195#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10196#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10198#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10199#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10200#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10201#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10202#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10203#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10204#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10205#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10206#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10207#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10208#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10209#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10210#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10211#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10212#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10213#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10214#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10215#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10216#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10217#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10218#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10219#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10221#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10222#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10224#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10230#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10231#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10232#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10233#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10235#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10236#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10239#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46))]
[2018-02-02 10:45:05,306 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-02 10:45:05,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states
[2018-02-02 10:45:05,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants.
[2018-02-02 10:45:05,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256
[2018-02-02 10:45:05,306 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 73 states.
[2018-02-02 10:45:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:05,364 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions.
[2018-02-02 10:45:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states.
[2018-02-02 10:45:05,364 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 86
[2018-02-02 10:45:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:05,365 INFO L225 Difference]: With dead ends: 90
[2018-02-02 10:45:05,365 INFO L226 Difference]: Without dead ends: 88
[2018-02-02 10:45:05,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256
[2018-02-02 10:45:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2018-02-02 10:45:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2018-02-02 10:45:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states.
[2018-02-02 10:45:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions.
[2018-02-02 10:45:05,366 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86
[2018-02-02 10:45:05,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:05,366 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions.
[2018-02-02 10:45:05,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states.
[2018-02-02 10:45:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions.
[2018-02-02 10:45:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2018-02-02 10:45:05,367 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:05,367 INFO L351 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:05,367 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1994467356, now seen corresponding path program 70 times
[2018-02-02 10:45:05,367 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:05,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:06,892 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-02 10:45:06,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:06,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74
[2018-02-02 10:45:06,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:06,893 INFO L182 omatonBuilderFactory]: Interpolants [10496#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 10498#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10499#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10500#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10501#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10502#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10503#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10505#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10506#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10507#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10508#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10509#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10510#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10513#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 10515#(not (= |#Ultimate.C_memset_#amount| 80)), 10442#true, 10443#false, 10444#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10445#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10447#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10448#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10449#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10450#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10451#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10452#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10453#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10454#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10455#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10456#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10457#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10458#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10459#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10460#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10461#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10462#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10463#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10464#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10465#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10466#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10467#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10468#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10469#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10470#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10471#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10472#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10473#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10474#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10475#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10476#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10477#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10478#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10479#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10480#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10481#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10482#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10483#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10484#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10485#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10486#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10487#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10488#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10489#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10490#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10491#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10492#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10493#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10494#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51))]
[2018-02-02 10:45:06,893 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-02 10:45:06,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states
[2018-02-02 10:45:06,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants.
[2018-02-02 10:45:06,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402
[2018-02-02 10:45:06,894 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 74 states.
[2018-02-02 10:45:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:06,958 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions.
[2018-02-02 10:45:06,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2018-02-02 10:45:06,958 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 87
[2018-02-02 10:45:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:06,959 INFO L225 Difference]: With dead ends: 91
[2018-02-02 10:45:06,959 INFO L226 Difference]: Without dead ends: 89
[2018-02-02 10:45:06,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402
[2018-02-02 10:45:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2018-02-02 10:45:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2018-02-02 10:45:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-02 10:45:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions.
[2018-02-02 10:45:06,960 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87
[2018-02-02 10:45:06,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:06,961 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions.
[2018-02-02 10:45:06,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states.
[2018-02-02 10:45:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions.
[2018-02-02 10:45:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2018-02-02 10:45:06,961 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:06,961 INFO L351 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:06,961 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1086039387, now seen corresponding path program 71 times
[2018-02-02 10:45:06,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:06,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:08,390 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-02 10:45:08,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:08,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75
[2018-02-02 10:45:08,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:08,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-02 10:45:08,391 INFO L182 omatonBuilderFactory]: Interpolants [10752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 10753#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 10754#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 10755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 10756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 10757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 10758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 10759#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 10760#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 10761#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 10762#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 10763#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 10764#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 10765#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 10766#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 10767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 10768#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 10769#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 10770#(not (= |#Ultimate.C_memset_#amount| 80)), 10696#true, 10697#false, 10698#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10699#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10700#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10701#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10702#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10703#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10704#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10705#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10706#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10707#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10708#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10709#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10710#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10711#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10712#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10713#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10714#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10715#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10716#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10717#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10718#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10719#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10720#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10721#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10722#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10723#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10724#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10725#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10726#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10727#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10728#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10730#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10731#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10732#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10733#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10734#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10736#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10737#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10738#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10739#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10740#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10742#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 10743#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 10744#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 10745#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 10746#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 10747#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 10748#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 10749#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 10750#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 10751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53))]
[2018-02-02 10:45:08,391 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-02 10:45:08,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states
[2018-02-02 10:45:08,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants.
[2018-02-02 10:45:08,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550
[2018-02-02 10:45:08,392 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 75 states.
[2018-02-02 10:45:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:08,449 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions.
[2018-02-02 10:45:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states.
[2018-02-02 10:45:08,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 88
[2018-02-02 10:45:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:08,457 INFO L225 Difference]: With dead ends: 92
[2018-02-02 10:45:08,457 INFO L226 Difference]: Without dead ends: 90
[2018-02-02 10:45:08,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550
[2018-02-02 10:45:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2018-02-02 10:45:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90.
[2018-02-02 10:45:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-02-02 10:45:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions.
[2018-02-02 10:45:08,458 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88
[2018-02-02 10:45:08,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:08,458 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions.
[2018-02-02 10:45:08,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states.
[2018-02-02 10:45:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions.
[2018-02-02 10:45:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2018-02-02 10:45:08,459 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:08,459 INFO L351 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:08,459 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1305423876, now seen corresponding path program 72 times
[2018-02-02 10:45:08,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:08,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:09,863 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-02 10:45:09,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:09,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76
[2018-02-02 10:45:09,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:09,863 INFO L182 omatonBuilderFactory]: Interpolants [11008#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11009#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11010#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11011#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11012#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11013#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11014#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11015#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11016#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11017#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11018#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11019#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11022#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11023#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11024#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11025#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11027#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11028#(not (= |#Ultimate.C_memset_#amount| 80)), 10953#true, 10954#false, 10955#(= |#Ultimate.C_memset_#t~loopctr5| 0), 10956#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 10957#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 10958#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 10959#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 10960#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 10961#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 10962#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 10963#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 10964#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 10965#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 10966#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 10967#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 10968#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 10969#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 10970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 10971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 10972#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 10973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 10974#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 10975#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 10976#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 10977#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 10978#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 10979#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 10980#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 10981#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 10982#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 10983#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 10984#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 10985#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 10986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 10987#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 10988#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 10989#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 10990#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 10991#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 10992#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 10993#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 10994#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 10995#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 10996#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 10997#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 10998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 10999#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11000#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11001#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11002#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11004#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11005#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11006#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11007#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52))]
[2018-02-02 10:45:09,864 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-02 10:45:09,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states
[2018-02-02 10:45:09,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants.
[2018-02-02 10:45:09,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2849, Invalid=2851, Unknown=0, NotChecked=0, Total=5700
[2018-02-02 10:45:09,864 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 76 states.
[2018-02-02 10:45:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:09,916 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions.
[2018-02-02 10:45:09,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2018-02-02 10:45:09,916 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 89
[2018-02-02 10:45:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:09,917 INFO L225 Difference]: With dead ends: 93
[2018-02-02 10:45:09,917 INFO L226 Difference]: Without dead ends: 91
[2018-02-02 10:45:09,917 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-02 10:45:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2018-02-02 10:45:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2018-02-02 10:45:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2018-02-02 10:45:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions.
[2018-02-02 10:45:09,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89
[2018-02-02 10:45:09,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:09,918 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions.
[2018-02-02 10:45:09,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states.
[2018-02-02 10:45:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions.
[2018-02-02 10:45:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2018-02-02 10:45:09,918 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:09,918 INFO L351 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:09,919 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1868626299, now seen corresponding path program 73 times
[2018-02-02 10:45:09,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:09,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:11,403 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-02 10:45:11,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:11,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77
[2018-02-02 10:45:11,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:11,404 INFO L182 omatonBuilderFactory]: Interpolants [11264#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11265#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11266#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11267#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11268#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11269#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11270#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11271#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11272#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11273#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11274#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11275#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11276#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11277#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11278#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11279#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11280#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11281#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11282#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11283#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11284#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11285#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11286#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11287#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11288#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11289#(not (= |#Ultimate.C_memset_#amount| 80)), 11213#true, 11214#false, 11215#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11216#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11217#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11218#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11219#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11220#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11221#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11222#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11223#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11224#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11225#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11226#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11227#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11228#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11229#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11230#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11231#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11232#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11233#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11234#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11236#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11237#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11238#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11241#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11242#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11243#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11247#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11248#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11249#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11251#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11252#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11253#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11254#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11255#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11256#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11257#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11258#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11259#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11260#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11261#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11262#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11263#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:11,404 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-02 10:45:11,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states
[2018-02-02 10:45:11,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants.
[2018-02-02 10:45:11,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852
[2018-02-02 10:45:11,405 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 77 states.
[2018-02-02 10:45:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:11,465 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions.
[2018-02-02 10:45:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-02-02 10:45:11,465 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 90
[2018-02-02 10:45:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:11,466 INFO L225 Difference]: With dead ends: 94
[2018-02-02 10:45:11,466 INFO L226 Difference]: Without dead ends: 92
[2018-02-02 10:45:11,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852
[2018-02-02 10:45:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2018-02-02 10:45:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2018-02-02 10:45:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2018-02-02 10:45:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions.
[2018-02-02 10:45:11,467 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90
[2018-02-02 10:45:11,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:11,468 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions.
[2018-02-02 10:45:11,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states.
[2018-02-02 10:45:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions.
[2018-02-02 10:45:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-02-02 10:45:11,468 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:11,468 INFO L351 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:11,468 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1479933916, now seen corresponding path program 74 times
[2018-02-02 10:45:11,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:11,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:12,912 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-02 10:45:12,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:12,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78
[2018-02-02 10:45:12,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:12,912 INFO L182 omatonBuilderFactory]: Interpolants [11520#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11521#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11522#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11523#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11524#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11525#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11526#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11527#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11528#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11529#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11530#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11531#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11532#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11533#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11534#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11535#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11536#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11537#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11538#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11539#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11540#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11541#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11542#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11543#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11544#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11545#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11547#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11548#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11549#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11550#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11551#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11552#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 11553#(not (= |#Ultimate.C_memset_#amount| 80)), 11476#true, 11477#false, 11478#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11479#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11480#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11481#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11482#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11483#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11484#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11485#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11486#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11487#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11488#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11489#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11490#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11491#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11492#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11493#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11494#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11495#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11496#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11497#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11498#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11499#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11500#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11501#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11502#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11503#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11504#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11505#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11506#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11507#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11508#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11509#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 11510#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11511#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11512#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11513#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11514#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11515#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11516#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11517#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11518#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:12,913 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-02 10:45:12,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states
[2018-02-02 10:45:12,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants.
[2018-02-02 10:45:12,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3002, Invalid=3004, Unknown=0, NotChecked=0, Total=6006
[2018-02-02 10:45:12,913 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 78 states.
[2018-02-02 10:45:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:12,984 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions.
[2018-02-02 10:45:12,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2018-02-02 10:45:12,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 91
[2018-02-02 10:45:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:12,985 INFO L225 Difference]: With dead ends: 95
[2018-02-02 10:45:12,985 INFO L226 Difference]: Without dead ends: 93
[2018-02-02 10:45:12,985 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-02 10:45:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-02 10:45:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2018-02-02 10:45:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-02-02 10:45:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions.
[2018-02-02 10:45:12,986 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91
[2018-02-02 10:45:12,986 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:12,986 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions.
[2018-02-02 10:45:12,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states.
[2018-02-02 10:45:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions.
[2018-02-02 10:45:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2018-02-02 10:45:12,987 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:12,987 INFO L351 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:12,987 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1979595365, now seen corresponding path program 75 times
[2018-02-02 10:45:12,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:13,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:14,526 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-02 10:45:14,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:14,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79
[2018-02-02 10:45:14,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:14,527 INFO L182 omatonBuilderFactory]: Interpolants [11776#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 11777#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 11778#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 11779#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 11780#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 11781#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 11782#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 11783#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 11784#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 11785#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 11786#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 11787#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 11788#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 11789#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 11790#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 11791#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 11792#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 11793#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 11794#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 11795#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 11796#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 11797#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 11798#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 11799#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 11800#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 11801#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 11802#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 11803#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 11804#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 11805#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 11806#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 11807#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 11808#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 11809#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 11810#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 11811#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 11812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 11813#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 11814#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 11815#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 11816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 11817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 11818#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 11819#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 11820#(not (= |#Ultimate.C_memset_#amount| 80)), 11742#true, 11743#false, 11744#(= |#Ultimate.C_memset_#t~loopctr5| 0), 11745#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 11746#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 11747#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 11748#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 11749#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 11750#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 11751#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 11752#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 11753#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 11754#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 11755#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 11756#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 11757#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 11758#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 11759#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 11760#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 11761#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 11762#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 11763#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 11764#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 11765#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 11766#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 11767#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 11768#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 11769#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 11770#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 11771#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 11772#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 11773#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 11774#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 11775#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:14,527 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-02 10:45:14,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states
[2018-02-02 10:45:14,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants.
[2018-02-02 10:45:14,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162
[2018-02-02 10:45:14,528 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 79 states.
[2018-02-02 10:45:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:14,607 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions.
[2018-02-02 10:45:14,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states.
[2018-02-02 10:45:14,607 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 92
[2018-02-02 10:45:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:14,607 INFO L225 Difference]: With dead ends: 96
[2018-02-02 10:45:14,607 INFO L226 Difference]: Without dead ends: 94
[2018-02-02 10:45:14,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162
[2018-02-02 10:45:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2018-02-02 10:45:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2018-02-02 10:45:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states.
[2018-02-02 10:45:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions.
[2018-02-02 10:45:14,609 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92
[2018-02-02 10:45:14,609 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:14,609 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions.
[2018-02-02 10:45:14,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states.
[2018-02-02 10:45:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions.
[2018-02-02 10:45:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-02-02 10:45:14,609 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:14,609 INFO L351 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:14,609 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1850820676, now seen corresponding path program 76 times
[2018-02-02 10:45:14,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:14,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:16,139 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-02 10:45:16,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:16,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80
[2018-02-02 10:45:16,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:16,140 INFO L182 omatonBuilderFactory]: Interpolants [12032#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12033#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12034#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12035#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12036#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12037#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12038#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12039#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12040#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12041#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12042#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12043#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12044#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12045#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12046#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12047#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12048#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12049#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12050#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12051#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12052#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12053#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12054#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12055#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12056#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12057#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12058#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12059#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12062#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12063#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12064#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12065#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12066#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12067#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12068#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12069#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12070#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12071#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12072#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12073#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12075#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12076#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12077#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12078#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12079#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12080#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12082#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12083#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12084#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12085#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12086#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12087#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12088#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12089#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12090#(not (= |#Ultimate.C_memset_#amount| 80)), 12011#true, 12012#false, 12013#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12014#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12015#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 12016#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12017#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12018#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12019#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12020#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12021#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12022#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12023#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12024#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12025#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12026#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12027#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12028#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12029#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12030#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12031#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:16,140 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-02 10:45:16,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states
[2018-02-02 10:45:16,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants.
[2018-02-02 10:45:16,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3159, Invalid=3161, Unknown=0, NotChecked=0, Total=6320
[2018-02-02 10:45:16,141 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 80 states.
[2018-02-02 10:45:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:16,231 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions.
[2018-02-02 10:45:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states.
[2018-02-02 10:45:16,231 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 93
[2018-02-02 10:45:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:16,232 INFO L225 Difference]: With dead ends: 97
[2018-02-02 10:45:16,232 INFO L226 Difference]: Without dead ends: 95
[2018-02-02 10:45:16,232 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-02 10:45:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-02 10:45:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2018-02-02 10:45:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2018-02-02 10:45:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions.
[2018-02-02 10:45:16,233 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93
[2018-02-02 10:45:16,233 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:16,233 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions.
[2018-02-02 10:45:16,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states.
[2018-02-02 10:45:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions.
[2018-02-02 10:45:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-02-02 10:45:16,234 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:16,234 INFO L351 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:16,234 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2141194683, now seen corresponding path program 77 times
[2018-02-02 10:45:16,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:16,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:17,801 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-02 10:45:17,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:17,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81
[2018-02-02 10:45:17,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:17,802 INFO L182 omatonBuilderFactory]: Interpolants [12288#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12289#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12290#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12291#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12292#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12293#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12294#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12295#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12296#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12297#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12298#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12299#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12300#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12301#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12302#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12303#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12304#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12305#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12306#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12307#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12308#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12309#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12310#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12311#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12312#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12313#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12316#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12317#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12318#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12319#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12320#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12321#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12323#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12324#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12325#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12326#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12327#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12329#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12330#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12331#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12332#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12333#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12334#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12335#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12336#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12337#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12338#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12339#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12340#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12341#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12342#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12343#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12344#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12345#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12346#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12347#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12348#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12349#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12350#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12351#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12352#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12353#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12354#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12355#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12356#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12357#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12358#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12359#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12360#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12361#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12362#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12363#(not (= |#Ultimate.C_memset_#amount| 80)), 12283#true, 12284#false, 12285#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12286#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12287#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80)))]
[2018-02-02 10:45:17,802 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-02 10:45:17,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states
[2018-02-02 10:45:17,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants.
[2018-02-02 10:45:17,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480
[2018-02-02 10:45:17,803 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 81 states.
[2018-02-02 10:45:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:17,916 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions.
[2018-02-02 10:45:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states.
[2018-02-02 10:45:17,916 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 94
[2018-02-02 10:45:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:17,917 INFO L225 Difference]: With dead ends: 98
[2018-02-02 10:45:17,917 INFO L226 Difference]: Without dead ends: 96
[2018-02-02 10:45:17,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480
[2018-02-02 10:45:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2018-02-02 10:45:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2018-02-02 10:45:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-02 10:45:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions.
[2018-02-02 10:45:17,918 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94
[2018-02-02 10:45:17,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:17,918 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions.
[2018-02-02 10:45:17,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states.
[2018-02-02 10:45:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions.
[2018-02-02 10:45:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2018-02-02 10:45:17,919 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:17,919 INFO L351 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:17,919 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1339619228, now seen corresponding path program 78 times
[2018-02-02 10:45:17,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:17,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:19,520 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-02 10:45:19,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:19,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82
[2018-02-02 10:45:19,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:19,521 INFO L182 omatonBuilderFactory]: Interpolants [12558#true, 12559#false, 12560#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12561#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12562#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 12563#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12564#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12565#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12566#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12567#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12568#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12569#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12570#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12571#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12572#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12573#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12574#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12575#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12576#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12577#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12578#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12579#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12580#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12581#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12582#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12583#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12584#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12585#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12586#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12587#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12588#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12589#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12590#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12591#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12592#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12593#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12594#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12595#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12596#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12597#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12598#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12599#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12600#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12601#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12602#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12604#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12605#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12606#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12607#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12608#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12609#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12610#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12612#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12613#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12614#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12616#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12617#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12618#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12619#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12620#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12621#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12623#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12624#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12625#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12626#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12627#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12629#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12630#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12631#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12634#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12635#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12636#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12637#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12638#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 78)), 12639#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:45:19,521 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-02 10:45:19,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states
[2018-02-02 10:45:19,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants.
[2018-02-02 10:45:19,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642
[2018-02-02 10:45:19,522 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 82 states.
[2018-02-02 10:45:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:19,630 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions.
[2018-02-02 10:45:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states.
[2018-02-02 10:45:19,631 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 95
[2018-02-02 10:45:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:19,631 INFO L225 Difference]: With dead ends: 99
[2018-02-02 10:45:19,631 INFO L226 Difference]: Without dead ends: 97
[2018-02-02 10:45:19,631 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-02 10:45:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2018-02-02 10:45:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2018-02-02 10:45:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-02-02 10:45:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions.
[2018-02-02 10:45:19,632 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95
[2018-02-02 10:45:19,632 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:19,632 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions.
[2018-02-02 10:45:19,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states.
[2018-02-02 10:45:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions.
[2018-02-02 10:45:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-02-02 10:45:19,633 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:19,633 INFO L351 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:19,633 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2034383397, now seen corresponding path program 79 times
[2018-02-02 10:45:19,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:19,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:21,269 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-02 10:45:21,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:45:21,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83
[2018-02-02 10:45:21,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:45:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:45:21,270 INFO L182 omatonBuilderFactory]: Interpolants [12836#true, 12837#false, 12838#(= |#Ultimate.C_memset_#t~loopctr5| 0), 12839#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 1)), 12840#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 80))), 12841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 80))), 12842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 80))), 12843#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 5)), 12844#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 6)), 12845#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 7)), 12846#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 8)), 12847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 80))), 12848#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 10)), 12849#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 11)), 12850#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 12)), 12851#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 13)), 12852#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 14)), 12853#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 80))), 12854#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 80))), 12855#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 17)), 12856#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 80))), 12857#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 19)), 12858#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 80))), 12859#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 21)), 12860#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 22)), 12861#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 23)), 12862#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 80))), 12863#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 80))), 12864#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 26)), 12865#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 27)), 12866#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 28)), 12867#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 80))), 12868#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 80))), 12869#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 80))), 12870#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 32)), 12871#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 33)), 12872#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 34)), 12873#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 80))), 12874#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 36)), 12875#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 80))), 12876#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 80))), 12877#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 39)), 12878#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 40)), 12879#(or (<= |#Ultimate.C_memset_#t~loopctr5| 41) (not (= |#Ultimate.C_memset_#amount| 80))), 12880#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 42)), 12881#(or (<= |#Ultimate.C_memset_#t~loopctr5| 43) (not (= |#Ultimate.C_memset_#amount| 80))), 12882#(or (<= |#Ultimate.C_memset_#t~loopctr5| 44) (not (= |#Ultimate.C_memset_#amount| 80))), 12883#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 45)), 12884#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 46)), 12885#(or (<= |#Ultimate.C_memset_#t~loopctr5| 47) (not (= |#Ultimate.C_memset_#amount| 80))), 12886#(or (<= |#Ultimate.C_memset_#t~loopctr5| 48) (not (= |#Ultimate.C_memset_#amount| 80))), 12887#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 49)), 12888#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 50)), 12889#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 51)), 12890#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 52)), 12891#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 53)), 12892#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 54)), 12893#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 55)), 12894#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 56)), 12895#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 57)), 12896#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 58)), 12897#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 59)), 12898#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 60)), 12899#(or (<= |#Ultimate.C_memset_#t~loopctr5| 61) (not (= |#Ultimate.C_memset_#amount| 80))), 12900#(or (<= |#Ultimate.C_memset_#t~loopctr5| 62) (not (= |#Ultimate.C_memset_#amount| 80))), 12901#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 63)), 12902#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 64)), 12903#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 65)), 12904#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 66)), 12905#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 67)), 12906#(or (<= |#Ultimate.C_memset_#t~loopctr5| 68) (not (= |#Ultimate.C_memset_#amount| 80))), 12907#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 69)), 12908#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 70)), 12909#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 71)), 12910#(or (<= |#Ultimate.C_memset_#t~loopctr5| 72) (not (= |#Ultimate.C_memset_#amount| 80))), 12911#(or (<= |#Ultimate.C_memset_#t~loopctr5| 73) (not (= |#Ultimate.C_memset_#amount| 80))), 12912#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 74)), 12913#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 75)), 12914#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 76)), 12915#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 77)), 12916#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 78)), 12917#(or (not (= |#Ultimate.C_memset_#amount| 80)) (<= |#Ultimate.C_memset_#t~loopctr5| 79)), 12918#(not (= |#Ultimate.C_memset_#amount| 80))]
[2018-02-02 10:45:21,270 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-02 10:45:21,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states
[2018-02-02 10:45:21,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants.
[2018-02-02 10:45:21,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806
[2018-02-02 10:45:21,271 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 83 states.
[2018-02-02 10:45:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:45:21,393 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions.
[2018-02-02 10:45:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states.
[2018-02-02 10:45:21,394 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 96
[2018-02-02 10:45:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:45:21,394 INFO L225 Difference]: With dead ends: 100
[2018-02-02 10:45:21,394 INFO L226 Difference]: Without dead ends: 98
[2018-02-02 10:45:21,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806
[2018-02-02 10:45:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2018-02-02 10:45:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2018-02-02 10:45:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2018-02-02 10:45:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions.
[2018-02-02 10:45:21,396 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96
[2018-02-02 10:45:21,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:45:21,396 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions.
[2018-02-02 10:45:21,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states.
[2018-02-02 10:45:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions.
[2018-02-02 10:45:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-02-02 10:45:21,396 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:45:21,396 INFO L351 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:45:21,396 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-02 10:45:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 745717628, now seen corresponding path program 80 times
[2018-02-02 10:45:21,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:45:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:45:21,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:45:21,425 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.UnsupportedOperationException: Unknown lemma type!
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201)
at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.<init>(NestedInterpolantsBuilder.java:164)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:106)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:68)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:115)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2018-02-02 10:45:21,430 INFO L168 Benchmark]: Toolchain (without parser) took 56791.34 ms. Allocated memory was 394.3 MB in the beginning and 1.4 GB in the end (delta: 985.1 MB). Free memory was 352.2 MB in the beginning and 571.1 MB in the end (delta: -218.9 MB). Peak memory consumption was 766.2 MB. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,431 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.64 ms. Allocated memory is still 394.3 MB. Free memory was 352.2 MB in the beginning and 344.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,432 INFO L168 Benchmark]: Boogie Preprocessor took 23.03 ms. Allocated memory is still 394.3 MB. Free memory was 344.2 MB in the beginning and 342.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,432 INFO L168 Benchmark]: RCFGBuilder took 140.74 ms. Allocated memory is still 394.3 MB. Free memory was 342.9 MB in the beginning and 328.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,432 INFO L168 Benchmark]: TraceAbstraction took 56497.99 ms. Allocated memory was 394.3 MB in the beginning and 1.4 GB in the end (delta: 985.1 MB). Free memory was 328.3 MB in the beginning and 571.1 MB in the end (delta: -242.8 MB). Peak memory consumption was 742.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:45:21,433 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.15 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 126.64 ms. Allocated memory is still 394.3 MB. Free memory was 352.2 MB in the beginning and 344.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 23.03 ms. Allocated memory is still 394.3 MB. Free memory was 344.2 MB in the beginning and 342.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 140.74 ms. Allocated memory is still 394.3 MB. Free memory was 342.9 MB in the beginning and 328.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 56497.99 ms. Allocated memory was 394.3 MB in the beginning and 1.4 GB in the end (delta: 985.1 MB). Free memory was 328.3 MB in the beginning and 571.1 MB in the end (delta: -242.8 MB). Peak memory consumption was 742.3 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type!
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset3_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-45-21-440.csv
Received shutdown request...