/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 12:08:43,611 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 12:08:43,613 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 12:08:43,637 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 12:08:43,637 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 12:08:43,638 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 12:08:43,640 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 12:08:43,641 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 12:08:43,643 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 12:08:43,644 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 12:08:43,645 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 12:08:43,646 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 12:08:43,646 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 12:08:43,647 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 12:08:43,649 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 12:08:43,650 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 12:08:43,651 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 12:08:43,652 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 12:08:43,653 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 12:08:43,655 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 12:08:43,657 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 12:08:43,660 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 12:08:43,661 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 12:08:43,662 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 12:08:43,665 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 12:08:43,665 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 12:08:43,665 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 12:08:43,666 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 12:08:43,667 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 12:08:43,668 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 12:08:43,668 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 12:08:43,669 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 12:08:43,669 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 12:08:43,670 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 12:08:43,671 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 12:08:43,671 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 12:08:43,672 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 12:08:43,672 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 12:08:43,673 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 12:08:43,674 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 12:08:43,674 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 12:08:43,675 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf
[2020-10-16 12:08:43,702 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 12:08:43,702 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 12:08:43,704 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 12:08:43,704 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 12:08:43,704 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 12:08:43,704 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 12:08:43,705 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 12:08:43,706 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 12:08:43,706 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 12:08:43,706 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 12:08:43,706 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 12:08:43,706 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 12:08:43,707 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 12:08:43,707 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 12:08:43,707 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 12:08:43,707 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 12:08:43,707 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:08:43,708 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 12:08:43,708 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 12:08:43,708 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 12:08:43,708 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 12:08:43,708 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 12:08:43,709 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 12:08:43,709 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:08:43,997 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:08:44,007 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:08:44,013 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:08:44,015 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:08:44,015 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:08:44,016 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-16 12:08:44,089 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/35a0bad10/4ce3a4b6a20940789d86f9e8c1feb52c/FLAG70d97a84b
[2020-10-16 12:08:44,658 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:08:44,661 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-16 12:08:44,679 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/35a0bad10/4ce3a4b6a20940789d86f9e8c1feb52c/FLAG70d97a84b
[2020-10-16 12:08:44,878 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/35a0bad10/4ce3a4b6a20940789d86f9e8c1feb52c
[2020-10-16 12:08:44,887 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:08:44,890 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:08:44,891 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:08:44,891 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:08:44,895 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:08:44,896 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:08:44" (1/1) ...
[2020-10-16 12:08:44,899 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f2218c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:44, skipping insertion in model container
[2020-10-16 12:08:44,900 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:08:44" (1/1) ...
[2020-10-16 12:08:44,909 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:08:44,975 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:08:45,509 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:08:45,523 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:08:45,586 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:08:45,660 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:08:45,661 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45 WrapperNode
[2020-10-16 12:08:45,661 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:08:45,662 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:08:45,662 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:08:45,663 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:08:45,672 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,691 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,730 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:08:45,731 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:08:45,731 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:08:45,731 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:08:45,740 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,740 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,745 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,746 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,757 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,761 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,765 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,771 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:08:45,771 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:08:45,771 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:08:45,772 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:08:45,772 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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
[2020-10-16 12:08:45,837 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:08:45,837 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:08:45,838 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:08:45,838 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:08:45,838 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:08:45,838 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:08:45,838 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:08:45,838 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:08:45,839 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:08:45,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:08:45,839 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:08:45,839 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:08:45,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:08:45,841 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 12:08:48,081 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:08:48,081 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:08:48,084 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:08:48 BoogieIcfgContainer
[2020-10-16 12:08:48,084 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:08:48,085 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:08:48,085 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:08:48,089 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:08:48,089 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:08:44" (1/3) ...
[2020-10-16 12:08:48,090 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e217cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:08:48, skipping insertion in model container
[2020-10-16 12:08:48,090 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (2/3) ...
[2020-10-16 12:08:48,091 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e217cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:08:48, skipping insertion in model container
[2020-10-16 12:08:48,091 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:08:48" (3/3) ...
[2020-10-16 12:08:48,093 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i
[2020-10-16 12:08:48,105 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:08:48,105 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:08:48,113 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:08:48,114 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:08:48,143 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,143 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,143 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,144 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,144 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,144 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,145 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,145 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,145 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,146 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,146 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,146 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,146 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,146 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,147 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,147 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,147 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,148 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,148 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,148 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,149 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,149 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,149 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,150 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,150 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,150 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,150 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,150 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,151 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,151 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,151 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,152 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,153 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,153 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,153 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,153 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,154 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,154 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,158 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,158 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,158 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,158 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,159 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,159 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,159 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,159 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,160 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,160 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,163 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,163 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,163 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,163 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,164 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,164 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,164 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,164 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,164 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,165 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,165 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,165 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,167 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,167 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,167 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,167 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,167 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:48,170 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:08:48,185 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 12:08:48,211 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:08:48,211 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:08:48,212 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:08:48,212 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 12:08:48,212 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:08:48,212 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:08:48,212 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:08:48,213 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:08:48,229 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:08:48,230 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:48,234 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:48,237 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:48,292 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 12:08:48,292 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:08:48,298 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. 
[2020-10-16 12:08:48,302 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1650
[2020-10-16 12:08:48,857 WARN  L193               SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42
[2020-10-16 12:08:50,235 WARN  L193               SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-16 12:08:50,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 12:08:50,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:08:50,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 12:08:50,315 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:08:51,535 WARN  L193               SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-16 12:08:51,881 WARN  L193               SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-16 12:08:52,009 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 12:08:52,511 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 12:08:53,637 WARN  L193               SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108
[2020-10-16 12:08:53,922 WARN  L193               SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 105
[2020-10-16 12:08:55,344 WARN  L193               SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 139 DAG size of output: 130
[2020-10-16 12:08:55,766 WARN  L193               SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 127
[2020-10-16 12:08:55,969 WARN  L193               SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78
[2020-10-16 12:08:56,182 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 12:08:56,300 WARN  L193               SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 12:08:56,310 INFO  L132        LiptonReduction]: Checked pairs total: 4800
[2020-10-16 12:08:56,310 INFO  L134        LiptonReduction]: Total number of compositions: 78
[2020-10-16 12:08:56,318 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow
[2020-10-16 12:08:56,404 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states.
[2020-10-16 12:08:56,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 824 states.
[2020-10-16 12:08:56,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 12:08:56,414 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:56,415 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 12:08:56,416 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:56,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:56,420 INFO  L82        PathProgramCache]: Analyzing trace with hash 1043102, now seen corresponding path program 1 times
[2020-10-16 12:08:56,429 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:56,429 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142425997]
[2020-10-16 12:08:56,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:56,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:56,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:56,667 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142425997]
[2020-10-16 12:08:56,667 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:56,668 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:08:56,669 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045555035]
[2020-10-16 12:08:56,674 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:08:56,675 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:56,689 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:08:56,690 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:56,691 INFO  L87              Difference]: Start difference. First operand 824 states. Second operand 3 states.
[2020-10-16 12:08:56,807 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:56,808 INFO  L93              Difference]: Finished difference Result 687 states and 2150 transitions.
[2020-10-16 12:08:56,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:08:56,810 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 12:08:56,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:56,846 INFO  L225             Difference]: With dead ends: 687
[2020-10-16 12:08:56,846 INFO  L226             Difference]: Without dead ends: 562
[2020-10-16 12:08:56,850 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:56,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 562 states.
[2020-10-16 12:08:56,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562.
[2020-10-16 12:08:56,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 562 states.
[2020-10-16 12:08:56,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions.
[2020-10-16 12:08:56,962 INFO  L78                 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3
[2020-10-16 12:08:56,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:56,963 INFO  L481      AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions.
[2020-10-16 12:08:56,963 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:08:56,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions.
[2020-10-16 12:08:56,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 12:08:56,965 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:56,965 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:56,966 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:08:56,966 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:56,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:56,966 INFO  L82        PathProgramCache]: Analyzing trace with hash -686129632, now seen corresponding path program 1 times
[2020-10-16 12:08:56,967 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:56,967 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802394884]
[2020-10-16 12:08:56,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:57,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:57,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:57,105 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802394884]
[2020-10-16 12:08:57,105 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:57,105 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:08:57,106 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584919444]
[2020-10-16 12:08:57,107 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:08:57,107 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:57,108 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:08:57,108 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:57,108 INFO  L87              Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states.
[2020-10-16 12:08:57,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:57,143 INFO  L93              Difference]: Finished difference Result 557 states and 1706 transitions.
[2020-10-16 12:08:57,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:08:57,145 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 12:08:57,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:57,150 INFO  L225             Difference]: With dead ends: 557
[2020-10-16 12:08:57,151 INFO  L226             Difference]: Without dead ends: 557
[2020-10-16 12:08:57,155 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:57,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 557 states.
[2020-10-16 12:08:57,200 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557.
[2020-10-16 12:08:57,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 557 states.
[2020-10-16 12:08:57,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions.
[2020-10-16 12:08:57,208 INFO  L78                 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9
[2020-10-16 12:08:57,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:57,210 INFO  L481      AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions.
[2020-10-16 12:08:57,210 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:08:57,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions.
[2020-10-16 12:08:57,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 12:08:57,218 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:57,218 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:57,219 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:08:57,219 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:57,219 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:57,219 INFO  L82        PathProgramCache]: Analyzing trace with hash -801393419, now seen corresponding path program 1 times
[2020-10-16 12:08:57,219 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:57,220 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141115111]
[2020-10-16 12:08:57,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:57,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:57,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:57,328 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141115111]
[2020-10-16 12:08:57,328 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:57,329 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:08:57,329 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820549764]
[2020-10-16 12:08:57,329 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:08:57,329 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:57,329 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:08:57,330 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:57,330 INFO  L87              Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states.
[2020-10-16 12:08:57,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:57,374 INFO  L93              Difference]: Finished difference Result 533 states and 1620 transitions.
[2020-10-16 12:08:57,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:08:57,375 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 12:08:57,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:57,380 INFO  L225             Difference]: With dead ends: 533
[2020-10-16 12:08:57,381 INFO  L226             Difference]: Without dead ends: 533
[2020-10-16 12:08:57,381 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:57,387 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 533 states.
[2020-10-16 12:08:57,400 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533.
[2020-10-16 12:08:57,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 533 states.
[2020-10-16 12:08:57,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions.
[2020-10-16 12:08:57,404 INFO  L78                 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10
[2020-10-16 12:08:57,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:57,404 INFO  L481      AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions.
[2020-10-16 12:08:57,405 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:08:57,405 INFO  L276                IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions.
[2020-10-16 12:08:57,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:08:57,411 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:57,412 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:57,416 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:08:57,416 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:57,416 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:57,417 INFO  L82        PathProgramCache]: Analyzing trace with hash 925932103, now seen corresponding path program 1 times
[2020-10-16 12:08:57,422 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:57,422 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845321789]
[2020-10-16 12:08:57,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:57,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:57,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:57,631 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845321789]
[2020-10-16 12:08:57,632 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:57,634 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:08:57,635 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525236500]
[2020-10-16 12:08:57,635 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:57,636 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:57,636 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:57,636 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:57,636 INFO  L87              Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 4 states.
[2020-10-16 12:08:57,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:57,690 INFO  L93              Difference]: Finished difference Result 529 states and 1605 transitions.
[2020-10-16 12:08:57,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:08:57,691 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 12:08:57,691 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:57,696 INFO  L225             Difference]: With dead ends: 529
[2020-10-16 12:08:57,696 INFO  L226             Difference]: Without dead ends: 529
[2020-10-16 12:08:57,696 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:57,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 529 states.
[2020-10-16 12:08:57,712 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529.
[2020-10-16 12:08:57,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 529 states.
[2020-10-16 12:08:57,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions.
[2020-10-16 12:08:57,715 INFO  L78                 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11
[2020-10-16 12:08:57,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:57,716 INFO  L481      AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions.
[2020-10-16 12:08:57,716 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:57,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions.
[2020-10-16 12:08:57,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:08:57,717 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:57,718 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:57,718 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:08:57,718 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:57,718 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:57,718 INFO  L82        PathProgramCache]: Analyzing trace with hash 2033440772, now seen corresponding path program 1 times
[2020-10-16 12:08:57,719 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:57,719 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740143340]
[2020-10-16 12:08:57,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:57,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:57,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:57,782 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740143340]
[2020-10-16 12:08:57,782 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:57,782 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:08:57,783 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881223594]
[2020-10-16 12:08:57,783 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:57,783 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:57,784 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:57,786 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:57,786 INFO  L87              Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states.
[2020-10-16 12:08:57,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:57,863 INFO  L93              Difference]: Finished difference Result 525 states and 1590 transitions.
[2020-10-16 12:08:57,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:57,864 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 12:08:57,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:57,868 INFO  L225             Difference]: With dead ends: 525
[2020-10-16 12:08:57,869 INFO  L226             Difference]: Without dead ends: 525
[2020-10-16 12:08:57,869 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:57,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 525 states.
[2020-10-16 12:08:57,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525.
[2020-10-16 12:08:57,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 525 states.
[2020-10-16 12:08:57,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1590 transitions.
[2020-10-16 12:08:57,888 INFO  L78                 Accepts]: Start accepts. Automaton has 525 states and 1590 transitions. Word has length 11
[2020-10-16 12:08:57,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:57,888 INFO  L481      AbstractCegarLoop]: Abstraction has 525 states and 1590 transitions.
[2020-10-16 12:08:57,888 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:57,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 525 states and 1590 transitions.
[2020-10-16 12:08:57,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 12:08:57,890 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:57,890 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:57,890 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:08:57,890 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:57,891 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:57,891 INFO  L82        PathProgramCache]: Analyzing trace with hash -1362475084, now seen corresponding path program 1 times
[2020-10-16 12:08:57,891 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:57,891 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523452329]
[2020-10-16 12:08:57,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:57,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:57,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:57,950 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523452329]
[2020-10-16 12:08:57,950 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:57,950 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:08:57,950 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253287897]
[2020-10-16 12:08:57,952 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:57,952 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:57,952 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:57,953 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:57,953 INFO  L87              Difference]: Start difference. First operand 525 states and 1590 transitions. Second operand 4 states.
[2020-10-16 12:08:57,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:57,987 INFO  L93              Difference]: Finished difference Result 674 states and 2001 transitions.
[2020-10-16 12:08:57,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:57,989 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 12:08:57,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:57,992 INFO  L225             Difference]: With dead ends: 674
[2020-10-16 12:08:57,993 INFO  L226             Difference]: Without dead ends: 374
[2020-10-16 12:08:57,993 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:57,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 374 states.
[2020-10-16 12:08:58,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374.
[2020-10-16 12:08:58,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 374 states.
[2020-10-16 12:08:58,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions.
[2020-10-16 12:08:58,006 INFO  L78                 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12
[2020-10-16 12:08:58,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:58,008 INFO  L481      AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions.
[2020-10-16 12:08:58,008 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:58,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions.
[2020-10-16 12:08:58,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:08:58,009 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:58,009 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:58,009 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:08:58,010 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:58,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:58,010 INFO  L82        PathProgramCache]: Analyzing trace with hash -80936382, now seen corresponding path program 1 times
[2020-10-16 12:08:58,010 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:58,012 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066149774]
[2020-10-16 12:08:58,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:58,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:58,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:58,144 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066149774]
[2020-10-16 12:08:58,144 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:58,145 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:58,147 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696525958]
[2020-10-16 12:08:58,148 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:08:58,151 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:58,152 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:08:58,152 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:58,152 INFO  L87              Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states.
[2020-10-16 12:08:58,255 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:58,255 INFO  L93              Difference]: Finished difference Result 372 states and 1058 transitions.
[2020-10-16 12:08:58,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:58,257 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 12:08:58,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:58,261 INFO  L225             Difference]: With dead ends: 372
[2020-10-16 12:08:58,262 INFO  L226             Difference]: Without dead ends: 372
[2020-10-16 12:08:58,263 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:58,265 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2020-10-16 12:08:58,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 365.
[2020-10-16 12:08:58,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 365 states.
[2020-10-16 12:08:58,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions.
[2020-10-16 12:08:58,278 INFO  L78                 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 13
[2020-10-16 12:08:58,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:58,279 INFO  L481      AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions.
[2020-10-16 12:08:58,279 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:08:58,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions.
[2020-10-16 12:08:58,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:08:58,281 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:58,282 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:58,282 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:08:58,282 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:58,282 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:58,283 INFO  L82        PathProgramCache]: Analyzing trace with hash -79337433, now seen corresponding path program 1 times
[2020-10-16 12:08:58,283 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:58,284 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162602762]
[2020-10-16 12:08:58,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:58,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:58,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:58,424 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162602762]
[2020-10-16 12:08:58,424 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:58,424 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:58,424 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579516240]
[2020-10-16 12:08:58,425 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:08:58,425 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:58,425 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:08:58,425 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:58,426 INFO  L87              Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand 5 states.
[2020-10-16 12:08:58,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:58,520 INFO  L93              Difference]: Finished difference Result 395 states and 1124 transitions.
[2020-10-16 12:08:58,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:58,521 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 12:08:58,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:58,524 INFO  L225             Difference]: With dead ends: 395
[2020-10-16 12:08:58,524 INFO  L226             Difference]: Without dead ends: 395
[2020-10-16 12:08:58,527 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:58,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2020-10-16 12:08:58,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395.
[2020-10-16 12:08:58,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 395 states.
[2020-10-16 12:08:58,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1124 transitions.
[2020-10-16 12:08:58,544 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 1124 transitions. Word has length 13
[2020-10-16 12:08:58,544 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:58,544 INFO  L481      AbstractCegarLoop]: Abstraction has 395 states and 1124 transitions.
[2020-10-16 12:08:58,544 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:08:58,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 1124 transitions.
[2020-10-16 12:08:58,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:08:58,545 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:58,545 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:58,546 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:08:58,546 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:58,546 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:58,546 INFO  L82        PathProgramCache]: Analyzing trace with hash 1785939198, now seen corresponding path program 1 times
[2020-10-16 12:08:58,546 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:58,547 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338915174]
[2020-10-16 12:08:58,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:58,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:58,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:58,709 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338915174]
[2020-10-16 12:08:58,710 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:58,710 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:08:58,710 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019491036]
[2020-10-16 12:08:58,711 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:08:58,711 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:58,712 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:08:58,712 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:58,712 INFO  L87              Difference]: Start difference. First operand 395 states and 1124 transitions. Second operand 6 states.
[2020-10-16 12:08:58,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:58,892 INFO  L93              Difference]: Finished difference Result 447 states and 1275 transitions.
[2020-10-16 12:08:58,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:58,893 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-16 12:08:58,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:58,896 INFO  L225             Difference]: With dead ends: 447
[2020-10-16 12:08:58,896 INFO  L226             Difference]: Without dead ends: 447
[2020-10-16 12:08:58,897 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:08:58,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 447 states.
[2020-10-16 12:08:58,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441.
[2020-10-16 12:08:58,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 441 states.
[2020-10-16 12:08:58,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1256 transitions.
[2020-10-16 12:08:58,912 INFO  L78                 Accepts]: Start accepts. Automaton has 441 states and 1256 transitions. Word has length 14
[2020-10-16 12:08:58,912 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:58,912 INFO  L481      AbstractCegarLoop]: Abstraction has 441 states and 1256 transitions.
[2020-10-16 12:08:58,912 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:08:58,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 441 states and 1256 transitions.
[2020-10-16 12:08:58,913 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:08:58,914 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:58,914 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:58,914 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:08:58,914 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:58,914 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:58,914 INFO  L82        PathProgramCache]: Analyzing trace with hash 1835505222, now seen corresponding path program 1 times
[2020-10-16 12:08:58,915 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:58,915 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081434541]
[2020-10-16 12:08:58,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:58,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:59,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:59,140 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081434541]
[2020-10-16 12:08:59,140 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:59,140 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:08:59,141 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658037434]
[2020-10-16 12:08:59,141 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:08:59,141 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:59,142 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:08:59,142 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:59,142 INFO  L87              Difference]: Start difference. First operand 441 states and 1256 transitions. Second operand 6 states.
[2020-10-16 12:08:59,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:59,252 INFO  L93              Difference]: Finished difference Result 437 states and 1242 transitions.
[2020-10-16 12:08:59,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:59,253 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-16 12:08:59,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:59,257 INFO  L225             Difference]: With dead ends: 437
[2020-10-16 12:08:59,257 INFO  L226             Difference]: Without dead ends: 437
[2020-10-16 12:08:59,257 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:59,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2020-10-16 12:08:59,269 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437.
[2020-10-16 12:08:59,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 437 states.
[2020-10-16 12:08:59,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1242 transitions.
[2020-10-16 12:08:59,272 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 1242 transitions. Word has length 14
[2020-10-16 12:08:59,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:59,272 INFO  L481      AbstractCegarLoop]: Abstraction has 437 states and 1242 transitions.
[2020-10-16 12:08:59,272 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:08:59,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 1242 transitions.
[2020-10-16 12:08:59,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:08:59,274 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:59,274 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:59,274 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:08:59,274 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:59,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:59,275 INFO  L82        PathProgramCache]: Analyzing trace with hash -470461361, now seen corresponding path program 1 times
[2020-10-16 12:08:59,275 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:59,275 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822522733]
[2020-10-16 12:08:59,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:59,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:59,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:59,413 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822522733]
[2020-10-16 12:08:59,413 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:59,414 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:08:59,414 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108842418]
[2020-10-16 12:08:59,414 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:08:59,414 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:59,415 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:08:59,415 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:59,415 INFO  L87              Difference]: Start difference. First operand 437 states and 1242 transitions. Second operand 7 states.
[2020-10-16 12:08:59,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:59,572 INFO  L93              Difference]: Finished difference Result 464 states and 1314 transitions.
[2020-10-16 12:08:59,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:59,574 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-16 12:08:59,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:59,578 INFO  L225             Difference]: With dead ends: 464
[2020-10-16 12:08:59,579 INFO  L226             Difference]: Without dead ends: 464
[2020-10-16 12:08:59,579 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:08:59,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 464 states.
[2020-10-16 12:08:59,595 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 389.
[2020-10-16 12:08:59,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 389 states.
[2020-10-16 12:08:59,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1094 transitions.
[2020-10-16 12:08:59,598 INFO  L78                 Accepts]: Start accepts. Automaton has 389 states and 1094 transitions. Word has length 15
[2020-10-16 12:08:59,599 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:59,599 INFO  L481      AbstractCegarLoop]: Abstraction has 389 states and 1094 transitions.
[2020-10-16 12:08:59,599 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:08:59,599 INFO  L276                IsEmpty]: Start isEmpty. Operand 389 states and 1094 transitions.
[2020-10-16 12:08:59,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:08:59,601 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:59,601 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:59,602 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:08:59,602 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:59,602 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:59,603 INFO  L82        PathProgramCache]: Analyzing trace with hash -470461144, now seen corresponding path program 1 times
[2020-10-16 12:08:59,603 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:59,603 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665495770]
[2020-10-16 12:08:59,604 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:59,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:59,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:08:59,878 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665495770]
[2020-10-16 12:08:59,878 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:59,878 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:08:59,878 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586677950]
[2020-10-16 12:08:59,879 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:08:59,879 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:59,879 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:08:59,880 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:59,880 INFO  L87              Difference]: Start difference. First operand 389 states and 1094 transitions. Second operand 7 states.
[2020-10-16 12:09:00,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:00,084 INFO  L93              Difference]: Finished difference Result 495 states and 1393 transitions.
[2020-10-16 12:09:00,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:09:00,085 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-16 12:09:00,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:00,092 INFO  L225             Difference]: With dead ends: 495
[2020-10-16 12:09:00,092 INFO  L226             Difference]: Without dead ends: 495
[2020-10-16 12:09:00,092 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:09:00,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 495 states.
[2020-10-16 12:09:00,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 429.
[2020-10-16 12:09:00,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 429 states.
[2020-10-16 12:09:00,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1214 transitions.
[2020-10-16 12:09:00,110 INFO  L78                 Accepts]: Start accepts. Automaton has 429 states and 1214 transitions. Word has length 15
[2020-10-16 12:09:00,111 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:00,111 INFO  L481      AbstractCegarLoop]: Abstraction has 429 states and 1214 transitions.
[2020-10-16 12:09:00,111 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:09:00,111 INFO  L276                IsEmpty]: Start isEmpty. Operand 429 states and 1214 transitions.
[2020-10-16 12:09:00,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:09:00,113 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:00,113 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:00,113 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 12:09:00,113 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:00,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:00,114 INFO  L82        PathProgramCache]: Analyzing trace with hash 1066077478, now seen corresponding path program 1 times
[2020-10-16 12:09:00,114 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:00,118 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773119888]
[2020-10-16 12:09:00,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:00,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:00,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:00,167 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773119888]
[2020-10-16 12:09:00,167 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:00,167 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:09:00,167 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676826628]
[2020-10-16 12:09:00,168 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:09:00,168 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:00,168 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:09:00,168 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:09:00,169 INFO  L87              Difference]: Start difference. First operand 429 states and 1214 transitions. Second operand 3 states.
[2020-10-16 12:09:00,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:00,181 INFO  L93              Difference]: Finished difference Result 609 states and 1691 transitions.
[2020-10-16 12:09:00,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:09:00,182 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 15
[2020-10-16 12:09:00,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:00,184 INFO  L225             Difference]: With dead ends: 609
[2020-10-16 12:09:00,185 INFO  L226             Difference]: Without dead ends: 321
[2020-10-16 12:09:00,185 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:09:00,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2020-10-16 12:09:00,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 309.
[2020-10-16 12:09:00,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 309 states.
[2020-10-16 12:09:00,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 790 transitions.
[2020-10-16 12:09:00,194 INFO  L78                 Accepts]: Start accepts. Automaton has 309 states and 790 transitions. Word has length 15
[2020-10-16 12:09:00,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:00,195 INFO  L481      AbstractCegarLoop]: Abstraction has 309 states and 790 transitions.
[2020-10-16 12:09:00,195 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:09:00,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 309 states and 790 transitions.
[2020-10-16 12:09:00,196 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:09:00,196 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:00,196 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:00,196 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 12:09:00,197 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:00,197 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:00,197 INFO  L82        PathProgramCache]: Analyzing trace with hash 1795300676, now seen corresponding path program 2 times
[2020-10-16 12:09:00,197 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:00,197 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525069963]
[2020-10-16 12:09:00,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:00,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:00,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:00,286 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525069963]
[2020-10-16 12:09:00,287 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:00,287 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:09:00,287 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290393238]
[2020-10-16 12:09:00,287 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:09:00,288 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:00,288 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:09:00,288 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:09:00,288 INFO  L87              Difference]: Start difference. First operand 309 states and 790 transitions. Second operand 4 states.
[2020-10-16 12:09:00,323 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:00,324 INFO  L93              Difference]: Finished difference Result 304 states and 695 transitions.
[2020-10-16 12:09:00,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:09:00,325 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 12:09:00,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:00,327 INFO  L225             Difference]: With dead ends: 304
[2020-10-16 12:09:00,327 INFO  L226             Difference]: Without dead ends: 231
[2020-10-16 12:09:00,327 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:09:00,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2020-10-16 12:09:00,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231.
[2020-10-16 12:09:00,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2020-10-16 12:09:00,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 520 transitions.
[2020-10-16 12:09:00,335 INFO  L78                 Accepts]: Start accepts. Automaton has 231 states and 520 transitions. Word has length 15
[2020-10-16 12:09:00,335 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:00,335 INFO  L481      AbstractCegarLoop]: Abstraction has 231 states and 520 transitions.
[2020-10-16 12:09:00,335 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:09:00,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 231 states and 520 transitions.
[2020-10-16 12:09:00,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:09:00,336 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:00,336 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:00,337 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 12:09:00,337 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:00,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:00,337 INFO  L82        PathProgramCache]: Analyzing trace with hash 233532823, now seen corresponding path program 1 times
[2020-10-16 12:09:00,338 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:00,338 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498961357]
[2020-10-16 12:09:00,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:00,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:00,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:00,452 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498961357]
[2020-10-16 12:09:00,452 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:00,453 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:09:00,453 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114077771]
[2020-10-16 12:09:00,453 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:09:00,454 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:00,454 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:09:00,455 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:09:00,455 INFO  L87              Difference]: Start difference. First operand 231 states and 520 transitions. Second operand 5 states.
[2020-10-16 12:09:00,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:00,512 INFO  L93              Difference]: Finished difference Result 198 states and 407 transitions.
[2020-10-16 12:09:00,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:09:00,513 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 12:09:00,513 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:00,515 INFO  L225             Difference]: With dead ends: 198
[2020-10-16 12:09:00,515 INFO  L226             Difference]: Without dead ends: 160
[2020-10-16 12:09:00,517 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:09:00,519 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2020-10-16 12:09:00,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160.
[2020-10-16 12:09:00,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 160 states.
[2020-10-16 12:09:00,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 323 transitions.
[2020-10-16 12:09:00,523 INFO  L78                 Accepts]: Start accepts. Automaton has 160 states and 323 transitions. Word has length 16
[2020-10-16 12:09:00,524 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:00,524 INFO  L481      AbstractCegarLoop]: Abstraction has 160 states and 323 transitions.
[2020-10-16 12:09:00,524 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:09:00,524 INFO  L276                IsEmpty]: Start isEmpty. Operand 160 states and 323 transitions.
[2020-10-16 12:09:00,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:09:00,525 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:00,525 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:00,525 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 12:09:00,525 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:00,525 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:00,526 INFO  L82        PathProgramCache]: Analyzing trace with hash 1725380069, now seen corresponding path program 1 times
[2020-10-16 12:09:00,526 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:00,526 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549838187]
[2020-10-16 12:09:00,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:00,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:00,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:00,707 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549838187]
[2020-10-16 12:09:00,708 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:00,708 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:09:00,708 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237951753]
[2020-10-16 12:09:00,708 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:09:00,708 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:00,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:09:00,709 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:09:00,712 INFO  L87              Difference]: Start difference. First operand 160 states and 323 transitions. Second operand 8 states.
[2020-10-16 12:09:00,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:00,855 INFO  L93              Difference]: Finished difference Result 171 states and 337 transitions.
[2020-10-16 12:09:00,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:09:00,856 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 18
[2020-10-16 12:09:00,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:00,857 INFO  L225             Difference]: With dead ends: 171
[2020-10-16 12:09:00,857 INFO  L226             Difference]: Without dead ends: 159
[2020-10-16 12:09:00,858 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:09:00,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2020-10-16 12:09:00,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159.
[2020-10-16 12:09:00,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 159 states.
[2020-10-16 12:09:00,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 321 transitions.
[2020-10-16 12:09:00,863 INFO  L78                 Accepts]: Start accepts. Automaton has 159 states and 321 transitions. Word has length 18
[2020-10-16 12:09:00,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:00,864 INFO  L481      AbstractCegarLoop]: Abstraction has 159 states and 321 transitions.
[2020-10-16 12:09:00,864 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:09:00,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 159 states and 321 transitions.
[2020-10-16 12:09:00,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:09:00,865 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:00,865 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:00,865 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 12:09:00,865 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:00,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:00,866 INFO  L82        PathProgramCache]: Analyzing trace with hash -1856561729, now seen corresponding path program 2 times
[2020-10-16 12:09:00,866 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:00,866 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317849723]
[2020-10-16 12:09:00,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:00,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:01,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:01,015 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317849723]
[2020-10-16 12:09:01,015 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:01,015 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:09:01,016 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670644349]
[2020-10-16 12:09:01,016 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:09:01,016 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:01,016 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:09:01,017 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:09:01,017 INFO  L87              Difference]: Start difference. First operand 159 states and 321 transitions. Second operand 7 states.
[2020-10-16 12:09:01,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:01,094 INFO  L93              Difference]: Finished difference Result 208 states and 404 transitions.
[2020-10-16 12:09:01,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:09:01,095 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 18
[2020-10-16 12:09:01,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:01,096 INFO  L225             Difference]: With dead ends: 208
[2020-10-16 12:09:01,096 INFO  L226             Difference]: Without dead ends: 170
[2020-10-16 12:09:01,097 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:09:01,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2020-10-16 12:09:01,100 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167.
[2020-10-16 12:09:01,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 167 states.
[2020-10-16 12:09:01,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 333 transitions.
[2020-10-16 12:09:01,101 INFO  L78                 Accepts]: Start accepts. Automaton has 167 states and 333 transitions. Word has length 18
[2020-10-16 12:09:01,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:01,101 INFO  L481      AbstractCegarLoop]: Abstraction has 167 states and 333 transitions.
[2020-10-16 12:09:01,101 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:09:01,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 167 states and 333 transitions.
[2020-10-16 12:09:01,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:09:01,102 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:01,103 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:01,103 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 12:09:01,103 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:01,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:01,103 INFO  L82        PathProgramCache]: Analyzing trace with hash 704006419, now seen corresponding path program 3 times
[2020-10-16 12:09:01,103 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:01,104 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055587740]
[2020-10-16 12:09:01,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:01,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:01,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:01,262 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055587740]
[2020-10-16 12:09:01,263 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:01,263 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:09:01,263 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332975682]
[2020-10-16 12:09:01,264 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:09:01,264 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:01,264 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:09:01,264 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:09:01,265 INFO  L87              Difference]: Start difference. First operand 167 states and 333 transitions. Second operand 8 states.
[2020-10-16 12:09:01,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:01,429 INFO  L93              Difference]: Finished difference Result 190 states and 369 transitions.
[2020-10-16 12:09:01,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:09:01,430 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 18
[2020-10-16 12:09:01,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:01,431 INFO  L225             Difference]: With dead ends: 190
[2020-10-16 12:09:01,431 INFO  L226             Difference]: Without dead ends: 135
[2020-10-16 12:09:01,431 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:09:01,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2020-10-16 12:09:01,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124.
[2020-10-16 12:09:01,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2020-10-16 12:09:01,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions.
[2020-10-16 12:09:01,435 INFO  L78                 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18
[2020-10-16 12:09:01,435 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:01,435 INFO  L481      AbstractCegarLoop]: Abstraction has 124 states and 249 transitions.
[2020-10-16 12:09:01,436 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:09:01,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions.
[2020-10-16 12:09:01,436 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:09:01,436 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:01,437 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:01,437 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 12:09:01,437 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:01,437 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:01,437 INFO  L82        PathProgramCache]: Analyzing trace with hash 903386731, now seen corresponding path program 1 times
[2020-10-16 12:09:01,438 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:01,438 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79664349]
[2020-10-16 12:09:01,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:01,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:09:01,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:09:01,558 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79664349]
[2020-10-16 12:09:01,558 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:09:01,558 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:09:01,558 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870582224]
[2020-10-16 12:09:01,559 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:09:01,559 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:09:01,559 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:09:01,559 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:09:01,560 INFO  L87              Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 6 states.
[2020-10-16 12:09:01,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:09:01,619 INFO  L93              Difference]: Finished difference Result 111 states and 222 transitions.
[2020-10-16 12:09:01,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:09:01,620 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-16 12:09:01,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:09:01,621 INFO  L225             Difference]: With dead ends: 111
[2020-10-16 12:09:01,621 INFO  L226             Difference]: Without dead ends: 62
[2020-10-16 12:09:01,622 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:09:01,622 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2020-10-16 12:09:01,624 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62.
[2020-10-16 12:09:01,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2020-10-16 12:09:01,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions.
[2020-10-16 12:09:01,625 INFO  L78                 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18
[2020-10-16 12:09:01,625 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:09:01,625 INFO  L481      AbstractCegarLoop]: Abstraction has 62 states and 109 transitions.
[2020-10-16 12:09:01,625 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:09:01,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions.
[2020-10-16 12:09:01,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 12:09:01,626 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:09:01,627 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:09:01,627 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 12:09:01,627 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:09:01,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:09:01,628 INFO  L82        PathProgramCache]: Analyzing trace with hash -266848583, now seen corresponding path program 1 times
[2020-10-16 12:09:01,628 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:09:01,628 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293021195]
[2020-10-16 12:09:01,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:09:01,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:09:01,676 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:09:01,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:09:01,721 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:09:01,769 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:09:01,769 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:09:01,770 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 12:09:01,771 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 12:09:01,791 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L816-->L823: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In210152577 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In210152577 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In210152577 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In210152577 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (or .cse6 .cse7)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (and .cse0 .cse1 (= ~z~0_Out210152577 ~z$w_buff0~0_In210152577)) (and (or (and .cse2 (= ~z~0_Out210152577 ~z$w_buff1~0_In210152577) .cse3) (and (= ~z~0_Out210152577 ~z~0_In210152577) .cse4)) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out210152577 |ULTIMATE.start_assume_abort_if_not_#in~cond_In210152577|) (or (and (= ~z$w_buff0_used~0_Out210152577 ~z$w_buff0_used~0_In210152577) .cse5) (and .cse0 .cse1 (= ~z$w_buff0_used~0_Out210152577 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out210152577 0)) (= ~z$r_buff0_thd0~0_Out210152577 ~z$r_buff0_thd0~0_In210152577) (or (and .cse4 (= ~z$w_buff1_used~0_Out210152577 ~z$w_buff1_used~0_In210152577)) (and .cse2 .cse3 (= ~z$w_buff1_used~0_Out210152577 0))) (= ~z$r_buff1_thd0~0_Out210152577 ~z$r_buff1_thd0~0_In210152577))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In210152577|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In210152577, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210152577, ~z$w_buff0~0=~z$w_buff0~0_In210152577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In210152577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In210152577, ~z$w_buff1~0=~z$w_buff1~0_In210152577, ~z~0=~z~0_In210152577}  OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out210152577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out210152577, ~z$w_buff0~0=~z$w_buff0~0_In210152577, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out210152577, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out210152577|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out210152577|, ~z$w_buff1~0=~z$w_buff1~0_In210152577, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out210152577|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out210152577|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out210152577|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In210152577|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out210152577, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out210152577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out210152577, ~z~0=~z~0_Out210152577}  AuxVars[]  AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-16 12:09:01,798 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,798 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,799 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,799 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,799 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,799 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,800 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,800 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,800 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,800 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,800 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,801 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,802 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,802 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,802 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,802 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,803 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,803 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,803 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,804 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,804 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,804 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,804 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,805 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,805 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,805 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,805 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,806 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,806 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,806 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,807 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,807 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,808 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,811 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,811 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,811 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,811 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,811 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,812 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,812 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,813 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,815 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,815 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,815 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,815 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,816 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,816 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,816 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,816 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,816 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,816 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,817 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,817 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,817 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:09:01,818 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:09:01,879 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:09:01 BasicIcfg
[2020-10-16 12:09:01,879 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:09:01,882 INFO  L168              Benchmark]: Toolchain (without parser) took 16992.63 ms. Allocated memory was 139.5 MB in the beginning and 404.8 MB in the end (delta: 265.3 MB). Free memory was 100.6 MB in the beginning and 312.3 MB in the end (delta: -211.7 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,883 INFO  L168              Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,883 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 770.91 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,884 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,885 INFO  L168              Benchmark]: Boogie Preprocessor took 39.97 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,885 INFO  L168              Benchmark]: RCFGBuilder took 2312.84 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 151.3 MB in the beginning and 169.5 MB in the end (delta: -18.2 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,886 INFO  L168              Benchmark]: TraceAbstraction took 13794.42 ms. Allocated memory was 248.0 MB in the beginning and 404.8 MB in the end (delta: 156.8 MB). Free memory was 169.5 MB in the beginning and 312.3 MB in the end (delta: -142.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB.
[2020-10-16 12:09:01,889 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.42 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 770.91 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 39.97 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2312.84 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 151.3 MB in the beginning and 169.5 MB in the end (delta: -18.2 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 13794.42 ms. Allocated memory was 248.0 MB in the beginning and 404.8 MB in the end (delta: 156.8 MB). Free memory was 169.5 MB in the beginning and 312.3 MB in the end (delta: -142.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    840 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 74 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.0s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4800 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L706]               0  int y = 0;
[L708]               0  int z = 0;
[L709]               0  _Bool z$flush_delayed;
[L710]               0  int z$mem_tmp;
[L711]               0  _Bool z$r_buff0_thd0;
[L712]               0  _Bool z$r_buff0_thd1;
[L713]               0  _Bool z$r_buff0_thd2;
[L714]               0  _Bool z$r_buff0_thd3;
[L715]               0  _Bool z$r_buff1_thd0;
[L716]               0  _Bool z$r_buff1_thd1;
[L717]               0  _Bool z$r_buff1_thd2;
[L718]               0  _Bool z$r_buff1_thd3;
[L719]               0  _Bool z$read_delayed;
[L720]               0  int *z$read_delayed_var;
[L721]               0  int z$w_buff0;
[L722]               0  _Bool z$w_buff0_used;
[L723]               0  int z$w_buff1;
[L724]               0  _Bool z$w_buff1_used;
[L725]               0  _Bool weak$$choice0;
[L726]               0  _Bool weak$$choice2;
[L807]               0  pthread_t t2037;
[L808]  FCALL, FORK  0  pthread_create(&t2037, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L809]               0  pthread_t t2038;
[L810]  FCALL, FORK  0  pthread_create(&t2038, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L811]               0  pthread_t t2039;
[L812]  FCALL, FORK  0  pthread_create(&t2039, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L730]               1  z$w_buff1 = z$w_buff0
[L731]               1  z$w_buff0 = 2
[L732]               1  z$w_buff1_used = z$w_buff0_used
[L733]               1  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L735]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L736]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L737]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L738]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L739]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L759]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L762]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L765]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L765]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L766]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L766]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L767]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L767]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L768]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L768]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L769]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L769]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L779]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L772]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L774]               2  return 0;
[L782]               3  z = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L785]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L785]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L786]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L786]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L787]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L787]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L788]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L788]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L789]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L789]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L745]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L745]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L746]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L746]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L747]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L747]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L748]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L748]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L749]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L749]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L752]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L754]               1  return 0;
[L792]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L794]               3  return 0;
[L814]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L825]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L826]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L827]               0  z$flush_delayed = weak$$choice2
[L828]               0  z$mem_tmp = z
[L829]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L829]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1
[L829]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L829]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L830]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L830]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L830]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L830]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L831]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L831]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L831]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1
[L831]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L831]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L831]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L832]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L832]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L833]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L833]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L834]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L834]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L834]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L834]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L834]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L834]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L835]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L835]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L836]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L837]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L837]               0  z = z$flush_delayed ? z$mem_tmp : z
[L838]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 395 SDtfs, 525 SDslu, 734 SDs, 0 SdLazy, 479 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 32186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...