java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-04 04:15:21,238 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-04 04:15:21,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-04 04:15:21,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-04 04:15:21,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-04 04:15:21,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-04 04:15:21,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-04 04:15:21,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-04 04:15:21,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-04 04:15:21,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-04 04:15:21,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-04 04:15:21,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-04 04:15:21,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-04 04:15:21,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-04 04:15:21,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-04 04:15:21,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-04 04:15:21,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-04 04:15:21,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-04 04:15:21,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-04 04:15:21,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-04 04:15:21,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-04 04:15:21,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-04 04:15:21,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-04 04:15:21,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-04 04:15:21,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-04 04:15:21,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-04 04:15:21,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-04 04:15:21,275 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-04 04:15:21,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-04 04:15:21,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-04 04:15:21,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-04 04:15:21,276 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf
[2018-02-04 04:15:21,286 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-04 04:15:21,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-04 04:15:21,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-04 04:15:21,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-04 04:15:21,287 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-04 04:15:21,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-04 04:15:21,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-04 04:15:21,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 04:15:21,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-04 04:15:21,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-04 04:15:21,290 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL
[2018-02-04 04:15:21,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-04 04:15:21,330 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-04 04:15:21,335 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-04 04:15:21,336 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-04 04:15:21,336 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-04 04:15:21,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i
[2018-02-04 04:15:21,514 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-04 04:15:21,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-04 04:15:21,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-04 04:15:21,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-04 04:15:21,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-04 04:15:21,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21, skipping insertion in model container
[2018-02-04 04:15:21,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,541 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 04:15:21,578 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 04:15:21,673 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 04:15:21,688 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 04:15:21,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21 WrapperNode
[2018-02-04 04:15:21,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-04 04:15:21,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-04 04:15:21,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-04 04:15:21,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-04 04:15:21,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
[2018-02-04 04:15:21,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-04 04:15:21,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-04 04:15:21,728 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-04 04:15:21,728 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-04 04:15:21,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 04:15:21,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-04 04:15:21,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-04 04:15:21,766 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-04 04:15:21,766 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17
[2018-02-04 04:15:21,766 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-04 04:15:21,766 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-04 04:15:21,766 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-04 04:15:21,766 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-04 04:15:21,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-04 04:15:21,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-04 04:15:21,767 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-04 04:15:21,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-04 04:15:21,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-04 04:15:21,981 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-04 04:15:21,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:21 BoogieIcfgContainer
[2018-02-04 04:15:21,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-04 04:15:21,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-04 04:15:21,983 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-04 04:15:21,984 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-04 04:15:21,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:15:21" (1/3) ...
[2018-02-04 04:15:21,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ff696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:21, skipping insertion in model container
[2018-02-04 04:15:21,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:21" (2/3) ...
[2018-02-04 04:15:21,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ff696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:21, skipping insertion in model container
[2018-02-04 04:15:21,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:21" (3/3) ...
[2018-02-04 04:15:21,987 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i
[2018-02-04 04:15:21,993 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-04 04:15:21,998 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations.
[2018-02-04 04:15:22,030 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-04 04:15:22,030 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-04 04:15:22,031 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-04 04:15:22,031 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-04 04:15:22,031 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-04 04:15:22,031 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-04 04:15:22,031 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-04 04:15:22,031 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-04 04:15:22,032 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-04 04:15:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states.
[2018-02-04 04:15:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-04 04:15:22,050 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:22,051 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:22,052 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times
[2018-02-04 04:15:22,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:22,059 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:22,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:22,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:22,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:22,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:22,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 04:15:22,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 04:15:22,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 04:15:22,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 04:15:22,219 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states.
[2018-02-04 04:15:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:22,402 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions.
[2018-02-04 04:15:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 04:15:22,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-02-04 04:15:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:22,415 INFO L225 Difference]: With dead ends: 102
[2018-02-04 04:15:22,415 INFO L226 Difference]: Without dead ends: 96
[2018-02-04 04:15:22,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 04:15:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2018-02-04 04:15:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63.
[2018-02-04 04:15:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-02-04 04:15:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions.
[2018-02-04 04:15:22,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17
[2018-02-04 04:15:22,452 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:22,452 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions.
[2018-02-04 04:15:22,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 04:15:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions.
[2018-02-04 04:15:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-04 04:15:22,453 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:22,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:22,453 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times
[2018-02-04 04:15:22,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:22,453 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:22,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:22,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:22,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:22,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:22,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 04:15:22,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 04:15:22,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 04:15:22,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:15:22,521 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states.
[2018-02-04 04:15:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:22,537 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions.
[2018-02-04 04:15:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 04:15:22,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-02-04 04:15:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:22,538 INFO L225 Difference]: With dead ends: 65
[2018-02-04 04:15:22,539 INFO L226 Difference]: Without dead ends: 63
[2018-02-04 04:15:22,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:15:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-02-04 04:15:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61.
[2018-02-04 04:15:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-02-04 04:15:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions.
[2018-02-04 04:15:22,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17
[2018-02-04 04:15:22,545 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:22,545 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions.
[2018-02-04 04:15:22,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 04:15:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions.
[2018-02-04 04:15:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-04 04:15:22,546 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:22,546 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:22,546 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times
[2018-02-04 04:15:22,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:22,547 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:22,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:22,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:22,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:22,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:22,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 04:15:22,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 04:15:22,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 04:15:22,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 04:15:22,597 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states.
[2018-02-04 04:15:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:22,626 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions.
[2018-02-04 04:15:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 04:15:22,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-04 04:15:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:22,627 INFO L225 Difference]: With dead ends: 61
[2018-02-04 04:15:22,627 INFO L226 Difference]: Without dead ends: 61
[2018-02-04 04:15:22,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:15:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2018-02-04 04:15:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2018-02-04 04:15:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-02-04 04:15:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions.
[2018-02-04 04:15:22,631 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19
[2018-02-04 04:15:22,631 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:22,631 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions.
[2018-02-04 04:15:22,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 04:15:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions.
[2018-02-04 04:15:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-04 04:15:22,632 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:22,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:22,632 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times
[2018-02-04 04:15:22,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:22,632 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:22,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:22,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:22,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:22,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:22,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 04:15:22,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 04:15:22,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 04:15:22,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 04:15:22,678 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states.
[2018-02-04 04:15:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:22,758 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions.
[2018-02-04 04:15:22,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 04:15:22,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-04 04:15:22,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:22,760 INFO L225 Difference]: With dead ends: 60
[2018-02-04 04:15:22,760 INFO L226 Difference]: Without dead ends: 60
[2018-02-04 04:15:22,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:15:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-02-04 04:15:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2018-02-04 04:15:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-04 04:15:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions.
[2018-02-04 04:15:22,764 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19
[2018-02-04 04:15:22,764 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:22,764 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions.
[2018-02-04 04:15:22,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 04:15:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions.
[2018-02-04 04:15:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-04 04:15:22,764 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:22,764 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:22,764 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times
[2018-02-04 04:15:22,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:22,765 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:22,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:22,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:22,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:23,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:23,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-04 04:15:23,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-04 04:15:23,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-04 04:15:23,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-02-04 04:15:23,003 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states.
[2018-02-04 04:15:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:23,192 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions.
[2018-02-04 04:15:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-04 04:15:23,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2018-02-04 04:15:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:23,193 INFO L225 Difference]: With dead ends: 64
[2018-02-04 04:15:23,193 INFO L226 Difference]: Without dead ends: 64
[2018-02-04 04:15:23,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-02-04 04:15:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-04 04:15:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63.
[2018-02-04 04:15:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-02-04 04:15:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions.
[2018-02-04 04:15:23,197 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19
[2018-02-04 04:15:23,197 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:23,198 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions.
[2018-02-04 04:15:23,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-04 04:15:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions.
[2018-02-04 04:15:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-04 04:15:23,198 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:23,198 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:23,198 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:23,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times
[2018-02-04 04:15:23,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:23,199 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:23,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:23,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:23,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:23,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:23,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:23,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:23,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:23,439 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:23,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19
[2018-02-04 04:15:23,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:23,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16
[2018-02-04 04:15:23,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:23,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:15:23,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36
[2018-02-04 04:15:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:23,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:23,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2018-02-04 04:15:23,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-04 04:15:23,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-04 04:15:23,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342
[2018-02-04 04:15:23,804 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 19 states.
[2018-02-04 04:15:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:24,246 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions.
[2018-02-04 04:15:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-04 04:15:24,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23
[2018-02-04 04:15:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:24,247 INFO L225 Difference]: With dead ends: 68
[2018-02-04 04:15:24,248 INFO L226 Difference]: Without dead ends: 68
[2018-02-04 04:15:24,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600
[2018-02-04 04:15:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-02-04 04:15:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67.
[2018-02-04 04:15:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-02-04 04:15:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions.
[2018-02-04 04:15:24,251 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23
[2018-02-04 04:15:24,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:24,251 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions.
[2018-02-04 04:15:24,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-04 04:15:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions.
[2018-02-04 04:15:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-04 04:15:24,251 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:24,251 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:24,253 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times
[2018-02-04 04:15:24,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:24,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:24,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:24,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:24,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:24,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:24,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:24,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:24,461 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-04 04:15:24,479 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-04 04:15:24,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:15:24,482 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:24,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16
[2018-02-04 04:15:24,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19
[2018-02-04 04:15:24,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:24,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:15:24,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36
[2018-02-04 04:15:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:24,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:24,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22
[2018-02-04 04:15:24,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-04 04:15:24,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-04 04:15:24,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506
[2018-02-04 04:15:24,691 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 23 states.
[2018-02-04 04:15:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:24,906 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions.
[2018-02-04 04:15:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 04:15:24,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27
[2018-02-04 04:15:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:24,907 INFO L225 Difference]: With dead ends: 67
[2018-02-04 04:15:24,907 INFO L226 Difference]: Without dead ends: 67
[2018-02-04 04:15:24,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702
[2018-02-04 04:15:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-04 04:15:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65.
[2018-02-04 04:15:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2018-02-04 04:15:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions.
[2018-02-04 04:15:24,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 27
[2018-02-04 04:15:24,910 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:24,910 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions.
[2018-02-04 04:15:24,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-04 04:15:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions.
[2018-02-04 04:15:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-04 04:15:24,911 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:24,911 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:24,911 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737492, now seen corresponding path program 1 times
[2018-02-04 04:15:24,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:24,911 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:24,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:24,912 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:15:24,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:24,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-04 04:15:24,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:24,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 04:15:24,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 04:15:24,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 04:15:24,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 04:15:24,941 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 4 states.
[2018-02-04 04:15:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:24,995 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions.
[2018-02-04 04:15:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 04:15:24,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35
[2018-02-04 04:15:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:24,997 INFO L225 Difference]: With dead ends: 90
[2018-02-04 04:15:24,997 INFO L226 Difference]: Without dead ends: 90
[2018-02-04 04:15:24,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 04:15:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2018-02-04 04:15:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81.
[2018-02-04 04:15:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-04 04:15:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions.
[2018-02-04 04:15:25,002 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 35
[2018-02-04 04:15:25,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,002 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions.
[2018-02-04 04:15:25,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 04:15:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions.
[2018-02-04 04:15:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-04 04:15:25,003 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,003 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,004 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737491, now seen corresponding path program 1 times
[2018-02-04 04:15:25,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-02-04 04:15:25,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:25,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 04:15:25,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 04:15:25,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 04:15:25,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 04:15:25,044 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 6 states.
[2018-02-04 04:15:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,062 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions.
[2018-02-04 04:15:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-04 04:15:25,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35
[2018-02-04 04:15:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,064 INFO L225 Difference]: With dead ends: 80
[2018-02-04 04:15:25,064 INFO L226 Difference]: Without dead ends: 80
[2018-02-04 04:15:25,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:15:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2018-02-04 04:15:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2018-02-04 04:15:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-02-04 04:15:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions.
[2018-02-04 04:15:25,068 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 35
[2018-02-04 04:15:25,068 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,068 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions.
[2018-02-04 04:15:25,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 04:15:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions.
[2018-02-04 04:15:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-04 04:15:25,069 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,069 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,069 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1277044790, now seen corresponding path program 1 times
[2018-02-04 04:15:25,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,071 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-04 04:15:25,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:15:25,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 04:15:25,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 04:15:25,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 04:15:25,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:15:25,111 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 5 states.
[2018-02-04 04:15:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,123 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions.
[2018-02-04 04:15:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 04:15:25,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38
[2018-02-04 04:15:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,125 INFO L225 Difference]: With dead ends: 84
[2018-02-04 04:15:25,125 INFO L226 Difference]: Without dead ends: 84
[2018-02-04 04:15:25,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:15:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-04 04:15:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80.
[2018-02-04 04:15:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-02-04 04:15:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions.
[2018-02-04 04:15:25,129 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 38
[2018-02-04 04:15:25,130 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,130 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions.
[2018-02-04 04:15:25,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 04:15:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions.
[2018-02-04 04:15:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-04 04:15:25,131 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,131 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,131 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 1 times
[2018-02-04 04:15:25,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,131 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:25,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:25,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:25,173 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,186 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:25,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:25,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2018-02-04 04:15:25,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-04 04:15:25,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-04 04:15:25,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-04 04:15:25,214 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 9 states.
[2018-02-04 04:15:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,251 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions.
[2018-02-04 04:15:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 04:15:25,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38
[2018-02-04 04:15:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,253 INFO L225 Difference]: With dead ends: 86
[2018-02-04 04:15:25,253 INFO L226 Difference]: Without dead ends: 86
[2018-02-04 04:15:25,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-04 04:15:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-02-04 04:15:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84.
[2018-02-04 04:15:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-04 04:15:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions.
[2018-02-04 04:15:25,256 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38
[2018-02-04 04:15:25,257 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,257 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions.
[2018-02-04 04:15:25,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-04 04:15:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions.
[2018-02-04 04:15:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-04 04:15:25,258 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,258 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,258 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 2 times
[2018-02-04 04:15:25,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,259 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:25,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:25,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:25,307 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-04 04:15:25,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2018-02-04 04:15:25,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,319 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-04 04:15:25,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-04 04:15:25,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9
[2018-02-04 04:15:25,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-04 04:15:25,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-04 04:15:25,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2018-02-04 04:15:25,357 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 9 states.
[2018-02-04 04:15:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,437 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions.
[2018-02-04 04:15:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-04 04:15:25,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42
[2018-02-04 04:15:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,438 INFO L225 Difference]: With dead ends: 115
[2018-02-04 04:15:25,438 INFO L226 Difference]: Without dead ends: 112
[2018-02-04 04:15:25,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2018-02-04 04:15:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2018-02-04 04:15:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87.
[2018-02-04 04:15:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-02-04 04:15:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions.
[2018-02-04 04:15:25,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42
[2018-02-04 04:15:25,443 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,443 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions.
[2018-02-04 04:15:25,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-04 04:15:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions.
[2018-02-04 04:15:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-04 04:15:25,444 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,444 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,444 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1262891178, now seen corresponding path program 1 times
[2018-02-04 04:15:25,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,445 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,446 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:15:25,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:15:25,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:25,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:25,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,512 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:25,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:25,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13
[2018-02-04 04:15:25,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-04 04:15:25,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-04 04:15:25,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2018-02-04 04:15:25,557 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states.
[2018-02-04 04:15:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,594 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions.
[2018-02-04 04:15:25,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-04 04:15:25,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2018-02-04 04:15:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,596 INFO L225 Difference]: With dead ends: 93
[2018-02-04 04:15:25,596 INFO L226 Difference]: Without dead ends: 93
[2018-02-04 04:15:25,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2018-02-04 04:15:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-04 04:15:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91.
[2018-02-04 04:15:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2018-02-04 04:15:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions.
[2018-02-04 04:15:25,600 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 48
[2018-02-04 04:15:25,600 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,600 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions.
[2018-02-04 04:15:25,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-04 04:15:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions.
[2018-02-04 04:15:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-02-04 04:15:25,601 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,601 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,601 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2016472243, now seen corresponding path program 2 times
[2018-02-04 04:15:25,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,602 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:15:25,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:15:25,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:25,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:25,660 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-04 04:15:25,675 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-04 04:15:25,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,677 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:15:25,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:25,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15
[2018-02-04 04:15:25,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-04 04:15:25,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-04 04:15:25,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210
[2018-02-04 04:15:25,737 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 15 states.
[2018-02-04 04:15:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:15:25,781 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions.
[2018-02-04 04:15:25,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-04 04:15:25,782 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52
[2018-02-04 04:15:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:15:25,782 INFO L225 Difference]: With dead ends: 97
[2018-02-04 04:15:25,783 INFO L226 Difference]: Without dead ends: 97
[2018-02-04 04:15:25,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210
[2018-02-04 04:15:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2018-02-04 04:15:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95.
[2018-02-04 04:15:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2018-02-04 04:15:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions.
[2018-02-04 04:15:25,786 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 52
[2018-02-04 04:15:25,786 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:15:25,786 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions.
[2018-02-04 04:15:25,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-04 04:15:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions.
[2018-02-04 04:15:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-04 04:15:25,787 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:15:25,787 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:15:25,787 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:15:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2044492860, now seen corresponding path program 3 times
[2018-02-04 04:15:25,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:15:25,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:15:25,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,789 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:15:25,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:15:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:15:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:15:25,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:15:25,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:15:25,857 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-04 04:15:25,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2018-02-04 04:15:25,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:15:25,878 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:15:25,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2018-02-04 04:15:25,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:25,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-02-04 04:15:25,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:25,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-02-04 04:15:25,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:25,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2018-02-04 04:15:25,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:25,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:15:25,942 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46
[2018-02-04 04:15:26,077 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,077 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29
[2018-02-04 04:15:26,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:26,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28
[2018-02-04 04:15:26,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:26,121 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,122 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50
[2018-02-04 04:15:26,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:26,190 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,191 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:15:26,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30
[2018-02-04 04:15:26,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-04 04:15:26,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-02-04 04:15:26,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55
[2018-02-04 04:15:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-02-04 04:15:26,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:15:26,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21
[2018-02-04 04:15:26,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-04 04:15:26,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-04 04:15:26,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420
[2018-02-04 04:15:26,265 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 21 states.
[2018-02-04 04:15:47,813 WARN L143 SmtUtils]: Spent 14196ms on a formula simplification that was a NOOP. DAG size: 52
[2018-02-04 04:16:12,351 WARN L146 SmtUtils]: Spent 24486ms on a formula simplification. DAG size of input: 56 DAG size of output 56
[2018-02-04 04:16:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:16:12,683 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions.
[2018-02-04 04:16:12,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-04 04:16:12,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56
[2018-02-04 04:16:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:16:12,685 INFO L225 Difference]: With dead ends: 162
[2018-02-04 04:16:12,685 INFO L226 Difference]: Without dead ends: 162
[2018-02-04 04:16:12,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482
[2018-02-04 04:16:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-02-04 04:16:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114.
[2018-02-04 04:16:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-04 04:16:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions.
[2018-02-04 04:16:12,691 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 56
[2018-02-04 04:16:12,691 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:16:12,691 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions.
[2018-02-04 04:16:12,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-04 04:16:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions.
[2018-02-04 04:16:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-02-04 04:16:12,692 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:16:12,692 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:16:12,692 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:16:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1800200380, now seen corresponding path program 1 times
[2018-02-04 04:16:12,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:16:12,693 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:16:12,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:12,694 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:16:12,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:12,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:16:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:16:12,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:16:12,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:16:12,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:16:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:12,808 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:16:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:16:12,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:16:12,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19
[2018-02-04 04:16:12,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-04 04:16:12,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-04 04:16:12,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342
[2018-02-04 04:16:12,914 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 19 states.
[2018-02-04 04:16:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:16:12,975 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions.
[2018-02-04 04:16:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-04 04:16:12,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60
[2018-02-04 04:16:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:16:12,976 INFO L225 Difference]: With dead ends: 120
[2018-02-04 04:16:12,976 INFO L226 Difference]: Without dead ends: 120
[2018-02-04 04:16:12,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342
[2018-02-04 04:16:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-02-04 04:16:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118.
[2018-02-04 04:16:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2018-02-04 04:16:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions.
[2018-02-04 04:16:12,981 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 60
[2018-02-04 04:16:12,981 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:16:12,981 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions.
[2018-02-04 04:16:12,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-04 04:16:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions.
[2018-02-04 04:16:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-04 04:16:12,981 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:16:12,981 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:16:12,981 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:16:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1308562893, now seen corresponding path program 2 times
[2018-02-04 04:16:12,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:16:12,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:16:12,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:12,982 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:16:12,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:12,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:16:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:16:13,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:16:13,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:16:13,076 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-04 04:16:13,092 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-04 04:16:13,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:16:13,095 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:16:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:16:13,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:16:13,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21
[2018-02-04 04:16:13,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-04 04:16:13,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-04 04:16:13,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420
[2018-02-04 04:16:13,190 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 21 states.
[2018-02-04 04:16:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:16:13,260 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions.
[2018-02-04 04:16:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-04 04:16:13,261 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64
[2018-02-04 04:16:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:16:13,262 INFO L225 Difference]: With dead ends: 124
[2018-02-04 04:16:13,262 INFO L226 Difference]: Without dead ends: 124
[2018-02-04 04:16:13,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420
[2018-02-04 04:16:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-02-04 04:16:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122.
[2018-02-04 04:16:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2018-02-04 04:16:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions.
[2018-02-04 04:16:13,265 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 64
[2018-02-04 04:16:13,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:16:13,265 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions.
[2018-02-04 04:16:13,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-04 04:16:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions.
[2018-02-04 04:16:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-02-04 04:16:13,266 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:16:13,266 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:16:13,266 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:16:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash -68509738, now seen corresponding path program 3 times
[2018-02-04 04:16:13,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:16:13,267 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:16:13,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:13,267 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:16:13,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:13,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:16:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-04 04:16:13,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:16:13,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:16:13,368 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-04 04:16:13,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2018-02-04 04:16:13,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-04 04:16:13,391 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:16:13,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-04 04:16:13,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:16:13,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:16:13,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-04 04:16:13,482 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:16:13,482 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-04 04:16:13,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-02-04 04:16:13,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-04 04:16:13,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-04 04:16:13,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-02-04 04:16:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked.
[2018-02-04 04:16:13,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:16:13,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22
[2018-02-04 04:16:13,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-04 04:16:13,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-04 04:16:13,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462
[2018-02-04 04:16:13,515 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 22 states.
[2018-02-04 04:16:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:16:14,169 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions.
[2018-02-04 04:16:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-04 04:16:14,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68
[2018-02-04 04:16:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:16:14,170 INFO L225 Difference]: With dead ends: 159
[2018-02-04 04:16:14,170 INFO L226 Difference]: Without dead ends: 159
[2018-02-04 04:16:14,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722
[2018-02-04 04:16:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2018-02-04 04:16:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109.
[2018-02-04 04:16:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-02-04 04:16:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions.
[2018-02-04 04:16:14,173 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 68
[2018-02-04 04:16:14,174 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:16:14,174 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions.
[2018-02-04 04:16:14,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-04 04:16:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions.
[2018-02-04 04:16:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-04 04:16:14,174 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:16:14,174 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:16:14,174 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:16:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times
[2018-02-04 04:16:14,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:16:14,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:16:14,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:14,175 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-04 04:16:14,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:14,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:16:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked.
[2018-02-04 04:16:14,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:16:14,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 04:16:14,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 04:16:14,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 04:16:14,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 04:16:14,200 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states.
[2018-02-04 04:16:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:16:14,216 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions.
[2018-02-04 04:16:14,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 04:16:14,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73
[2018-02-04 04:16:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:16:14,217 INFO L225 Difference]: With dead ends: 120
[2018-02-04 04:16:14,217 INFO L226 Difference]: Without dead ends: 120
[2018-02-04 04:16:14,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:16:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-02-04 04:16:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114.
[2018-02-04 04:16:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-04 04:16:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions.
[2018-02-04 04:16:14,219 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73
[2018-02-04 04:16:14,220 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:16:14,220 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions.
[2018-02-04 04:16:14,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 04:16:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions.
[2018-02-04 04:16:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-02-04 04:16:14,220 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:16:14,220 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:16:14,220 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-04 04:16:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times
[2018-02-04 04:16:14,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:16:14,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:16:14,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:14,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:16:14,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:16:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:16:14,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:16:14,238 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.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222)
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-04 04:16:14,242 INFO L168 Benchmark]: Toolchain (without parser) took 52727.30 ms. Allocated memory was 405.8 MB in the beginning and 749.2 MB in the end (delta: 343.4 MB). Free memory was 362.7 MB in the beginning and 587.0 MB in the end (delta: -224.3 MB). Peak memory consumption was 119.1 MB. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,243 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.88 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 349.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,243 INFO L168 Benchmark]: Boogie Preprocessor took 34.34 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,244 INFO L168 Benchmark]: RCFGBuilder took 254.16 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 326.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,244 INFO L168 Benchmark]: TraceAbstraction took 52258.65 ms. Allocated memory was 405.8 MB in the beginning and 749.2 MB in the end (delta: 343.4 MB). Free memory was 326.0 MB in the beginning and 587.0 MB in the end (delta: -261.0 MB). Peak memory consumption was 82.4 MB. Max. memory is 5.3 GB.
[2018-02-04 04:16:14,245 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.16 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 176.88 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 349.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 34.34 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 254.16 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 326.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 52258.65 ms. Allocated memory was 405.8 MB in the beginning and 749.2 MB in the end (delta: 343.4 MB). Free memory was 326.0 MB in the beginning and 587.0 MB in the end (delta: -261.0 MB). Peak memory consumption was 82.4 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/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-16-14-252.csv
Received shutdown request...