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_11.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 22:57:10,341 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 22:57:10,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 22:57:10,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 22:57:10,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 22:57:10,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 22:57:10,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 22:57:10,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 22:57:10,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 22:57:10,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 22:57:10,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 22:57:10,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 22:57:10,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 22:57:10,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 22:57:10,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 22:57:10,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 22:57:10,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 22:57:10,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 22:57:10,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 22:57:10,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 22:57:10,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 22:57:10,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 22:57:10,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 22:57:10,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 22:57:10,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 22:57:10,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 22:57:10,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 22:57:10,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 22:57:10,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 22:57:10,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 22:57:10,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 22:57:10,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 22:57:10,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 22:57:10,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 22:57:10,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 22:57:10,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 22:57:10,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 22:57:10,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 22:57:10,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 22:57:10,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 22:57:10,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 22:57:10,433 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,447 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 22:57:10,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 22:57:10,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 22:57:10,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 22:57:10,449 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 22:57:10,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 22:57:10,450 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 22:57:10,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 22:57:10,450 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 22:57:10,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 22:57:10,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 22:57:10,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 22:57:10,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 22:57:10,451 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 22:57:10,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 22:57:10,452 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 22:57:10,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 22:57:10,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 22:57:10,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 22:57:10,453 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 22:57:10,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 22:57:10,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 22:57:10,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 22:57:10,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 22:57:10,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 22:57:10,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 22:57:10,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 22:57:10,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 22:57:10,455 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,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 22:57:10,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 22:57:10,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 22:57:10,793 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 22:57:10,794 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 22:57:10,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c
[2019-10-13 22:57:10,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b8b447d/0c6183137974499bb2e0dbc86ce049aa/FLAG23917ac03
[2019-10-13 22:57:11,285 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 22:57:11,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c
[2019-10-13 22:57:11,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b8b447d/0c6183137974499bb2e0dbc86ce049aa/FLAG23917ac03
[2019-10-13 22:57:11,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b8b447d/0c6183137974499bb2e0dbc86ce049aa
[2019-10-13 22:57:11,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 22:57:11,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 22:57:11,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 22:57:11,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 22:57:11,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 22:57:11,718 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,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd8e3a 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,721 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,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 22:57:11,752 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 22:57:11,955 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:57:11,960 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 22:57:11,985 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:57:11,997 INFO L192 MainTranslator]: Completed translation
[2019-10-13 22:57:11,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:11 WrapperNode
[2019-10-13 22:57:11,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 22:57:11,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 22:57:11,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 22:57:11,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 22:57:12,093 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:11" (1/1) ...
[2019-10-13 22:57:12,093 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:11" (1/1) ...
[2019-10-13 22:57:12,099 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:11" (1/1) ...
[2019-10-13 22:57:12,099 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:11" (1/1) ...
[2019-10-13 22:57:12,105 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:11" (1/1) ...
[2019-10-13 22:57:12,115 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:11" (1/1) ...
[2019-10-13 22:57:12,117 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:11" (1/1) ...
[2019-10-13 22:57:12,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 22:57:12,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 22:57:12,120 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 22:57:12,120 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 22:57:12,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:11" (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,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 22:57:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 22:57:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 22:57:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 22:57:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 22:57:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 22:57:12,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 22:57:12,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 22:57:12,811 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 22:57:12,811 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 22:57:12,813 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,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 22:57:12,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 22:57:12,816 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 22:57:12,820 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 22:57:12,820 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,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b724aa 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,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:11" (2/3) ...
[2019-10-13 22:57:12,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b724aa 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,824 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,836 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c
[2019-10-13 22:57:12,849 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 22:57:12,858 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 22:57:12,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 22:57:12,897 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 22:57:12,897 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 22:57:12,898 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 22:57:12,898 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 22:57:12,898 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 22:57:12,898 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 22:57:12,899 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 22:57:12,899 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 22:57:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states.
[2019-10-13 22:57:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 22:57:12,926 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:12,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:12,929 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 563061398, now seen corresponding path program 1 times
[2019-10-13 22:57:12,942 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:12,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260217649]
[2019-10-13 22:57:12,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:12,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:12,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,145 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,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260217649]
[2019-10-13 22:57:13,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888233687]
[2019-10-13 22:57:13,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,177 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states.
[2019-10-13 22:57:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,242 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions.
[2019-10-13 22:57:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2019-10-13 22:57:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,265 INFO L225 Difference]: With dead ends: 70
[2019-10-13 22:57:13,265 INFO L226 Difference]: Without dead ends: 55
[2019-10-13 22:57:13,272 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,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2019-10-13 22:57:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31.
[2019-10-13 22:57:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions.
[2019-10-13 22:57:13,329 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10
[2019-10-13 22:57:13,329 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,329 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions.
[2019-10-13 22:57:13,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions.
[2019-10-13 22:57:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-10-13 22:57:13,330 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,330 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 275247210, now seen corresponding path program 1 times
[2019-10-13 22:57:13,331 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394341533]
[2019-10-13 22:57:13,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,424 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,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394341533]
[2019-10-13 22:57:13,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188746070]
[2019-10-13 22:57:13,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,429 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states.
[2019-10-13 22:57:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,456 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions.
[2019-10-13 22:57:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2019-10-13 22:57:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,458 INFO L225 Difference]: With dead ends: 55
[2019-10-13 22:57:13,458 INFO L226 Difference]: Without dead ends: 53
[2019-10-13 22:57:13,459 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,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2019-10-13 22:57:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31.
[2019-10-13 22:57:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions.
[2019-10-13 22:57:13,466 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11
[2019-10-13 22:57:13,466 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,466 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions.
[2019-10-13 22:57:13,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions.
[2019-10-13 22:57:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-10-13 22:57:13,468 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,469 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -57057685, now seen corresponding path program 1 times
[2019-10-13 22:57:13,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63371726]
[2019-10-13 22:57:13,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,586 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,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63371726]
[2019-10-13 22:57:13,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281249760]
[2019-10-13 22:57:13,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,590 INFO L87 Difference]: Start difference. First operand 31 states and 50 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,633 INFO L93 Difference]: Finished difference Result 53 states and 86 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: 53
[2019-10-13 22:57:13,639 INFO L226 Difference]: Without dead ends: 51
[2019-10-13 22:57:13,640 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,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2019-10-13 22:57:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31.
[2019-10-13 22:57:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions.
[2019-10-13 22:57:13,660 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12
[2019-10-13 22:57:13,660 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,661 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions.
[2019-10-13 22:57:13,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions.
[2019-10-13 22:57:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-10-13 22:57:13,662 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,662 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:57:13,662 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1768574497, now seen corresponding path program 1 times
[2019-10-13 22:57:13,665 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275892991]
[2019-10-13 22:57:13,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,738 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,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275892991]
[2019-10-13 22:57:13,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781828056]
[2019-10-13 22:57:13,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,741 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states.
[2019-10-13 22:57:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,773 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions.
[2019-10-13 22:57:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2019-10-13 22:57:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,778 INFO L225 Difference]: With dead ends: 51
[2019-10-13 22:57:13,778 INFO L226 Difference]: Without dead ends: 49
[2019-10-13 22:57:13,779 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,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2019-10-13 22:57:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31.
[2019-10-13 22:57:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions.
[2019-10-13 22:57:13,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13
[2019-10-13 22:57:13,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,802 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions.
[2019-10-13 22:57:13,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions.
[2019-10-13 22:57:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-10-13 22:57:13,803 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,803 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,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1008979520, now seen corresponding path program 1 times
[2019-10-13 22:57:13,805 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131129998]
[2019-10-13 22:57:13,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,886 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,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131129998]
[2019-10-13 22:57:13,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230870879]
[2019-10-13 22:57:13,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,889 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states.
[2019-10-13 22:57:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:13,924 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions.
[2019-10-13 22:57:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:13,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2019-10-13 22:57:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:13,926 INFO L225 Difference]: With dead ends: 49
[2019-10-13 22:57:13,926 INFO L226 Difference]: Without dead ends: 47
[2019-10-13 22:57:13,927 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,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2019-10-13 22:57:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31.
[2019-10-13 22:57:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions.
[2019-10-13 22:57:13,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14
[2019-10-13 22:57:13,932 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:13,932 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions.
[2019-10-13 22:57:13,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions.
[2019-10-13 22:57:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-10-13 22:57:13,933 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:13,933 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,934 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1213808468, now seen corresponding path program 1 times
[2019-10-13 22:57:13,934 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:13,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082905057]
[2019-10-13 22:57:13,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:13,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:13,976 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,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082905057]
[2019-10-13 22:57:13,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:13,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:13,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195422417]
[2019-10-13 22:57:13,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:13,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:13,979 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 4 states.
[2019-10-13 22:57:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,005 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions.
[2019-10-13 22:57:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2019-10-13 22:57:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,007 INFO L225 Difference]: With dead ends: 47
[2019-10-13 22:57:14,007 INFO L226 Difference]: Without dead ends: 45
[2019-10-13 22:57:14,008 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,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2019-10-13 22:57:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31.
[2019-10-13 22:57:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions.
[2019-10-13 22:57:14,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15
[2019-10-13 22:57:14,012 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,013 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions.
[2019-10-13 22:57:14,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions.
[2019-10-13 22:57:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 22:57:14,014 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,014 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,014 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1026428395, now seen corresponding path program 1 times
[2019-10-13 22:57:14,015 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894014655]
[2019-10-13 22:57:14,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,059 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,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894014655]
[2019-10-13 22:57:14,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723643067]
[2019-10-13 22:57:14,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,063 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 4 states.
[2019-10-13 22:57:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,083 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions.
[2019-10-13 22:57:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2019-10-13 22:57:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,084 INFO L225 Difference]: With dead ends: 45
[2019-10-13 22:57:14,084 INFO L226 Difference]: Without dead ends: 43
[2019-10-13 22:57:14,084 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,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2019-10-13 22:57:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31.
[2019-10-13 22:57:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions.
[2019-10-13 22:57:14,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16
[2019-10-13 22:57:14,089 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,089 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions.
[2019-10-13 22:57:14,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions.
[2019-10-13 22:57:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 22:57:14,090 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,090 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,091 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1754294071, now seen corresponding path program 1 times
[2019-10-13 22:57:14,091 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173616517]
[2019-10-13 22:57:14,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,140 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,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173616517]
[2019-10-13 22:57:14,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660918396]
[2019-10-13 22:57:14,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,143 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 4 states.
[2019-10-13 22:57:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,162 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions.
[2019-10-13 22:57:14,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2019-10-13 22:57:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,164 INFO L225 Difference]: With dead ends: 43
[2019-10-13 22:57:14,164 INFO L226 Difference]: Without dead ends: 41
[2019-10-13 22:57:14,165 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,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2019-10-13 22:57:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31.
[2019-10-13 22:57:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions.
[2019-10-13 22:57:14,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17
[2019-10-13 22:57:14,169 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,169 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions.
[2019-10-13 22:57:14,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions.
[2019-10-13 22:57:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 22:57:14,170 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,171 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,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1451674090, now seen corresponding path program 1 times
[2019-10-13 22:57:14,171 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441386951]
[2019-10-13 22:57:14,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,216 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,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441386951]
[2019-10-13 22:57:14,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175310709]
[2019-10-13 22:57:14,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,220 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 4 states.
[2019-10-13 22:57:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,242 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions.
[2019-10-13 22:57:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2019-10-13 22:57:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,244 INFO L225 Difference]: With dead ends: 41
[2019-10-13 22:57:14,244 INFO L226 Difference]: Without dead ends: 39
[2019-10-13 22:57:14,244 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,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2019-10-13 22:57:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31.
[2019-10-13 22:57:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions.
[2019-10-13 22:57:14,248 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 18
[2019-10-13 22:57:14,248 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,249 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions.
[2019-10-13 22:57:14,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions.
[2019-10-13 22:57:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 22:57:14,250 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,250 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,250 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2052439614, now seen corresponding path program 1 times
[2019-10-13 22:57:14,251 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102754487]
[2019-10-13 22:57:14,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,298 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,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102754487]
[2019-10-13 22:57:14,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396454605]
[2019-10-13 22:57:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,305 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 4 states.
[2019-10-13 22:57:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,332 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions.
[2019-10-13 22:57:14,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2019-10-13 22:57:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,334 INFO L225 Difference]: With dead ends: 39
[2019-10-13 22:57:14,334 INFO L226 Difference]: Without dead ends: 37
[2019-10-13 22:57:14,335 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,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2019-10-13 22:57:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31.
[2019-10-13 22:57:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2019-10-13 22:57:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions.
[2019-10-13 22:57:14,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19
[2019-10-13 22:57:14,342 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,343 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions.
[2019-10-13 22:57:14,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions.
[2019-10-13 22:57:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-10-13 22:57:14,347 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:57:14,347 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,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:57:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:57:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash -798665281, now seen corresponding path program 1 times
[2019-10-13 22:57:14,348 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:57:14,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18897130]
[2019-10-13 22:57:14,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:57:14,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:57:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:57:14,412 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,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18897130]
[2019-10-13 22:57:14,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:57:14,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:57:14,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218897883]
[2019-10-13 22:57:14,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:57:14,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:57:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:57:14,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:57:14,415 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states.
[2019-10-13 22:57:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:57:14,433 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions.
[2019-10-13 22:57:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:57:14,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2019-10-13 22:57:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:57:14,433 INFO L225 Difference]: With dead ends: 33
[2019-10-13 22:57:14,434 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 22:57:14,434 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,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 22:57:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 22:57:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 22:57:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 22:57:14,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20
[2019-10-13 22:57:14,435 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:57:14,435 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 22:57:14,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:57:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 22:57:14,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 22:57:14,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 22:57:14,456 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,456 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,456 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,456 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,456 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,457 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed.
[2019-10-13 22:57:14,458 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,459 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed.
[2019-10-13 22:57:14,460 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed.
[2019-10-13 22:57:14,460 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true
[2019-10-13 22:57:14,466 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,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 22:57:14,469 INFO L168 Benchmark]: Toolchain (without parser) took 2756.77 ms. Allocated memory was 146.3 MB in the beginning and 233.8 MB in the end (delta: 87.6 MB). Free memory was 103.6 MB in the beginning and 136.9 MB in the end (delta: -33.3 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,470 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 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,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.69 ms. Allocated memory is still 146.3 MB. Free memory was 103.4 MB in the beginning and 92.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,472 INFO L168 Benchmark]: Boogie Preprocessor took 120.88 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,473 INFO L168 Benchmark]: RCFGBuilder took 694.87 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 141.8 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,474 INFO L168 Benchmark]: TraceAbstraction took 1650.56 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 141.8 MB in the beginning and 136.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB.
[2019-10-13 22:57:14,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 285.69 ms. Allocated memory is still 146.3 MB. Free memory was 103.4 MB in the beginning and 92.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 120.88 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 694.87 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 141.8 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 1650.56 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 141.8 MB in the beginning and 136.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 175]: 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: 42]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 1
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 492 SDtfs, 376 SDslu, 700 SDs, 0 SdLazy, 99 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 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, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 8778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...