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/eca-rers2012/Problem01_label00.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:39:43,673 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:39:43,676 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:39:43,691 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:39:43,692 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:39:43,693 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:39:43,694 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:39:43,696 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:39:43,697 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:39:43,698 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:39:43,699 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:39:43,700 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:39:43,700 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:39:43,701 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:39:43,702 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:39:43,703 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:39:43,704 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:39:43,706 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:39:43,707 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:39:43,709 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:39:43,711 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:39:43,713 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:39:43,714 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:39:43,716 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:39:43,719 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:39:43,720 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:39:43,720 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:39:43,722 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:39:43,723 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:39:43,725 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:39:43,725 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:39:43,726 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:39:43,726 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:39:43,728 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:39:43,732 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:39:43,733 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:39:43,733 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:39:43,733 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:39:43,734 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:39:43,736 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:39:43,738 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:39:43,740 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 21:39:43,759 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-10-13 21:39:43,760 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:39:43,763 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:39:43,764 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-10-13 21:39:43,764 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-10-13 21:39:43,764 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:39:43,765 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-10-13 21:39:43,765 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-10-13 21:39:43,765 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-10-13 21:39:43,765 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-10-13 21:39:43,766 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:39:43,766 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:39:43,767 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:39:43,767 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-10-13 21:39:43,767 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-10-13 21:39:43,768 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-10-13 21:39:43,768 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:39:43,768 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:39:43,768 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-10-13 21:39:43,768 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-10-13 21:39:43,769 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-10-13 21:39:43,769 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:39:43,769 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:39:43,769 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:39:43,769 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:39:43,770 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-10-13 21:39:43,770 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:39:43,770 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:39:43,770 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 21:39:44,071 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:39:44,089 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:39:44,092 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:39:44,093 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-10-13 21:39:44,093 INFO  L275        PluginConnector]: CDTParser initialized
[2019-10-13 21:39:44,094 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c
[2019-10-13 21:39:44,154 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f493b416/73c84733458145d9b24b93b2c96517a3/FLAG20985ffaa
[2019-10-13 21:39:44,736 INFO  L306              CDTParser]: Found 1 translation units.
[2019-10-13 21:39:44,739 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c
[2019-10-13 21:39:44,762 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f493b416/73c84733458145d9b24b93b2c96517a3/FLAG20985ffaa
[2019-10-13 21:39:44,986 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f493b416/73c84733458145d9b24b93b2c96517a3
[2019-10-13 21:39:44,996 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:39:44,997 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:39:44,998 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:39:44,998 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:39:45,001 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:39:45,002 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:44" (1/1) ...
[2019-10-13 21:39:45,005 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137de84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45, skipping insertion in model container
[2019-10-13 21:39:45,005 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:44" (1/1) ...
[2019-10-13 21:39:45,012 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-10-13 21:39:45,069 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:39:45,579 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:39:45,587 INFO  L188         MainTranslator]: Completed pre-run
[2019-10-13 21:39:45,705 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:39:45,721 INFO  L192         MainTranslator]: Completed translation
[2019-10-13 21:39:45,721 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45 WrapperNode
[2019-10-13 21:39:45,721 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:39:45,722 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:39:45,722 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:39:45,722 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:39:45,736 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,736 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,753 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,753 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,795 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,806 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,811 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (1/1) ...
[2019-10-13 21:39:45,820 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:39:45,820 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:39:45,820 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:39:45,821 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:39:45,821 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (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 21:39:45,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:39:45,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:39:45,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure calculate_output
[2019-10-13 21:39:45,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:39:45,885 INFO  L130     BoogieDeclarations]: Found specification of procedure calculate_output
[2019-10-13 21:39:45,886 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:39:45,886 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:39:45,887 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2019-10-13 21:39:45,887 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:39:45,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:39:45,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:39:47,696 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:39:47,696 INFO  L284             CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 21:39:47,698 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:47 BoogieIcfgContainer
[2019-10-13 21:39:47,698 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:39:47,699 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:39:47,699 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:39:47,703 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:39:47,703 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:44" (1/3) ...
[2019-10-13 21:39:47,704 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cbc786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:47, skipping insertion in model container
[2019-10-13 21:39:47,704 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:45" (2/3) ...
[2019-10-13 21:39:47,705 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cbc786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:47, skipping insertion in model container
[2019-10-13 21:39:47,705 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:47" (3/3) ...
[2019-10-13 21:39:47,711 INFO  L109   eAbstractionObserver]: Analyzing ICFG Problem01_label00.c
[2019-10-13 21:39:47,725 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:39:47,734 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:39:47,745 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:39:47,776 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:39:47,776 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-10-13 21:39:47,778 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:39:47,778 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:39:47,779 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:39:47,779 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-10-13 21:39:47,780 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:39:47,780 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:39:47,800 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states.
[2019-10-13 21:39:47,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2019-10-13 21:39:47,809 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:39:47,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:39:47,812 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:39:47,817 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:39:47,818 INFO  L82        PathProgramCache]: Analyzing trace with hash 826820452, now seen corresponding path program 1 times
[2019-10-13 21:39:47,826 INFO  L157   tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:39:47,827 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668642690]
[2019-10-13 21:39:47,827 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:47,827 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:47,828 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:39:48,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:39:48,270 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 21:39:48,271 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668642690]
[2019-10-13 21:39:48,272 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:39:48,275 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:39:48,275 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646333184]
[2019-10-13 21:39:48,280 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:39:48,280 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:39:48,294 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:39:48,295 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:48,297 INFO  L87              Difference]: Start difference. First operand 86 states. Second operand 3 states.
[2019-10-13 21:39:48,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:39:48,840 INFO  L93              Difference]: Finished difference Result 246 states and 454 transitions.
[2019-10-13 21:39:48,840 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:39:48,842 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 77
[2019-10-13 21:39:48,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:39:48,856 INFO  L225             Difference]: With dead ends: 246
[2019-10-13 21:39:48,856 INFO  L226             Difference]: Without dead ends: 157
[2019-10-13 21:39:48,860 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:48,880 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2019-10-13 21:39:48,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157.
[2019-10-13 21:39:48,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2019-10-13 21:39:48,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 273 transitions.
[2019-10-13 21:39:48,931 INFO  L78                 Accepts]: Start accepts. Automaton has 157 states and 273 transitions. Word has length 77
[2019-10-13 21:39:48,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:39:48,932 INFO  L462      AbstractCegarLoop]: Abstraction has 157 states and 273 transitions.
[2019-10-13 21:39:48,932 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:39:48,932 INFO  L276                IsEmpty]: Start isEmpty. Operand 157 states and 273 transitions.
[2019-10-13 21:39:48,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2019-10-13 21:39:48,937 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:39:48,938 INFO  L380         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:39:48,938 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:39:48,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:39:48,939 INFO  L82        PathProgramCache]: Analyzing trace with hash -1195666181, now seen corresponding path program 1 times
[2019-10-13 21:39:48,939 INFO  L157   tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:39:48,939 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153964488]
[2019-10-13 21:39:48,939 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:48,940 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:48,940 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:39:48,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:39:49,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:39:49,090 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153964488]
[2019-10-13 21:39:49,090 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:39:49,091 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-13 21:39:49,091 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711744202]
[2019-10-13 21:39:49,095 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 21:39:49,095 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:39:49,097 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 21:39:49,099 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:39:49,099 INFO  L87              Difference]: Start difference. First operand 157 states and 273 transitions. Second operand 6 states.
[2019-10-13 21:39:49,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:39:49,703 INFO  L93              Difference]: Finished difference Result 479 states and 861 transitions.
[2019-10-13 21:39:49,704 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-10-13 21:39:49,704 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 87
[2019-10-13 21:39:49,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:39:49,711 INFO  L225             Difference]: With dead ends: 479
[2019-10-13 21:39:49,711 INFO  L226             Difference]: Without dead ends: 327
[2019-10-13 21:39:49,715 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-10-13 21:39:49,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 327 states.
[2019-10-13 21:39:49,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315.
[2019-10-13 21:39:49,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 315 states.
[2019-10-13 21:39:49,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 544 transitions.
[2019-10-13 21:39:49,754 INFO  L78                 Accepts]: Start accepts. Automaton has 315 states and 544 transitions. Word has length 87
[2019-10-13 21:39:49,754 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:39:49,754 INFO  L462      AbstractCegarLoop]: Abstraction has 315 states and 544 transitions.
[2019-10-13 21:39:49,754 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 21:39:49,755 INFO  L276                IsEmpty]: Start isEmpty. Operand 315 states and 544 transitions.
[2019-10-13 21:39:49,758 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2019-10-13 21:39:49,759 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:39:49,759 INFO  L380         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:39:49,759 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:39:49,759 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:39:49,759 INFO  L82        PathProgramCache]: Analyzing trace with hash -2128687785, now seen corresponding path program 1 times
[2019-10-13 21:39:49,760 INFO  L157   tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:39:49,760 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625147095]
[2019-10-13 21:39:49,760 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:49,760 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:49,761 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:39:49,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:39:49,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:39:49,851 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625147095]
[2019-10-13 21:39:49,851 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:39:49,852 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:39:49,852 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362260047]
[2019-10-13 21:39:49,852 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:39:49,853 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:39:49,853 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:39:49,853 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:39:49,854 INFO  L87              Difference]: Start difference. First operand 315 states and 544 transitions. Second operand 4 states.
[2019-10-13 21:39:50,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:39:50,464 INFO  L93              Difference]: Finished difference Result 775 states and 1364 transitions.
[2019-10-13 21:39:50,465 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:39:50,465 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 88
[2019-10-13 21:39:50,466 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:39:50,471 INFO  L225             Difference]: With dead ends: 775
[2019-10-13 21:39:50,472 INFO  L226             Difference]: Without dead ends: 465
[2019-10-13 21:39:50,474 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:39:50,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 465 states.
[2019-10-13 21:39:50,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465.
[2019-10-13 21:39:50,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 465 states.
[2019-10-13 21:39:50,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 740 transitions.
[2019-10-13 21:39:50,506 INFO  L78                 Accepts]: Start accepts. Automaton has 465 states and 740 transitions. Word has length 88
[2019-10-13 21:39:50,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:39:50,507 INFO  L462      AbstractCegarLoop]: Abstraction has 465 states and 740 transitions.
[2019-10-13 21:39:50,507 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:39:50,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 465 states and 740 transitions.
[2019-10-13 21:39:50,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2019-10-13 21:39:50,512 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:39:50,512 INFO  L380         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:39:50,513 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:39:50,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:39:50,513 INFO  L82        PathProgramCache]: Analyzing trace with hash 1557876815, now seen corresponding path program 1 times
[2019-10-13 21:39:50,513 INFO  L157   tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:39:50,514 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479255676]
[2019-10-13 21:39:50,514 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:50,514 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:50,514 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:39:50,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:39:50,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:39:50,604 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479255676]
[2019-10-13 21:39:50,604 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:39:50,604 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:39:50,604 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800218347]
[2019-10-13 21:39:50,605 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:39:50,605 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:39:50,605 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:39:50,605 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:50,606 INFO  L87              Difference]: Start difference. First operand 465 states and 740 transitions. Second operand 3 states.
[2019-10-13 21:39:51,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:39:51,062 INFO  L93              Difference]: Finished difference Result 1075 states and 1755 transitions.
[2019-10-13 21:39:51,063 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:39:51,063 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 92
[2019-10-13 21:39:51,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:39:51,068 INFO  L225             Difference]: With dead ends: 1075
[2019-10-13 21:39:51,068 INFO  L226             Difference]: Without dead ends: 615
[2019-10-13 21:39:51,070 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:51,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 615 states.
[2019-10-13 21:39:51,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 613.
[2019-10-13 21:39:51,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 613 states.
[2019-10-13 21:39:51,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 919 transitions.
[2019-10-13 21:39:51,128 INFO  L78                 Accepts]: Start accepts. Automaton has 613 states and 919 transitions. Word has length 92
[2019-10-13 21:39:51,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:39:51,128 INFO  L462      AbstractCegarLoop]: Abstraction has 613 states and 919 transitions.
[2019-10-13 21:39:51,129 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:39:51,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 613 states and 919 transitions.
[2019-10-13 21:39:51,139 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2019-10-13 21:39:51,139 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:39:51,139 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:39:51,140 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:39:51,140 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:39:51,143 INFO  L82        PathProgramCache]: Analyzing trace with hash 773414738, now seen corresponding path program 1 times
[2019-10-13 21:39:51,143 INFO  L157   tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:39:51,144 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337730262]
[2019-10-13 21:39:51,144 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:51,144 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:39:51,144 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:39:51,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:39:51,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2019-10-13 21:39:51,328 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337730262]
[2019-10-13 21:39:51,328 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:39:51,328 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:39:51,328 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18949036]
[2019-10-13 21:39:51,329 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:39:51,329 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:39:51,330 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:39:51,330 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:51,330 INFO  L87              Difference]: Start difference. First operand 613 states and 919 transitions. Second operand 3 states.
[2019-10-13 21:39:51,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:39:51,761 INFO  L93              Difference]: Finished difference Result 1596 states and 2450 transitions.
[2019-10-13 21:39:51,762 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:39:51,762 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 112
[2019-10-13 21:39:51,762 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:39:51,763 INFO  L225             Difference]: With dead ends: 1596
[2019-10-13 21:39:51,763 INFO  L226             Difference]: Without dead ends: 0
[2019-10-13 21:39:51,768 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:39:51,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:39:51,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:39:51,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:39:51,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:39:51,769 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112
[2019-10-13 21:39:51,769 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:39:51,769 INFO  L462      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:39:51,769 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:39:51,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:39:51,770 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:39:51,777 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:39:52,096 WARN  L191               SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35
[2019-10-13 21:39:52,205 INFO  L439   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(line -1)  the Hoare annotation is:  (= ~a16~0 |old(~a16~0)|)
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(line -1)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L333(lines 333 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L102(lines 102 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L499-1(lines 30 575)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L268(lines 268 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L136(lines 136 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,206 INFO  L443   ceAbstractionStarter]: For program point  L500(line 500)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L203(lines 203 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L72(lines 72 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L337(lines 337 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L238(lines 238 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L173(lines 173 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L140(lines 140 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L372(lines 372 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L306(lines 306 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,207 INFO  L443   ceAbstractionStarter]: For program point  L273(lines 273 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,208 INFO  L443   ceAbstractionStarter]: For program point  L108(lines 108 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,208 INFO  L443   ceAbstractionStarter]: For program point  L208(lines 208 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,208 INFO  L443   ceAbstractionStarter]: For program point  L43(lines 43 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,208 INFO  L443   ceAbstractionStarter]: For program point  calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500)  no Hoare annotation was computed.
[2019-10-13 21:39:52,208 INFO  L443   ceAbstractionStarter]: For program point  L144(lines 144 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,209 INFO  L443   ceAbstractionStarter]: For program point  L178(lines 178 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,209 INFO  L443   ceAbstractionStarter]: For program point  L377(lines 377 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,209 INFO  L443   ceAbstractionStarter]: For program point  L278(lines 278 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,209 INFO  L443   ceAbstractionStarter]: For program point  L245(lines 245 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,214 INFO  L443   ceAbstractionStarter]: For program point  L80(lines 80 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,214 INFO  L443   ceAbstractionStarter]: For program point  L345(lines 345 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,214 INFO  L443   ceAbstractionStarter]: For program point  L312(lines 312 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L114(lines 114 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L214(lines 214 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L148(lines 148 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L49(lines 49 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L84(lines 84 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  calculate_outputFINAL(lines 30 575)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  calculate_outputEXIT(lines 30 575)  no Hoare annotation was computed.
[2019-10-13 21:39:52,215 INFO  L443   ceAbstractionStarter]: For program point  L382(lines 382 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L316(lines 316 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L250(lines 250 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L218(lines 218 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L152(lines 152 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L119(lines 119 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L318(lines 318 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L186(lines 186 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,216 INFO  L443   ceAbstractionStarter]: For program point  L54(lines 54 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,217 INFO  L443   ceAbstractionStarter]: For program point  L286(lines 286 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,217 INFO  L443   ceAbstractionStarter]: For program point  L353(lines 353 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,217 INFO  L443   ceAbstractionStarter]: For program point  L189(lines 189 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,217 INFO  L443   ceAbstractionStarter]: For program point  L355(lines 355 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,217 INFO  L443   ceAbstractionStarter]: For program point  L256(lines 256 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,222 INFO  L443   ceAbstractionStarter]: For program point  L223(lines 223 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,222 INFO  L443   ceAbstractionStarter]: For program point  L124(lines 124 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,223 INFO  L443   ceAbstractionStarter]: For program point  L92(lines 92 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,223 INFO  L439   ceAbstractionStarter]: At program point  calculate_outputENTRY(lines 30 575)  the Hoare annotation is:  (let ((.cse6 (= 1 |old(~a7~0)|)) (.cse4 (not (= ~a17~0 1))) (.cse1 (= 1 |old(~a17~0)|)) (.cse5 (= 6 |old(~a16~0)|)) (.cse2 (not (= ~a21~0 1))) (.cse3 (= ~a16~0 |old(~a16~0)|)) (.cse0 (= 1 |old(~a21~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4)) (or (and .cse3 .cse4) .cse5 .cse1) (or .cse6 (and (not (= ~a7~0 1)) .cse3)) (or .cse3 (not (= 4 |old(~a16~0)|))) (or .cse6 .cse4 .cse1) (or .cse5 (and .cse2 .cse3) .cse0)))
[2019-10-13 21:39:52,223 INFO  L443   ceAbstractionStarter]: For program point  L324(lines 324 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,223 INFO  L443   ceAbstractionStarter]: For program point  L292(lines 292 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,223 INFO  L443   ceAbstractionStarter]: For program point  L160(lines 160 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L194(lines 194 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L62(lines 62 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L261(lines 261 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L129(lines 129 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L361(lines 361 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L97(lines 97 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L31(lines 31 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,224 INFO  L443   ceAbstractionStarter]: For program point  L329(lines 329 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L197(lines 197 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L65(lines 65 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L363(lines 363 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L231(lines 231 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L165(lines 165 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L496-1(lines 30 575)  no Hoare annotation was computed.
[2019-10-13 21:39:52,225 INFO  L443   ceAbstractionStarter]: For program point  L265(lines 265 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,226 INFO  L443   ceAbstractionStarter]: For program point  L365(lines 365 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,226 INFO  L443   ceAbstractionStarter]: For program point  L299(lines 299 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,226 INFO  L443   ceAbstractionStarter]: For program point  L35(lines 35 390)  no Hoare annotation was computed.
[2019-10-13 21:39:52,226 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(line -1)  no Hoare annotation was computed.
[2019-10-13 21:39:52,226 INFO  L439   ceAbstractionStarter]: At program point  L-1(line -1)  the Hoare annotation is:  (and (not (= ~a7~0 1)) (not (= ~a16~0 6)))
[2019-10-13 21:39:52,226 INFO  L446   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(line -1)  the Hoare annotation is:  true
[2019-10-13 21:39:52,226 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(line -1)  no Hoare annotation was computed.
[2019-10-13 21:39:52,227 INFO  L439   ceAbstractionStarter]: At program point  mainENTRY(lines 577 594)  the Hoare annotation is:  (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and (not (= ~a7~0 1)) (= ~a16~0 |old(~a16~0)|)))
[2019-10-13 21:39:52,227 INFO  L443   ceAbstractionStarter]: For program point  mainEXIT(lines 577 594)  no Hoare annotation was computed.
[2019-10-13 21:39:52,227 INFO  L439   ceAbstractionStarter]: At program point  L591(line 591)  the Hoare annotation is:  (let ((.cse1 (not (= ~a17~0 1))) (.cse2 (not (= ~a21~0 1))) (.cse0 (not (= ~a16~0 6)))) (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (and .cse2 .cse1) (not (= ~a7~0 1)) (and .cse2 .cse0)))
[2019-10-13 21:39:52,227 INFO  L443   ceAbstractionStarter]: For program point  L591-1(line 591)  no Hoare annotation was computed.
[2019-10-13 21:39:52,227 INFO  L443   ceAbstractionStarter]: For program point  L588(line 588)  no Hoare annotation was computed.
[2019-10-13 21:39:52,227 INFO  L439   ceAbstractionStarter]: At program point  L583-2(lines 583 593)  the Hoare annotation is:  (let ((.cse1 (not (= ~a17~0 1))) (.cse2 (not (= ~a21~0 1))) (.cse0 (not (= ~a16~0 6)))) (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (and .cse2 .cse1) (not (= ~a7~0 1)) (and .cse2 .cse0)))
[2019-10-13 21:39:52,227 INFO  L443   ceAbstractionStarter]: For program point  L583-3(lines 577 594)  no Hoare annotation was computed.
[2019-10-13 21:39:52,245 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:39:52 BoogieIcfgContainer
[2019-10-13 21:39:52,245 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:39:52,247 INFO  L168              Benchmark]: Toolchain (without parser) took 7249.56 ms. Allocated memory was 145.2 MB in the beginning and 296.7 MB in the end (delta: 151.5 MB). Free memory was 102.0 MB in the beginning and 90.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 163.4 MB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,248 INFO  L168              Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,249 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 724.04 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 167.7 MB in the end (delta: -66.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,250 INFO  L168              Benchmark]: Boogie Preprocessor took 97.89 ms. Allocated memory is still 203.4 MB. Free memory was 167.7 MB in the beginning and 162.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,251 INFO  L168              Benchmark]: RCFGBuilder took 1877.86 ms. Allocated memory was 203.4 MB in the beginning and 252.2 MB in the end (delta: 48.8 MB). Free memory was 162.7 MB in the beginning and 216.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,252 INFO  L168              Benchmark]: TraceAbstraction took 4545.95 ms. Allocated memory was 252.2 MB in the beginning and 296.7 MB in the end (delta: 44.6 MB). Free memory was 216.9 MB in the beginning and 90.0 MB in the end (delta: 126.9 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB.
[2019-10-13 21:39:52,257 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.15 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 724.04 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 167.7 MB in the end (delta: -66.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 97.89 ms. Allocated memory is still 203.4 MB. Free memory was 167.7 MB in the beginning and 162.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1877.86 ms. Allocated memory was 203.4 MB in the beginning and 252.2 MB in the end (delta: 48.8 MB). Free memory was 162.7 MB in the beginning and 216.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 4545.95 ms. Allocated memory was 252.2 MB in the beginning and 296.7 MB in the end (delta: 44.6 MB). Free memory was 216.9 MB in the beginning and 90.0 MB in the end (delta: 126.9 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 500]: 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: 583]: Loop Invariant
    Derived loop invariant: (((((a16 == 4 || 6 == \old(a16)) || 1 == \old(a7)) || (!(a16 == 6) && !(a17 == 1))) || (!(a21 == 1) && !(a17 == 1))) || !(a7 == 1)) || (!(a21 == 1) && !(a16 == 6))
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 500 SDtfs, 401 SDslu, 102 SDs, 0 SdLazy, 1499 SolverSat, 373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=613occurred in iteration=4, 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, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 40 PreInvPairs, 66 NumberOfFragments, 191 HoareAnnotationTreeSize, 40 FomulaSimplifications, 404 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 287 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 125117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 71/71 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...