/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:44:15,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:44:15,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:44:15,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:44:15,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:44:15,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:44:15,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:44:15,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:44:15,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:44:15,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:44:15,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:44:15,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:44:15,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:44:15,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:44:15,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:44:15,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:44:15,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:44:15,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:44:15,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:44:15,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:44:15,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:44:15,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:44:15,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:44:15,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:44:15,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:44:15,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:44:15,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:44:15,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:44:15,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:44:15,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:44:15,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:44:15,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:44:15,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:44:15,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:44:15,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:44:15,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:44:15,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:44:15,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:44:15,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:44:15,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:44:15,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:44:15,781 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-PN-NoLbe.epf [2021-08-12 20:44:15,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:44:15,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:44:15,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:44:15,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:44:15,808 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:44:15,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:44:15,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:44:15,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:44:15,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:44:15,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:44:15,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:44:15,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:44:15,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:44:15,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:44:15,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:44:15,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:44:15,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:44:15,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:44:15,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:44:15,812 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 [2021-08-12 20:44:16,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:44:16,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:44:16,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:44:16,139 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:44:16,139 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:44:16,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2021-08-12 20:44:16,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ca1155a/d08c812a4d284de08d17bb55c1b2d23f/FLAG11042a683 [2021-08-12 20:44:16,768 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:44:16,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2021-08-12 20:44:16,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ca1155a/d08c812a4d284de08d17bb55c1b2d23f/FLAG11042a683 [2021-08-12 20:44:17,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ca1155a/d08c812a4d284de08d17bb55c1b2d23f [2021-08-12 20:44:17,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:44:17,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:44:17,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:44:17,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:44:17,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:44:17,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0051a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17, skipping insertion in model container [2021-08-12 20:44:17,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:44:17,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:44:17,287 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i[951,964] [2021-08-12 20:44:17,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:44:17,486 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:44:17,501 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i[951,964] [2021-08-12 20:44:17,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:44:17,649 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:44:17,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17 WrapperNode [2021-08-12 20:44:17,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:44:17,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:44:17,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:44:17,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:44:17,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:44:17,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:44:17,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:44:17,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:44:17,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (1/1) ... [2021-08-12 20:44:17,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:44:17,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:44:17,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:44:17,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:44:17,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (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 [2021-08-12 20:44:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:44:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:44:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:44:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:44:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:44:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:44:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:44:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:44:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:44:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:44:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:44:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:44:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:44:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:44:17,845 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 20:44:19,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:44:19,516 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:44:19,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:44:19 BoogieIcfgContainer [2021-08-12 20:44:19,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:44:19,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:44:19,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:44:19,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:44:19,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:44:17" (1/3) ... [2021-08-12 20:44:19,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324a1d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:44:19, skipping insertion in model container [2021-08-12 20:44:19,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:44:17" (2/3) ... [2021-08-12 20:44:19,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324a1d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:44:19, skipping insertion in model container [2021-08-12 20:44:19,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:44:19" (3/3) ... [2021-08-12 20:44:19,527 INFO L111 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2021-08-12 20:44:19,533 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:44:19,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:44:19,535 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:44:19,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,573 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,573 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,575 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,575 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,618 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:44:19,630 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:44:19,652 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 20:44:19,680 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:44:19,681 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:44:19,681 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:44:19,681 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:44:19,681 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:44:19,681 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:44:19,682 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:44:19,686 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:44:19,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-08-12 20:44:19,762 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-08-12 20:44:19,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:44:19,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-08-12 20:44:19,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-08-12 20:44:19,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-08-12 20:44:19,791 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-08-12 20:44:19,791 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:44:19,791 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:19,792 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-12 20:44:19,792 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1265037438, now seen corresponding path program 1 times [2021-08-12 20:44:19,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:19,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802504971] [2021-08-12 20:44:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:20,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:20,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:20,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:20,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802504971] [2021-08-12 20:44:20,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802504971] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:20,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:20,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:44:20,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482649911] [2021-08-12 20:44:20,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:44:20,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:44:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:44:20,063 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 114 [2021-08-12 20:44:20,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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) [2021-08-12 20:44:20,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:20,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 114 [2021-08-12 20:44:20,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:20,200 INFO L129 PetriNetUnfolder]: 49/266 cut-off events. [2021-08-12 20:44:20,200 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:44:20,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 266 events. 49/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1069 event pairs, 9 based on Foata normal form. 25/276 useless extension candidates. Maximal degree in co-relation 310. Up to 65 conditions per place. [2021-08-12 20:44:20,209 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2021-08-12 20:44:20,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 253 flow [2021-08-12 20:44:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:44:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:44:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2021-08-12 20:44:20,226 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9502923976608187 [2021-08-12 20:44:20,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2021-08-12 20:44:20,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2021-08-12 20:44:20,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:20,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2021-08-12 20:44:20,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2021-08-12 20:44:20,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2021-08-12 20:44:20,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2021-08-12 20:44:20,246 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2021-08-12 20:44:20,246 INFO L482 AbstractCegarLoop]: Abstraction has has 119 places, 111 transitions, 253 flow [2021-08-12 20:44:20,246 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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) [2021-08-12 20:44:20,246 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:20,246 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:20,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:44:20,247 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -286370380, now seen corresponding path program 1 times [2021-08-12 20:44:20,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:20,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759890009] [2021-08-12 20:44:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:20,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:20,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:20,468 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-08-12 20:44:20,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-12 20:44:20,486 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:44:20,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:44:20,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:20,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:20,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:20,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:20,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:20,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759890009] [2021-08-12 20:44:20,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759890009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:20,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:20,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:44:20,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64357670] [2021-08-12 20:44:20,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:44:20,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:44:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:44:20,535 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 114 [2021-08-12 20:44:20,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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) [2021-08-12 20:44:20,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:20,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 114 [2021-08-12 20:44:20,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:21,007 INFO L129 PetriNetUnfolder]: 581/1837 cut-off events. [2021-08-12 20:44:21,008 INFO L130 PetriNetUnfolder]: For 147/166 co-relation queries the response was YES. [2021-08-12 20:44:21,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 1837 events. 581/1837 cut-off events. For 147/166 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15064 event pairs, 308 based on Foata normal form. 0/1682 useless extension candidates. Maximal degree in co-relation 2978. Up to 416 conditions per place. [2021-08-12 20:44:21,026 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 47 selfloop transitions, 10 changer transitions 0/150 dead transitions. [2021-08-12 20:44:21,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 150 transitions, 465 flow [2021-08-12 20:44:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:44:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:44:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 901 transitions. [2021-08-12 20:44:21,031 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.878167641325536 [2021-08-12 20:44:21,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 901 transitions. [2021-08-12 20:44:21,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 901 transitions. [2021-08-12 20:44:21,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:21,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 901 transitions. [2021-08-12 20:44:21,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 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) [2021-08-12 20:44:21,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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) [2021-08-12 20:44:21,038 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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) [2021-08-12 20:44:21,039 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 8 predicate places. [2021-08-12 20:44:21,039 INFO L482 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 465 flow [2021-08-12 20:44:21,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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) [2021-08-12 20:44:21,040 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:21,040 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:21,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:44:21,040 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:21,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1171586153, now seen corresponding path program 1 times [2021-08-12 20:44:21,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:21,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759526207] [2021-08-12 20:44:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:21,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:21,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:21,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:21,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:21,195 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-08-12 20:44:21,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-12 20:44:21,205 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:44:21,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:44:21,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:21,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:21,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:21,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:21,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:21,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:21,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:21,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759526207] [2021-08-12 20:44:21,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759526207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:21,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:21,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:44:21,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186332912] [2021-08-12 20:44:21,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:44:21,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:44:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:44:21,244 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 114 [2021-08-12 20:44:21,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 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) [2021-08-12 20:44:21,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:21,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 114 [2021-08-12 20:44:21,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:21,860 INFO L129 PetriNetUnfolder]: 899/2785 cut-off events. [2021-08-12 20:44:21,860 INFO L130 PetriNetUnfolder]: For 385/771 co-relation queries the response was YES. [2021-08-12 20:44:21,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5851 conditions, 2785 events. 899/2785 cut-off events. For 385/771 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25553 event pairs, 191 based on Foata normal form. 14/2605 useless extension candidates. Maximal degree in co-relation 5785. Up to 630 conditions per place. [2021-08-12 20:44:21,886 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 76 selfloop transitions, 21 changer transitions 41/231 dead transitions. [2021-08-12 20:44:21,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 231 transitions, 1089 flow [2021-08-12 20:44:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:44:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:44:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2021-08-12 20:44:21,890 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8728070175438597 [2021-08-12 20:44:21,890 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 995 transitions. [2021-08-12 20:44:21,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 995 transitions. [2021-08-12 20:44:21,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:21,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 995 transitions. [2021-08-12 20:44:21,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.5) internal successors, (995), 10 states have internal predecessors, (995), 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) [2021-08-12 20:44:21,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2021-08-12 20:44:21,896 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2021-08-12 20:44:21,897 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2021-08-12 20:44:21,897 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 231 transitions, 1089 flow [2021-08-12 20:44:21,897 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 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) [2021-08-12 20:44:21,897 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:21,898 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:21,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:44:21,898 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2135554845, now seen corresponding path program 1 times [2021-08-12 20:44:21,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:21,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801039134] [2021-08-12 20:44:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:22,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:22,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:22,031 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:44:22,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:44:22,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:44:22,055 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:44:22,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:22,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:22,068 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:22,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801039134] [2021-08-12 20:44:22,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801039134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:22,069 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:22,069 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:44:22,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848936999] [2021-08-12 20:44:22,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:44:22,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:44:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:44:22,094 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-08-12 20:44:22,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 231 transitions, 1089 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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) [2021-08-12 20:44:22,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:22,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-08-12 20:44:22,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:22,621 INFO L129 PetriNetUnfolder]: 868/3113 cut-off events. [2021-08-12 20:44:22,621 INFO L130 PetriNetUnfolder]: For 211/286 co-relation queries the response was YES. [2021-08-12 20:44:22,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 3113 events. 868/3113 cut-off events. For 211/286 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29787 event pairs, 128 based on Foata normal form. 0/2899 useless extension candidates. Maximal degree in co-relation 6123. Up to 548 conditions per place. [2021-08-12 20:44:22,651 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 24 selfloop transitions, 17 changer transitions 32/249 dead transitions. [2021-08-12 20:44:22,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 249 transitions, 1159 flow [2021-08-12 20:44:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:44:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:44:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1043 transitions. [2021-08-12 20:44:22,654 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9149122807017543 [2021-08-12 20:44:22,654 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1043 transitions. [2021-08-12 20:44:22,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1043 transitions. [2021-08-12 20:44:22,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:22,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1043 transitions. [2021-08-12 20:44:22,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.3) internal successors, (1043), 10 states have internal predecessors, (1043), 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) [2021-08-12 20:44:22,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2021-08-12 20:44:22,661 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2021-08-12 20:44:22,661 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2021-08-12 20:44:22,661 INFO L482 AbstractCegarLoop]: Abstraction has has 145 places, 249 transitions, 1159 flow [2021-08-12 20:44:22,662 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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) [2021-08-12 20:44:22,662 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:22,662 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:22,662 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:44:22,662 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 541188829, now seen corresponding path program 1 times [2021-08-12 20:44:22,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:22,663 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411181027] [2021-08-12 20:44:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:22,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:22,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:22,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:22,781 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:44:22,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:44:22,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:44:22,805 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:44:22,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:22,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:22,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:22,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:22,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411181027] [2021-08-12 20:44:22,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411181027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:22,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:22,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:44:22,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999029015] [2021-08-12 20:44:22,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:44:22,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:44:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:44:22,818 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-08-12 20:44:22,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 249 transitions, 1159 flow. Second operand has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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) [2021-08-12 20:44:22,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:22,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-08-12 20:44:22,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:23,172 INFO L129 PetriNetUnfolder]: 431/1703 cut-off events. [2021-08-12 20:44:23,172 INFO L130 PetriNetUnfolder]: For 195/992 co-relation queries the response was YES. [2021-08-12 20:44:23,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1703 events. 431/1703 cut-off events. For 195/992 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14593 event pairs, 28 based on Foata normal form. 180/1752 useless extension candidates. Maximal degree in co-relation 3812. Up to 317 conditions per place. [2021-08-12 20:44:23,188 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 22 selfloop transitions, 44 changer transitions 46/224 dead transitions. [2021-08-12 20:44:23,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 224 transitions, 1055 flow [2021-08-12 20:44:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:44:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:44:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1357 transitions. [2021-08-12 20:44:23,191 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9156545209176788 [2021-08-12 20:44:23,191 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1357 transitions. [2021-08-12 20:44:23,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1357 transitions. [2021-08-12 20:44:23,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:23,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1357 transitions. [2021-08-12 20:44:23,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.38461538461539) internal successors, (1357), 13 states have internal predecessors, (1357), 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) [2021-08-12 20:44:23,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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) [2021-08-12 20:44:23,198 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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) [2021-08-12 20:44:23,198 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2021-08-12 20:44:23,198 INFO L482 AbstractCegarLoop]: Abstraction has has 157 places, 224 transitions, 1055 flow [2021-08-12 20:44:23,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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) [2021-08-12 20:44:23,199 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:23,199 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:23,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:44:23,199 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:23,200 INFO L82 PathProgramCache]: Analyzing trace with hash 333573244, now seen corresponding path program 1 times [2021-08-12 20:44:23,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:23,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673031579] [2021-08-12 20:44:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:23,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:23,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:23,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:23,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:23,291 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:44:23,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:44:23,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:44:23,317 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:44:23,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:23,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:23,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:23,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673031579] [2021-08-12 20:44:23,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673031579] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:23,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:23,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:44:23,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767930001] [2021-08-12 20:44:23,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:44:23,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:44:23,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:44:23,332 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-08-12 20:44:23,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 224 transitions, 1055 flow. Second operand has 8 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 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) [2021-08-12 20:44:23,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:23,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-08-12 20:44:23,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:23,748 INFO L129 PetriNetUnfolder]: 387/1421 cut-off events. [2021-08-12 20:44:23,749 INFO L130 PetriNetUnfolder]: For 466/1400 co-relation queries the response was YES. [2021-08-12 20:44:23,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1421 events. 387/1421 cut-off events. For 466/1400 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12350 event pairs, 18 based on Foata normal form. 180/1489 useless extension candidates. Maximal degree in co-relation 4064. Up to 298 conditions per place. [2021-08-12 20:44:23,766 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 19 selfloop transitions, 48 changer transitions 53/216 dead transitions. [2021-08-12 20:44:23,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 216 transitions, 1223 flow [2021-08-12 20:44:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:44:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:44:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1656 transitions. [2021-08-12 20:44:23,770 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2021-08-12 20:44:23,771 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1656 transitions. [2021-08-12 20:44:23,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1656 transitions. [2021-08-12 20:44:23,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:23,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1656 transitions. [2021-08-12 20:44:23,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 103.5) internal successors, (1656), 16 states have internal predecessors, (1656), 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) [2021-08-12 20:44:23,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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) [2021-08-12 20:44:23,781 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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) [2021-08-12 20:44:23,781 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2021-08-12 20:44:23,781 INFO L482 AbstractCegarLoop]: Abstraction has has 160 places, 216 transitions, 1223 flow [2021-08-12 20:44:23,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 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) [2021-08-12 20:44:23,781 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:23,781 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:23,782 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:44:23,782 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1692703860, now seen corresponding path program 1 times [2021-08-12 20:44:23,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:23,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808180068] [2021-08-12 20:44:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:44:23,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:23,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:23,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:44:23,919 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-08-12 20:44:23,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-12 20:44:23,932 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:44:23,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:44:23,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:23,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:44:23,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:44:23,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:44:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:44:23,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:44:23,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808180068] [2021-08-12 20:44:23,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808180068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:44:23,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:44:23,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:44:23,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534971830] [2021-08-12 20:44:23,977 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:44:23,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:44:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:44:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:44:23,980 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-08-12 20:44:23,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 216 transitions, 1223 flow. Second operand has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 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) [2021-08-12 20:44:23,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:44:23,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-08-12 20:44:23,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:44:24,323 INFO L129 PetriNetUnfolder]: 682/2396 cut-off events. [2021-08-12 20:44:24,323 INFO L130 PetriNetUnfolder]: For 809/1504 co-relation queries the response was YES. [2021-08-12 20:44:24,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7121 conditions, 2396 events. 682/2396 cut-off events. For 809/1504 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 23621 event pairs, 29 based on Foata normal form. 1/2205 useless extension candidates. Maximal degree in co-relation 7038. Up to 521 conditions per place. [2021-08-12 20:44:24,343 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 26 selfloop transitions, 5 changer transitions 67/234 dead transitions. [2021-08-12 20:44:24,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 234 transitions, 1429 flow [2021-08-12 20:44:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-12 20:44:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-08-12 20:44:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 768 transitions. [2021-08-12 20:44:24,346 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2021-08-12 20:44:24,346 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 768 transitions. [2021-08-12 20:44:24,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 768 transitions. [2021-08-12 20:44:24,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:44:24,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 768 transitions. [2021-08-12 20:44:24,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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) [2021-08-12 20:44:24,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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) [2021-08-12 20:44:24,352 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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) [2021-08-12 20:44:24,352 INFO L348 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2021-08-12 20:44:24,352 INFO L482 AbstractCegarLoop]: Abstraction has has 167 places, 234 transitions, 1429 flow [2021-08-12 20:44:24,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 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) [2021-08-12 20:44:24,353 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:44:24,353 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:44:24,353 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:44:24,354 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:44:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:44:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2047768272, now seen corresponding path program 2 times [2021-08-12 20:44:24,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:44:24,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869968803] [2021-08-12 20:44:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:44:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:44:24,420 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:44:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:44:24,472 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:44:24,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:44:24,525 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:44:24,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:44:24,528 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:44:24,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:44:24 BasicIcfg [2021-08-12 20:44:24,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:44:24,687 INFO L168 Benchmark]: Toolchain (without parser) took 7593.37 ms. Allocated memory was 199.2 MB in the beginning and 370.1 MB in the end (delta: 170.9 MB). Free memory was 163.1 MB in the beginning and 201.2 MB in the end (delta: -38.1 MB). Peak memory consumption was 133.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,687 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 199.2 MB. Free memory is still 180.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:44:24,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.22 ms. Allocated memory is still 199.2 MB. Free memory was 162.9 MB in the beginning and 157.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 199.2 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,688 INFO L168 Benchmark]: Boogie Preprocessor took 30.50 ms. Allocated memory is still 199.2 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,689 INFO L168 Benchmark]: RCFGBuilder took 1758.59 ms. Allocated memory was 199.2 MB in the beginning and 254.8 MB in the end (delta: 55.6 MB). Free memory was 151.8 MB in the beginning and 198.2 MB in the end (delta: -46.4 MB). Peak memory consumption was 89.8 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,689 INFO L168 Benchmark]: TraceAbstraction took 5166.91 ms. Allocated memory was 254.8 MB in the beginning and 370.1 MB in the end (delta: 115.3 MB). Free memory was 197.7 MB in the beginning and 201.2 MB in the end (delta: -3.5 MB). Peak memory consumption was 111.8 MB. Max. memory is 8.0 GB. [2021-08-12 20:44:24,691 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.17 ms. Allocated memory is still 199.2 MB. Free memory is still 180.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 555.22 ms. Allocated memory is still 199.2 MB. Free memory was 162.9 MB in the beginning and 157.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 199.2 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.50 ms. Allocated memory is still 199.2 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1758.59 ms. Allocated memory was 199.2 MB in the beginning and 254.8 MB in the end (delta: 55.6 MB). Free memory was 151.8 MB in the beginning and 198.2 MB in the end (delta: -46.4 MB). Peak memory consumption was 89.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5166.91 ms. Allocated memory was 254.8 MB in the beginning and 370.1 MB in the end (delta: 115.3 MB). Free memory was 197.7 MB in the beginning and 201.2 MB in the end (delta: -3.5 MB). Peak memory consumption was 111.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L723] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L724] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L725] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L726] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L727] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L733] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L734] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L735] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L736] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L737] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t385; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t386; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t387; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4851.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3145.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 88.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 236 SDslu, 345 SDs, 0 SdLazy, 323 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 300.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 710.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1429occurred in iteration=7, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.0ms SsaConstructionTime, 357.2ms SatisfiabilityAnalysisTime, 927.7ms InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 3045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...