java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_12.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 22:57:10,492 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 22:57:10,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 22:57:10,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 22:57:10,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 22:57:10,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 22:57:10,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 22:57:10,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 22:57:10,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 22:57:10,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 22:57:10,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 22:57:10,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 22:57:10,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 22:57:10,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 22:57:10,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 22:57:10,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 22:57:10,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 22:57:10,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 22:57:10,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 22:57:10,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 22:57:10,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 22:57:10,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 22:57:10,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 22:57:10,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 22:57:10,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 22:57:10,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 22:57:10,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 22:57:10,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 22:57:10,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 22:57:10,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 22:57:10,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 22:57:10,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 22:57:10,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 22:57:10,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 22:57:10,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 22:57:10,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 22:57:10,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 22:57:10,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 22:57:10,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 22:57:10,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 22:57:10,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 22:57:10,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 22:57:10,570 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 22:57:10,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 22:57:10,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 22:57:10,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 22:57:10,572 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 22:57:10,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 22:57:10,573 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 22:57:10,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 22:57:10,573 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 22:57:10,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 22:57:10,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 22:57:10,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 22:57:10,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 22:57:10,574 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 22:57:10,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 22:57:10,574 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 22:57:10,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 22:57:10,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 22:57:10,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 22:57:10,575 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 22:57:10,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 22:57:10,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 22:57:10,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 22:57:10,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 22:57:10,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 22:57:10,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 22:57:10,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 22:57:10,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 22:57:10,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK
[2019-10-13 22:57:10,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 22:57:10,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 22:57:10,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 22:57:10,884 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 22:57:10,885 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 22:57:10,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c
[2019-10-13 22:57:10,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe6d1e70/add27939a530403caeddd894f10c590c/FLAG03c990132
[2019-10-13 22:57:11,469 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 22:57:11,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c
[2019-10-13 22:57:11,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe6d1e70/add27939a530403caeddd894f10c590c/FLAG03c990132
[2019-10-13 22:57:11,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe6d1e70/add27939a530403caeddd894f10c590c
[2019-10-13 22:57:11,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 22:57:11,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 22:57:11,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 22:57:11,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 22:57:11,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 22:57:11,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:11" (1/1) ...
[2019-10-13 22:57:11,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43009ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:11, skipping insertion in model container
[2019-10-13 22:57:11,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:11" (1/1) ...
[2019-10-13 22:57:11,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 22:57:11,866 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 22:57:12,051 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:57:12,056 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 22:57:12,084 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:57:12,179 INFO L192 MainTranslator]: Completed translation
[2019-10-13 22:57:12,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12 WrapperNode
[2019-10-13 22:57:12,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 22:57:12,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 22:57:12,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 22:57:12,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 22:57:12,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
[2019-10-13 22:57:12,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 22:57:12,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 22:57:12,218 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 22:57:12,218 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 22:57:12,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ...
No working directory specified, using /storage/repos/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
[2019-10-13 22:57:12,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 22:57:12,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 22:57:12,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 22:57:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 22:57:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 22:57:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 22:57:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 22:57:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 22:57:12,955 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 22:57:12,956 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 22:57:12,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:12 BoogieIcfgContainer
[2019-10-13 22:57:12,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 22:57:12,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 22:57:12,960 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 22:57:12,964 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 22:57:12,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:11" (1/3) ...
[2019-10-13 22:57:12,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29566d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:12, skipping insertion in model container
[2019-10-13 22:57:12,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (2/3) ...
[2019-10-13 22:57:12,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29566d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:12, skipping insertion in model container
[2019-10-13 22:57:12,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:12" (3/3) ...
[2019-10-13 22:57:12,968 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c
[2019-10-13 22:57:12,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 22:57:12,988 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 22:57:13,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 22:57:13,026 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 22:57:13,026 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 22:57:13,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 22:57:13,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 22:57:13,027 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 22:57:13,027 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 22:57:13,027 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 22:57:13,027 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 22:57:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states.
[2019-10-13 22:57:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 22:57:13,054 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1011430877, now seen corresponding path program 1 times
[2019-10-13 22:57:13,070 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130436834]
[2019-10-13 22:57:13,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130436834]
[2019-10-13 22:57:13,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766232431]
[2019-10-13 22:57:13,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,279 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states.
[2019-10-13 22:57:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,338 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions.
[2019-10-13 22:57:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2019-10-13 22:57:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,353 INFO L225 Difference]: With dead ends: 74
[2019-10-13 22:57:13,353 INFO L226 Difference]: Without dead ends: 59
[2019-10-13 22:57:13,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2019-10-13 22:57:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33.
[2019-10-13 22:57:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions.
[2019-10-13 22:57:13,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10
[2019-10-13 22:57:13,401 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,401 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions.
[2019-10-13 22:57:13,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions.
[2019-10-13 22:57:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-10-13 22:57:13,402 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1289373383, now seen corresponding path program 1 times
[2019-10-13 22:57:13,404 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173640698]
[2019-10-13 22:57:13,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173640698]
[2019-10-13 22:57:13,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254451720]
[2019-10-13 22:57:13,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,478 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 4 states.
[2019-10-13 22:57:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,507 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions.
[2019-10-13 22:57:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2019-10-13 22:57:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,510 INFO L225 Difference]: With dead ends: 59
[2019-10-13 22:57:13,510 INFO L226 Difference]: Without dead ends: 57
[2019-10-13 22:57:13,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2019-10-13 22:57:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33.
[2019-10-13 22:57:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions.
[2019-10-13 22:57:13,519 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11
[2019-10-13 22:57:13,519 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,519 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions.
[2019-10-13 22:57:13,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions.
[2019-10-13 22:57:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-10-13 22:57:13,521 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,521 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1315656136, now seen corresponding path program 1 times
[2019-10-13 22:57:13,522 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737461025]
[2019-10-13 22:57:13,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737461025]
[2019-10-13 22:57:13,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98284063]
[2019-10-13 22:57:13,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,595 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 4 states.
[2019-10-13 22:57:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,634 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions.
[2019-10-13 22:57:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2019-10-13 22:57:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,639 INFO L225 Difference]: With dead ends: 57
[2019-10-13 22:57:13,639 INFO L226 Difference]: Without dead ends: 55
[2019-10-13 22:57:13,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2019-10-13 22:57:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33.
[2019-10-13 22:57:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions.
[2019-10-13 22:57:13,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12
[2019-10-13 22:57:13,654 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,656 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions.
[2019-10-13 22:57:13,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions.
[2019-10-13 22:57:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-10-13 22:57:13,658 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2130421138, now seen corresponding path program 1 times
[2019-10-13 22:57:13,660 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166483868]
[2019-10-13 22:57:13,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166483868]
[2019-10-13 22:57:13,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184572343]
[2019-10-13 22:57:13,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,760 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states.
[2019-10-13 22:57:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,804 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions.
[2019-10-13 22:57:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2019-10-13 22:57:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,805 INFO L225 Difference]: With dead ends: 55
[2019-10-13 22:57:13,805 INFO L226 Difference]: Without dead ends: 53
[2019-10-13 22:57:13,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2019-10-13 22:57:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33.
[2019-10-13 22:57:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions.
[2019-10-13 22:57:13,812 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13
[2019-10-13 22:57:13,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,813 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions.
[2019-10-13 22:57:13,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions.
[2019-10-13 22:57:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-10-13 22:57:13,814 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332083, now seen corresponding path program 1 times
[2019-10-13 22:57:13,815 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107155738]
[2019-10-13 22:57:13,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107155738]
[2019-10-13 22:57:13,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706678069]
[2019-10-13 22:57:13,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,862 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states.
[2019-10-13 22:57:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,882 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions.
[2019-10-13 22:57:13,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2019-10-13 22:57:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,884 INFO L225 Difference]: With dead ends: 53
[2019-10-13 22:57:13,884 INFO L226 Difference]: Without dead ends: 51
[2019-10-13 22:57:13,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2019-10-13 22:57:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33.
[2019-10-13 22:57:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions.
[2019-10-13 22:57:13,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14
[2019-10-13 22:57:13,890 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,890 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions.
[2019-10-13 22:57:13,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions.
[2019-10-13 22:57:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-10-13 22:57:13,891 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,891 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1371527075, now seen corresponding path program 1 times
[2019-10-13 22:57:13,892 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930495973]
[2019-10-13 22:57:13,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:13,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930495973]
[2019-10-13 22:57:13,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047866108]
[2019-10-13 22:57:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,956 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 4 states.
[2019-10-13 22:57:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,994 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions.
[2019-10-13 22:57:13,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2019-10-13 22:57:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,998 INFO L225 Difference]: With dead ends: 51
[2019-10-13 22:57:13,998 INFO L226 Difference]: Without dead ends: 49
[2019-10-13 22:57:13,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2019-10-13 22:57:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33.
[2019-10-13 22:57:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions.
[2019-10-13 22:57:14,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15
[2019-10-13 22:57:14,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,009 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions.
[2019-10-13 22:57:14,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions.
[2019-10-13 22:57:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 22:57:14,012 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,012 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash -432119198, now seen corresponding path program 1 times
[2019-10-13 22:57:14,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665336287]
[2019-10-13 22:57:14,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665336287]
[2019-10-13 22:57:14,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956313159]
[2019-10-13 22:57:14,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,082 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states.
[2019-10-13 22:57:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,120 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions.
[2019-10-13 22:57:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2019-10-13 22:57:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,121 INFO L225 Difference]: With dead ends: 49
[2019-10-13 22:57:14,121 INFO L226 Difference]: Without dead ends: 47
[2019-10-13 22:57:14,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2019-10-13 22:57:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33.
[2019-10-13 22:57:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions.
[2019-10-13 22:57:14,129 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16
[2019-10-13 22:57:14,130 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,130 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions.
[2019-10-13 22:57:14,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions.
[2019-10-13 22:57:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 22:57:14,132 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,132 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -510578472, now seen corresponding path program 1 times
[2019-10-13 22:57:14,134 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771963025]
[2019-10-13 22:57:14,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771963025]
[2019-10-13 22:57:14,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319042476]
[2019-10-13 22:57:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,199 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 4 states.
[2019-10-13 22:57:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,223 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions.
[2019-10-13 22:57:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2019-10-13 22:57:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,224 INFO L225 Difference]: With dead ends: 47
[2019-10-13 22:57:14,225 INFO L226 Difference]: Without dead ends: 45
[2019-10-13 22:57:14,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2019-10-13 22:57:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33.
[2019-10-13 22:57:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions.
[2019-10-13 22:57:14,234 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17
[2019-10-13 22:57:14,234 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,234 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions.
[2019-10-13 22:57:14,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions.
[2019-10-13 22:57:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 22:57:14,236 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,236 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1352151671, now seen corresponding path program 1 times
[2019-10-13 22:57:14,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984926070]
[2019-10-13 22:57:14,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984926070]
[2019-10-13 22:57:14,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700024235]
[2019-10-13 22:57:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,285 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states.
[2019-10-13 22:57:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,302 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions.
[2019-10-13 22:57:14,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2019-10-13 22:57:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,304 INFO L225 Difference]: With dead ends: 45
[2019-10-13 22:57:14,304 INFO L226 Difference]: Without dead ends: 43
[2019-10-13 22:57:14,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2019-10-13 22:57:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33.
[2019-10-13 22:57:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions.
[2019-10-13 22:57:14,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18
[2019-10-13 22:57:14,308 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,308 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions.
[2019-10-13 22:57:14,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions.
[2019-10-13 22:57:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 22:57:14,310 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1032755699, now seen corresponding path program 1 times
[2019-10-13 22:57:14,311 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151394952]
[2019-10-13 22:57:14,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151394952]
[2019-10-13 22:57:14,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574275664]
[2019-10-13 22:57:14,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,343 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 4 states.
[2019-10-13 22:57:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,360 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions.
[2019-10-13 22:57:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2019-10-13 22:57:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,361 INFO L225 Difference]: With dead ends: 43
[2019-10-13 22:57:14,362 INFO L226 Difference]: Without dead ends: 41
[2019-10-13 22:57:14,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2019-10-13 22:57:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33.
[2019-10-13 22:57:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions.
[2019-10-13 22:57:14,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 19
[2019-10-13 22:57:14,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,366 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions.
[2019-10-13 22:57:14,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions.
[2019-10-13 22:57:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-10-13 22:57:14,367 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1950439796, now seen corresponding path program 1 times
[2019-10-13 22:57:14,368 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859859990]
[2019-10-13 22:57:14,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859859990]
[2019-10-13 22:57:14,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793985418]
[2019-10-13 22:57:14,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,400 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states.
[2019-10-13 22:57:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,418 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions.
[2019-10-13 22:57:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2019-10-13 22:57:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,419 INFO L225 Difference]: With dead ends: 41
[2019-10-13 22:57:14,420 INFO L226 Difference]: Without dead ends: 39
[2019-10-13 22:57:14,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2019-10-13 22:57:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33.
[2019-10-13 22:57:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 22:57:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions.
[2019-10-13 22:57:14,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20
[2019-10-13 22:57:14,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,428 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions.
[2019-10-13 22:57:14,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions.
[2019-10-13 22:57:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 22:57:14,429 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:14,429 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash -333875390, now seen corresponding path program 1 times
[2019-10-13 22:57:14,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429368472]
[2019-10-13 22:57:14,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:57:14,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429368472]
[2019-10-13 22:57:14,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233200944]
[2019-10-13 22:57:14,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,471 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states.
[2019-10-13 22:57:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,488 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions.
[2019-10-13 22:57:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2019-10-13 22:57:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,489 INFO L225 Difference]: With dead ends: 35
[2019-10-13 22:57:14,489 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 22:57:14,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 22:57:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 22:57:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 22:57:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 22:57:14,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21
[2019-10-13 22:57:14,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,491 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 22:57:14,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 22:57:14,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 22:57:14,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 22:57:14,516 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,516 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,517 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed.
[2019-10-13 22:57:14,517 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed.
[2019-10-13 22:57:14,518 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed.
[2019-10-13 22:57:14,519 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed.
[2019-10-13 22:57:14,519 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true
[2019-10-13 22:57:14,519 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true
[2019-10-13 22:57:14,519 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,519 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed.
[2019-10-13 22:57:14,519 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,519 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed.
[2019-10-13 22:57:14,520 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,520 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,520 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,520 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true
[2019-10-13 22:57:14,520 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed.
[2019-10-13 22:57:14,520 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed.
[2019-10-13 22:57:14,521 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed.
[2019-10-13 22:57:14,521 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false
[2019-10-13 22:57:14,521 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,521 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 22:57:14,521 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed.
[2019-10-13 22:57:14,521 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed.
[2019-10-13 22:57:14,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:57:14 BoogieIcfgContainer
[2019-10-13 22:57:14,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 22:57:14,535 INFO L168 Benchmark]: Toolchain (without parser) took 2709.72 ms. Allocated memory was 138.4 MB in the beginning and 234.9 MB in the end (delta: 96.5 MB). Free memory was 103.8 MB in the beginning and 122.3 MB in the end (delta: -18.6 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,536 INFO L168 Benchmark]: CDTParser took 1.61 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.26 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 103.5 MB in the beginning and 181.2 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,543 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,544 INFO L168 Benchmark]: RCFGBuilder took 740.70 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 137.3 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,545 INFO L168 Benchmark]: TraceAbstraction took 1572.02 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 136.7 MB in the beginning and 122.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.61 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 354.26 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 103.5 MB in the beginning and 181.2 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 37.74 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 740.70 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 137.3 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 1572.02 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 136.7 MB in the beginning and 122.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 45]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 0
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 578 SDtfs, 446 SDslu, 829 SDs, 0 SdLazy, 108 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 10658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...