/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-keepdead.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i


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


This is Ultimate 0.2.0-aa1e80b
[2020-12-17 23:37:10,032 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-12-17 23:37:10,037 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-12-17 23:37:10,093 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-12-17 23:37:10,094 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-12-17 23:37:10,098 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-12-17 23:37:10,102 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-12-17 23:37:10,110 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-12-17 23:37:10,113 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-12-17 23:37:10,119 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-12-17 23:37:10,121 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-12-17 23:37:10,123 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-12-17 23:37:10,123 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-12-17 23:37:10,127 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-12-17 23:37:10,129 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-12-17 23:37:10,131 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-12-17 23:37:10,132 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-12-17 23:37:10,136 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-12-17 23:37:10,144 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-12-17 23:37:10,152 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-12-17 23:37:10,154 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-12-17 23:37:10,156 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-12-17 23:37:10,157 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-12-17 23:37:10,160 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-12-17 23:37:10,170 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-12-17 23:37:10,170 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-12-17 23:37:10,171 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-12-17 23:37:10,173 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-12-17 23:37:10,174 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-12-17 23:37:10,175 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-12-17 23:37:10,175 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-12-17 23:37:10,176 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-12-17 23:37:10,179 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-12-17 23:37:10,180 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-12-17 23:37:10,181 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-12-17 23:37:10,181 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-12-17 23:37:10,182 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-12-17 23:37:10,182 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-12-17 23:37:10,183 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-12-17 23:37:10,184 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-12-17 23:37:10,185 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-12-17 23:37:10,186 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-keepdead.epf
[2020-12-17 23:37:10,242 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-12-17 23:37:10,242 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-12-17 23:37:10,246 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-12-17 23:37:10,247 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-12-17 23:37:10,247 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-12-17 23:37:10,247 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-12-17 23:37:10,247 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-12-17 23:37:10,248 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-12-17 23:37:10,248 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-12-17 23:37:10,249 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-12-17 23:37:10,250 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-12-17 23:37:10,250 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-12-17 23:37:10,250 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-12-17 23:37:10,251 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-12-17 23:37:10,251 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-12-17 23:37:10,251 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-12-17 23:37:10,251 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-12-17 23:37:10,252 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-12-17 23:37:10,252 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-12-17 23:37:10,252 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-12-17 23:37:10,253 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-12-17 23:37:10,253 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-12-17 23:37:10,253 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-12-17 23:37:10,254 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-12-17 23:37:10,254 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-12-17 23:37:10,254 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-12-17 23:37:10,254 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-12-17 23:37:10,255 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2020-12-17 23:37:10,255 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-12-17 23:37:10,255 INFO  L138        SettingsManager]:  * Remove dead ends from automaton=false
[2020-12-17 23:37:10,255 INFO  L138        SettingsManager]:  * Minimization of abstraction=NONE
[2020-12-17 23:37:10,256 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2020-12-17 23:37:10,712 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-12-17 23:37:10,740 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-12-17 23:37:10,743 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-12-17 23:37:10,745 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-12-17 23:37:10,745 INFO  L275        PluginConnector]: CDTParser initialized
[2020-12-17 23:37:10,747 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i
[2020-12-17 23:37:10,839 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0baa62889/67b45025612643d59f1762f02a890d6a/FLAG2d887dd07
[2020-12-17 23:37:11,497 INFO  L306              CDTParser]: Found 1 translation units.
[2020-12-17 23:37:11,497 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i
[2020-12-17 23:37:11,526 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0baa62889/67b45025612643d59f1762f02a890d6a/FLAG2d887dd07
[2020-12-17 23:37:11,790 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0baa62889/67b45025612643d59f1762f02a890d6a
[2020-12-17 23:37:11,794 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-12-17 23:37:11,797 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-12-17 23:37:11,801 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-12-17 23:37:11,801 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-12-17 23:37:11,805 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-12-17 23:37:11,807 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:37:11" (1/1) ...
[2020-12-17 23:37:11,813 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5d7e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:11, skipping insertion in model container
[2020-12-17 23:37:11,813 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:37:11" (1/1) ...
[2020-12-17 23:37:11,823 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-12-17 23:37:11,905 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-12-17 23:37:12,433 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-12-17 23:37:12,446 INFO  L203         MainTranslator]: Completed pre-run
[2020-12-17 23:37:12,537 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-12-17 23:37:12,669 INFO  L208         MainTranslator]: Completed translation
[2020-12-17 23:37:12,670 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12 WrapperNode
[2020-12-17 23:37:12,670 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-12-17 23:37:12,671 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-12-17 23:37:12,671 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-12-17 23:37:12,671 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-12-17 23:37:12,691 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,710 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,750 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-12-17 23:37:12,750 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-12-17 23:37:12,751 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-12-17 23:37:12,751 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-12-17 23:37:12,762 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,762 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,768 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,768 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,780 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,784 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,788 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
[2020-12-17 23:37:12,794 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-12-17 23:37:12,795 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-12-17 23:37:12,795 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-12-17 23:37:12,795 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-12-17 23:37:12,796 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-12-17 23:37:12,900 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-12-17 23:37:12,901 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-12-17 23:37:12,901 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-12-17 23:37:12,902 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-12-17 23:37:12,902 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-12-17 23:37:12,903 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-12-17 23:37:12,903 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-12-17 23:37:12,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-12-17 23:37:12,907 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-12-17 23:37:12,907 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-12-17 23:37:12,907 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-12-17 23:37:12,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-12-17 23:37:12,910 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-12-17 23:37:15,003 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-12-17 23:37:15,004 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-12-17 23:37:15,006 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:37:15 BoogieIcfgContainer
[2020-12-17 23:37:15,006 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-12-17 23:37:15,008 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-12-17 23:37:15,009 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-12-17 23:37:15,012 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-12-17 23:37:15,012 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:37:11" (1/3) ...
[2020-12-17 23:37:15,013 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3128b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:37:15, skipping insertion in model container
[2020-12-17 23:37:15,013 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:37:12" (2/3) ...
[2020-12-17 23:37:15,014 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3128b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:37:15, skipping insertion in model container
[2020-12-17 23:37:15,014 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:37:15" (3/3) ...
[2020-12-17 23:37:15,015 INFO  L111   eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i
[2020-12-17 23:37:15,033 WARN  L168   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-12-17 23:37:15,034 INFO  L179   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-12-17 23:37:15,038 INFO  L191   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-12-17 23:37:15,039 INFO  L351   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-12-17 23:37:15,076 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,076 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,076 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,077 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,077 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,077 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,077 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,077 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,078 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,078 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,078 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,078 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,079 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,079 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,079 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,080 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,080 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,080 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,080 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,080 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,081 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,081 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,081 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,082 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,082 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,082 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,083 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,083 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,084 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,084 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,085 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,086 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,088 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,089 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,089 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,089 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,091 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,091 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,091 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,091 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,095 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,096 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,096 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,096 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,096 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,097 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,097 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,097 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,097 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,098 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,103 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,103 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,103 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,105 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,105 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,106 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,106 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 23:37:15,108 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-12-17 23:37:15,122 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2020-12-17 23:37:15,146 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-12-17 23:37:15,146 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-12-17 23:37:15,146 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-12-17 23:37:15,146 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-12-17 23:37:15,146 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-12-17 23:37:15,147 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-12-17 23:37:15,147 INFO  L383      AbstractCegarLoop]: Minimize is NONE
[2020-12-17 23:37:15,147 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-12-17 23:37:15,160 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 87 transitions, 184 flow
[2020-12-17 23:37:15,289 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 2443 states, 2439 states have (on average 2.8232882328823288) internal successors, (6886), 2442 states have internal predecessors, (6886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:15,300 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2443 states, 2439 states have (on average 2.8232882328823288) internal successors, (6886), 2442 states have internal predecessors, (6886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:15,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2020-12-17 23:37:15,310 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:15,311 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:15,312 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:15,318 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:15,319 INFO  L82        PathProgramCache]: Analyzing trace with hash 443452642, now seen corresponding path program 1 times
[2020-12-17 23:37:15,329 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:15,329 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517952953]
[2020-12-17 23:37:15,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:15,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:15,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:15,745 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517952953]
[2020-12-17 23:37:15,746 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:15,747 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-12-17 23:37:15,748 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285894522]
[2020-12-17 23:37:15,753 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-12-17 23:37:15,753 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:15,769 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-12-17 23:37:15,770 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-12-17 23:37:15,781 INFO  L87              Difference]: Start difference. First operand  has 2443 states, 2439 states have (on average 2.8232882328823288) internal successors, (6886), 2442 states have internal predecessors, (6886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:15,885 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:15,885 INFO  L93              Difference]: Finished difference Result 2067 states and 5565 transitions.
[2020-12-17 23:37:15,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-12-17 23:37:15,888 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41
[2020-12-17 23:37:15,888 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:15,890 INFO  L763         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-12-17 23:37:15,890 INFO  L78                 Accepts]: Start accepts. Automaton has 2067 states and 5565 transitions. Word has length 41
[2020-12-17 23:37:15,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:15,892 INFO  L481      AbstractCegarLoop]: Abstraction has 2067 states and 5565 transitions.
[2020-12-17 23:37:15,892 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:15,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 2067 states and 5565 transitions.
[2020-12-17 23:37:15,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2020-12-17 23:37:15,903 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:15,903 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:15,904 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-12-17 23:37:15,904 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:15,905 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:15,905 INFO  L82        PathProgramCache]: Analyzing trace with hash -1066228101, now seen corresponding path program 1 times
[2020-12-17 23:37:15,905 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:15,905 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560848061]
[2020-12-17 23:37:15,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:16,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:16,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:16,186 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560848061]
[2020-12-17 23:37:16,186 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:16,186 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 23:37:16,187 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557584278]
[2020-12-17 23:37:16,188 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 23:37:16,188 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:16,189 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 23:37:16,189 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 23:37:16,190 INFO  L87              Difference]: Start difference. First operand 2067 states and 5565 transitions. Second operand  has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:16,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:16,363 INFO  L93              Difference]: Finished difference Result 2387 states and 6349 transitions.
[2020-12-17 23:37:16,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 23:37:16,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54
[2020-12-17 23:37:16,365 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:16,366 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 23:37:16,366 INFO  L78                 Accepts]: Start accepts. Automaton has 2387 states and 6349 transitions. Word has length 54
[2020-12-17 23:37:16,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:16,367 INFO  L481      AbstractCegarLoop]: Abstraction has 2387 states and 6349 transitions.
[2020-12-17 23:37:16,367 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:16,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 2387 states and 6349 transitions.
[2020-12-17 23:37:16,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2020-12-17 23:37:16,372 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:16,373 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:16,373 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-12-17 23:37:16,373 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:16,374 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:16,374 INFO  L82        PathProgramCache]: Analyzing trace with hash -743834060, now seen corresponding path program 1 times
[2020-12-17 23:37:16,374 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:16,374 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877495454]
[2020-12-17 23:37:16,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:16,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:16,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:16,615 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877495454]
[2020-12-17 23:37:16,616 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:16,616 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 23:37:16,616 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524465687]
[2020-12-17 23:37:16,617 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 23:37:16,618 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:16,621 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 23:37:16,621 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 23:37:16,622 INFO  L87              Difference]: Start difference. First operand 2387 states and 6349 transitions. Second operand  has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:16,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:16,878 INFO  L93              Difference]: Finished difference Result 5125 states and 13498 transitions.
[2020-12-17 23:37:16,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 23:37:16,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59
[2020-12-17 23:37:16,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:16,881 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 23:37:16,881 INFO  L78                 Accepts]: Start accepts. Automaton has 5125 states and 13498 transitions. Word has length 59
[2020-12-17 23:37:16,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:16,884 INFO  L481      AbstractCegarLoop]: Abstraction has 5125 states and 13498 transitions.
[2020-12-17 23:37:16,884 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:16,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 5125 states and 13498 transitions.
[2020-12-17 23:37:16,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2020-12-17 23:37:16,892 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:16,892 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:16,893 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-12-17 23:37:16,893 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:16,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:16,893 INFO  L82        PathProgramCache]: Analyzing trace with hash 91479675, now seen corresponding path program 1 times
[2020-12-17 23:37:16,894 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:16,894 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319257349]
[2020-12-17 23:37:16,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:16,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:17,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:17,138 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319257349]
[2020-12-17 23:37:17,138 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:17,138 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-12-17 23:37:17,139 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742162132]
[2020-12-17 23:37:17,139 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-12-17 23:37:17,139 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:17,140 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-12-17 23:37:17,140 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-12-17 23:37:17,141 INFO  L87              Difference]: Start difference. First operand 5125 states and 13498 transitions. Second operand  has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:17,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:17,364 INFO  L93              Difference]: Finished difference Result 6475 states and 16963 transitions.
[2020-12-17 23:37:17,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-12-17 23:37:17,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61
[2020-12-17 23:37:17,365 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:17,365 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2020-12-17 23:37:17,366 INFO  L78                 Accepts]: Start accepts. Automaton has 6475 states and 16963 transitions. Word has length 61
[2020-12-17 23:37:17,366 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:17,366 INFO  L481      AbstractCegarLoop]: Abstraction has 6475 states and 16963 transitions.
[2020-12-17 23:37:17,366 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:17,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 6475 states and 16963 transitions.
[2020-12-17 23:37:17,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2020-12-17 23:37:17,379 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:17,379 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:17,379 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-12-17 23:37:17,380 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:17,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:17,380 INFO  L82        PathProgramCache]: Analyzing trace with hash 825939865, now seen corresponding path program 2 times
[2020-12-17 23:37:17,381 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:17,381 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695216038]
[2020-12-17 23:37:17,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:17,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:17,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:17,761 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695216038]
[2020-12-17 23:37:17,761 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:17,762 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-12-17 23:37:17,762 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428288176]
[2020-12-17 23:37:17,763 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-12-17 23:37:17,764 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:17,764 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-12-17 23:37:17,765 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2020-12-17 23:37:17,765 INFO  L87              Difference]: Start difference. First operand 6475 states and 16963 transitions. Second operand  has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:18,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:18,355 INFO  L93              Difference]: Finished difference Result 9339 states and 24308 transitions.
[2020-12-17 23:37:18,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2020-12-17 23:37:18,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61
[2020-12-17 23:37:18,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:18,358 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380
[2020-12-17 23:37:18,358 INFO  L78                 Accepts]: Start accepts. Automaton has 9339 states and 24308 transitions. Word has length 61
[2020-12-17 23:37:18,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:18,361 INFO  L481      AbstractCegarLoop]: Abstraction has 9339 states and 24308 transitions.
[2020-12-17 23:37:18,362 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:18,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 9339 states and 24308 transitions.
[2020-12-17 23:37:18,377 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2020-12-17 23:37:18,378 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:18,378 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:18,378 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-12-17 23:37:18,378 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:18,379 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:18,379 INFO  L82        PathProgramCache]: Analyzing trace with hash -637520160, now seen corresponding path program 1 times
[2020-12-17 23:37:18,379 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:18,379 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240354553]
[2020-12-17 23:37:18,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:18,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:18,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:18,589 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240354553]
[2020-12-17 23:37:18,590 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:18,590 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 23:37:18,590 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182101887]
[2020-12-17 23:37:18,590 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 23:37:18,591 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:18,591 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 23:37:18,591 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 23:37:18,592 INFO  L87              Difference]: Start difference. First operand 9339 states and 24308 transitions. Second operand  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:18,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:18,814 INFO  L93              Difference]: Finished difference Result 3936 states and 9826 transitions.
[2020-12-17 23:37:18,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-12-17 23:37:18,815 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62
[2020-12-17 23:37:18,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:18,816 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 23:37:18,816 INFO  L78                 Accepts]: Start accepts. Automaton has 3936 states and 9826 transitions. Word has length 62
[2020-12-17 23:37:18,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:18,816 INFO  L481      AbstractCegarLoop]: Abstraction has 3936 states and 9826 transitions.
[2020-12-17 23:37:18,817 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:18,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 3936 states and 9826 transitions.
[2020-12-17 23:37:18,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2020-12-17 23:37:18,824 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:18,825 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:18,825 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-12-17 23:37:18,825 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:18,826 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:18,826 INFO  L82        PathProgramCache]: Analyzing trace with hash 729325144, now seen corresponding path program 1 times
[2020-12-17 23:37:18,826 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:18,826 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155141527]
[2020-12-17 23:37:18,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:18,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:19,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:19,068 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155141527]
[2020-12-17 23:37:19,068 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:19,068 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-12-17 23:37:19,068 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478721360]
[2020-12-17 23:37:19,069 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-12-17 23:37:19,070 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:19,070 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-12-17 23:37:19,071 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-12-17 23:37:19,071 INFO  L87              Difference]: Start difference. First operand 3936 states and 9826 transitions. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:19,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:19,321 INFO  L93              Difference]: Finished difference Result 2175 states and 5271 transitions.
[2020-12-17 23:37:19,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-12-17 23:37:19,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63
[2020-12-17 23:37:19,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:19,323 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210
[2020-12-17 23:37:19,323 INFO  L78                 Accepts]: Start accepts. Automaton has 2175 states and 5271 transitions. Word has length 63
[2020-12-17 23:37:19,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:19,323 INFO  L481      AbstractCegarLoop]: Abstraction has 2175 states and 5271 transitions.
[2020-12-17 23:37:19,324 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:19,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 2175 states and 5271 transitions.
[2020-12-17 23:37:19,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-12-17 23:37:19,328 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:19,329 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:19,329 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-12-17 23:37:19,329 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:19,330 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:19,330 INFO  L82        PathProgramCache]: Analyzing trace with hash 1099507567, now seen corresponding path program 1 times
[2020-12-17 23:37:19,330 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:19,330 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522455518]
[2020-12-17 23:37:19,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:19,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 23:37:19,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 23:37:19,589 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522455518]
[2020-12-17 23:37:19,589 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 23:37:19,589 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-12-17 23:37:19,590 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630189585]
[2020-12-17 23:37:19,590 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-12-17 23:37:19,590 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 23:37:19,591 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-12-17 23:37:19,591 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2020-12-17 23:37:19,592 INFO  L87              Difference]: Start difference. First operand 2175 states and 5271 transitions. Second operand  has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:19,856 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 23:37:19,856 INFO  L93              Difference]: Finished difference Result 3578 states and 8593 transitions.
[2020-12-17 23:37:19,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 23:37:19,857 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2020-12-17 23:37:19,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 23:37:19,858 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156
[2020-12-17 23:37:19,858 INFO  L78                 Accepts]: Start accepts. Automaton has 3578 states and 8593 transitions. Word has length 66
[2020-12-17 23:37:19,859 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 23:37:19,859 INFO  L481      AbstractCegarLoop]: Abstraction has 3578 states and 8593 transitions.
[2020-12-17 23:37:19,859 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-12-17 23:37:19,859 INFO  L276                IsEmpty]: Start isEmpty. Operand 3578 states and 8593 transitions.
[2020-12-17 23:37:19,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-12-17 23:37:19,867 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 23:37:19,868 INFO  L504         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-12-17 23:37:19,868 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-12-17 23:37:19,868 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 23:37:19,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 23:37:19,869 INFO  L82        PathProgramCache]: Analyzing trace with hash -1060927633, now seen corresponding path program 2 times
[2020-12-17 23:37:19,869 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 23:37:19,869 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099303230]
[2020-12-17 23:37:19,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 23:37:19,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-12-17 23:37:19,923 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-12-17 23:37:19,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-12-17 23:37:19,979 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-12-17 23:37:20,023 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-12-17 23:37:20,024 INFO  L605         BasicCegarLoop]: Counterexample might be feasible
[2020-12-17 23:37:20,024 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-12-17 23:37:20,194 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:37:20 BasicIcfg
[2020-12-17 23:37:20,195 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-12-17 23:37:20,198 INFO  L168              Benchmark]: Toolchain (without parser) took 8399.69 ms. Allocated memory was 302.0 MB in the beginning and 364.9 MB in the end (delta: 62.9 MB). Free memory was 276.4 MB in the beginning and 124.3 MB in the end (delta: 152.1 MB). Peak memory consumption was 215.2 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,199 INFO  L168              Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,200 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 869.17 ms. Allocated memory is still 302.0 MB. Free memory was 276.3 MB in the beginning and 281.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,200 INFO  L168              Benchmark]: Boogie Procedure Inliner took 78.70 ms. Allocated memory is still 302.0 MB. Free memory was 281.7 MB in the beginning and 278.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,202 INFO  L168              Benchmark]: Boogie Preprocessor took 43.72 ms. Allocated memory is still 302.0 MB. Free memory was 278.8 MB in the beginning and 276.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,204 INFO  L168              Benchmark]: RCFGBuilder took 2211.46 ms. Allocated memory was 302.0 MB in the beginning and 364.9 MB in the end (delta: 62.9 MB). Free memory was 276.7 MB in the beginning and 301.0 MB in the end (delta: -24.3 MB). Peak memory consumption was 173.9 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,206 INFO  L168              Benchmark]: TraceAbstraction took 5186.29 ms. Allocated memory is still 364.9 MB. Free memory was 299.9 MB in the beginning and 124.3 MB in the end (delta: 175.6 MB). Peak memory consumption was 175.6 MB. Max. memory is 16.0 GB.
[2020-12-17 23:37:20,214 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 869.17 ms. Allocated memory is still 302.0 MB. Free memory was 276.3 MB in the beginning and 281.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 78.70 ms. Allocated memory is still 302.0 MB. Free memory was 281.7 MB in the beginning and 278.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 43.72 ms. Allocated memory is still 302.0 MB. Free memory was 278.8 MB in the beginning and 276.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2211.46 ms. Allocated memory was 302.0 MB in the beginning and 364.9 MB in the end (delta: 62.9 MB). Free memory was 276.7 MB in the beginning and 301.0 MB in the end (delta: -24.3 MB). Peak memory consumption was 173.9 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 5186.29 ms. Allocated memory is still 364.9 MB. Free memory was 299.9 MB in the beginning and 124.3 MB in the end (delta: 175.6 MB). Peak memory consumption was 175.6 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L708]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L710]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L712]               0  int __unbuffered_p1_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L713]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0]
[L714]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L716]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L717]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L718]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L719]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L720]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L721]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L722]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0]
[L723]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L724]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L725]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0]
[L726]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L727]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L728]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L729]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L730]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L732]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L733]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L734]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L800]               0  pthread_t t1587;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L801]  FCALL, FORK  0  pthread_create(&t1587, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L802]               0  pthread_t t1588;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L803]  FCALL, FORK  0  pthread_create(&t1588, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L758]               2  x$w_buff1 = x$w_buff0
[L759]               2  x$w_buff0 = 2
[L760]               2  x$w_buff1_used = x$w_buff0_used
[L761]               2  x$w_buff0_used = (_Bool)1
[L18]   COND FALSE   2  !(!expression)
[L763]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L764]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L765]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L766]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L769]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L772]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L775]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L738]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L741]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L785]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L744]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L744]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L744]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L744]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L745]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L745]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L746]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L746]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L747]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L747]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L748]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L748]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L751]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L805]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L809]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L809]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L809]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L809]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L810]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L810]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L811]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L811]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L812]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L812]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L813]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L813]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L816]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               0  x$flush_delayed = weak$$choice2
[L819]               0  x$mem_tmp = x
[L820]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L820]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L821]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L821]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L821]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L821]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L822]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L822]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L822]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L822]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L823]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L823]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L823]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L823]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L824]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L824]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L825]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)
[L825]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L825]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L826]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L826]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L827]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1)
[L828]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L828]               0  x = x$flush_delayed ? x$mem_tmp : x
[L829]               0  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L18]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L17]   COND FALSE   0  !(0)
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L17]                0  __assert_fail ("0", "rfi000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 85 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 927 SDtfs, 1357 SDslu, 2963 SDs, 0 SdLazy, 367 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9339occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 99660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...